package SortMethods; import java.util.Arrays; public class InsertionSort { public static void main(String[] args) { // int[] data = randomArrInit(0,500); System.out.println(Arrays.toString(data)); boolean methodSwap = true; long startTime = System.currentTimeMillis(); for(int insIndex=1;insIndex0 && data[shutIndex-1]>data[shutIndex];shutIndex--){ if (methodSwap) {data=swap(data,shutIndex,shutIndex-1);} else {int temp = data[shutIndex-1]; data[shutIndex-1]=data[shutIndex]; data[shutIndex] = temp;} } } long spTime = System.currentTimeMillis()-startTime; System.out.println(Arrays.toString(data)); System.out.println("\nSpended time : "+spTime); } static int[] randomArrInit(int min, int max){ int range = Math.abs(max - min) + 1; int[] arr = new int[range]; for (int i=0;i