7.1Â Â Â Â Â Â Â Â Â Â Â Sort the sequence 3, 1, 4, 1, 5, 9, 2, 6, 5 using insertion sort.
Â
7.2Â Â Â Â Â Â Â Â Â Â Â What is the running time of insertion sort if all elements are equal?
Â
Â
Â
7.3           Suppose we exchange elements a[i] and a[i+k], which were originally out of order. Prove that at least 1 and at most 2k − 1 inversions are removed.
Â
7.4Â Â Â Â Â Â Â Â Â Â Â Show the result of running Shellsort on the input 9, 8, 7, 6, 5, 4, 3, 2, 1 using the increments {1, 3, 7}.
Â
Â
Â
Answers
Status NEW
Posted 07 Feb 2018 10:02 PM
My Price 4.00
Hel-----------lo -----------Sir-----------/Ma-----------dam-----------Tha-----------nk -----------You----------- fo-----------r u-----------sin-----------g o-----------ur -----------web-----------sit-----------e a-----------nd -----------acq-----------uis-----------iti-----------on -----------of -----------my -----------pos-----------ted----------- so-----------lut-----------ion-----------.Pl-----------eas-----------e p-----------ing----------- me----------- on-----------cha-----------t I----------- am----------- on-----------lin-----------e o-----------r i-----------nbo-----------x m-----------e a----------- me-----------ssa-----------ge -----------I w-----------ill----------- be-----------
Not Rated(0)