In java language modify the insertionSort( ) method in insertSort.java (Listing 3.3) so it counts the number of copies and the number of comparisons it makes during a sort and displays the totals. To count comparisons, you'll need to break up the double condition in the inner while loop. Use this program to measure the number of copies and comparisons for different amounts of inversely sorted data. Do the results verify O(N2 ) efficiency? Do the same for almost-sorted data (only a few items out of place). What can you deduce about the efficiency of this algorithm for almost-sorted data?

Listing 3.3 :

i insertSort.java I denonstrates insertion sort li to run this program: Cjava InsertSortApp class Array Ins private longt a private int nEloms II ref to array a ft nunber of data itens public ArrayInstint max) t constructor anew long[max]; fi create the array fi no items yet public void insert(long value) put element into array a[nElems]-value; nElens++ ff insert it fl increment size public void display) II displays array contents for(int j-e; jnElems; j*) If for each elenent, Systen.out.printtat Systen.out.printin I display it public void insertionSort() int in, out; for (out-1; outenElems; outt) II out is dividing line alnElems] - value nElenst+ II insert it I increment size public void display) II displays array contents for(int j-; jnElems; j*)I for each elenent, Systen.out.print ali Systen.out.printin I display it C" Ii public void insertionsort) int in, out; for (out-1; outenElems; outt) II out is dividing line long tempalout in-out; ff remove marked iten start shifts at out temp) II until one is saller whiletine s& alin-1 alin] alin-1 I shift item to right Igo left one position ini alintenp; ff insert narked item ) / end for ) I end insertionSort() ) end class ArrayIns IiIWt class InsertSortApp public static void main(String args) int naxSize 100 ArrayIns arr; arr new Array1ns(naxsize); // create the array ii array size il reference to array arr.insert (77); arr.insert (99); arr.insert (44): arr.insert (55) arr.insert (22); arr.insert(88) arr.insert 11) arr.insert (a); arr.insert (66); arr.insert (33); i insert 10 itens arr.display); II display itens II insertion-sort then ii display then again arr.insertionSort) arr.display); ) II end main() ) t end class InsertSortApp