package ds.interview.dataStructure.Algo;
//Bubble Sort
//In Every Lap Biggest element comes at last
import java.util.Arrays;
public class BubbleSort {
public static void main(String[] args)
{
int[] arr = {4,7,8,3,2,9,10,1};
System.out.println("Original: "+Arrays.toString(arr));
for(int i = 0;i<arr.length-1;i++)
{
for(int j=0;j<arr.length-1-i;j++) //"-i" coz. 2nd round me last wale se compare se bache
{
if(arr[j]>arr[j+1])
{
arr[j]= arr[j]+arr[j+1];
arr[j+1]= arr[j]-arr[j+1];
arr[j]=arr[j]-arr[j+1];
}
}
}
//***************Display Sorted elements**********
System.out.println("Sorted: "+Arrays.toString(arr));
}
}
//Bubble Sort
//In Every Lap Biggest element comes at last
import java.util.Arrays;
public class BubbleSort {
public static void main(String[] args)
{
int[] arr = {4,7,8,3,2,9,10,1};
System.out.println("Original: "+Arrays.toString(arr));
for(int i = 0;i<arr.length-1;i++)
{
for(int j=0;j<arr.length-1-i;j++) //"-i" coz. 2nd round me last wale se compare se bache
{
if(arr[j]>arr[j+1])
{
arr[j]= arr[j]+arr[j+1];
arr[j+1]= arr[j]-arr[j+1];
arr[j]=arr[j]-arr[j+1];
}
}
}
//***************Display Sorted elements**********
System.out.println("Sorted: "+Arrays.toString(arr));
}
}
No comments:
Post a Comment