package Binarysearchprg;
public class Bubblesort {
public static void main(String[] args) {
int arr[]={23,53,22,1,4,52,61};
for(int i = arr.length-1; i >= 0; i--) {
for(int j = 0; j < i; j++) {
if(arr[j] > arr[j + 1]) {
int temp = arr[j];
arr[j] = arr[j + 1];
arr[j + 1] = temp;
}
}
}
for(int i = 0; i < arr.length; i++) {
System.out.print(arr[i] +" ");
}
}
}
public class Bubblesort {
public static void main(String[] args) {
int arr[]={23,53,22,1,4,52,61};
for(int i = arr.length-1; i >= 0; i--) {
for(int j = 0; j < i; j++) {
if(arr[j] > arr[j + 1]) {
int temp = arr[j];
arr[j] = arr[j + 1];
arr[j + 1] = temp;
}
}
}
for(int i = 0; i < arr.length; i++) {
System.out.print(arr[i] +" ");
}
}
}
No comments:
Post a Comment