/* This program can be inaccurate😞. if you think that there is a problem in it then please state the problem 😢 in the comment section*/ import java.time.LocalTime; import java.time.temporal.ChronoField; public class Program { int time(){ LocalTime a1=LocalTime.now(); int b1=a1.get(ChronoField.MICRO_OF_SECOND); return b1; } public static void main(String[] args) { int[] a={38,52,9,18,6,62,13,43}; Program wasteOfTime=new Program(); int b= wasteOfTime.time(); System.out.println("BUBBLE SORT"); wasteOfTime.bubble(a); int c= wasteOfTime.time()-b; System.out.println("\nTime taken in micro seconds:"+c+"\n\nSELECTION SORT"); wasteOfTime.selection(a); int d= wasteOfTime.time()-(b+c); System.out.println("\nTime taken in micro seconds:"+d+"\n\nINSERTION SORT"); wasteOfTime.insertion(a); int e= wasteOfTime.time()-(b+c+d); System.out.println("\nTime taken in micro seconds:"+e+"\n\nMERGE SORT"); wasteOfTime.merge(a); int f= wasteOfTime.time()-(b+c+d+e); System.out.println("\nTime taken in micro seconds:"+f+"\n\nQUICK SORT"); wasteOfTime.quick(a); int g= wasteOfTime.time()-(b+c+d+e+f); System.out.println("\nTime taken in micro seconds:"+g+"\n\nHEAP SORT"); wasteOfTime.heap(a); int h= wasteOfTime.time()-(b+c+d+e+f+g); System.out.println("\nTime taken in micro seconds:"+h); } // BUBBLE SORT public void bubble(int[] a){ int temp; for(int i=0;ia[j+1]) { temp=a[j]; a[j]=a[j+1]; a[j+1]=temp; flag=1; } } if(flag==0){ break; } } for(int i=0;i0&&a[j-1]>temp) { a[j]=a[j-1]; j-=1; } a[j]=temp; } for(int i=0;ipivot){ high--; } if(low<=high){ int temp=a[low]; a[low]=a[high]; a[high]=temp; low++; high--; } } return low; } void qSRecursion(int[] a,int low,int high){ int pi=partition(a,low,high); if(low=0;i--){ heapify(a,length ,i); } for(int i=length-1;i>=0;i--){ int temp=a[0]; a[0]=a[i]; a[i]=temp; heapify(a,i,0); } } void heapify(int[] arr,int n,int i){ int largest=i; int li=2*i+1; int ri=2*i+2; if(liarr[largest]) { largest=li; } if(riarr[largest]) { largest=ri; } if(largest !=i){ int temp=arr[i]; arr[i]=arr[largest]; arr[largest]=temp; heapify(arr,n,largest); } } }

All Sorting algorithms