import java.util.Random; public class SortPerformanceTest{ public static void main(String... args){ System.out.println("Sort Methods : Time taken"); /* Lets test the performance of sorting algorithms with Serena Yv😉 */ int[] arr= new int[10000]; Random rnd = new Random(); for(int i=0; i<10000; i++){ //Storing 10k random number in array arr[i] = rnd.nextInt(1000); } long startTime = System.currentTimeMillis(); bubbleSort(arr); System.out.println("Bubble sort : "+(System.currentTimeMillis()-startTime)+" ms"); startTime = System.currentTimeMillis(); selectionSort(arr); System.out.println("Selection sort : "+(System.currentTimeMillis()-startTime)+" ms"); startTime = System.currentTimeMillis(); insertionSort(arr); System.out.println("Insertion sort : "+(System.currentTimeMillis()-startTime)+" ms"); startTime = System.currentTimeMillis(); quickSort(arr, 0, arr.length-1); System.out.println("Quick sort : "+(System.currentTimeMillis()-startTime)+" ms"); } static void bubbleSort(int[] arr){ int n=arr.length; int t=0; for(int i=0; i arr[j]){ //swap// t = arr[j-1]; arr[j-1] = arr[j]; arr[j] = t; } } } } static void selectionSort(int[] arr){ for (int i = 0; i < arr.length - 1; i++) { int index = i; for (int j = i + 1; j < arr.length; j++){ //swap// if (arr[j] < arr[index]){ index = j; } int smallerNumber = arr[index]; arr[index] = arr[i]; arr[i] = smallerNumber; } } } static void insertionSort(int[] arr) { int n = arr.length; int i, j, temp; for (i=1; i0 && temp pivot) j--; if (i <= j) { //swap// temp = arr[i]; arr[i] = arr[j]; arr[j] = temp; i++; j--; } } //Recursively sort lower half// if(lowi) quickSort(arr, i, high); } }

Sort Performance Test