Algorithms Homework – Fall 2000

The running time of insertion sort and the number of inversion in the input array are directly proportional; the more inversions there are the more time insertion sort takes to sort. Insertion sort best-case is increasing sorted order, worst-case is decreasing sorted order. d. ................
................