projects - implement nonrecursivein-place version of the quick-sort algorithmas described at the end of section - experimentally compare the performance of in-place quick-sort and version of quick-sort that is not in-place - perform series of benchmarking tests on version of merge-sort and quick-sort to determine which one is faster your tests should include sequences that are "randomas well as "almostsorted - implement deterministic and randomized versions of the quick-sort algorithm and perform series of benchmarking tests to see which one is faster your tests should include sequences that are very "randomlooking as well as ones that are "almostsorted - implement an in-place version of insertion-sort and an in-place version of quick-sort perform benchmarking tests to determine the range of values of where quick-sort is on average better than insertion-sort - design and implement version of the bucket-sort algorithm for sorting list of entries with integer keys taken from the range [ ]for > the algorithm should run in ( ntime - design and implement an animation for one of the sorting algorithms described in this your animation should illustrate the key properties of this algorithm in an intuitive manner notes knuth' classic text on sorting and searching [ contains an extensive history of the sorting problem and algorithms for solving it huang and langston [ show how to merge two sorted lists in-place in linear time the standard quick-sort algorithm is due to hoare [ several optimizations for quick-sort are described by bentley and mcilroy [ more information about randomizationincluding chernoff boundscan be found in the appendix and the book by motwani and raghavan [ the quick-sort analysis given in this is combination of the analysis given in an earlier java edition of this book and the analysis of kleinberg and tardos [ exercise - is due to littman gonnet and baeza-yates [ analyze and compare experimentally several sorting algorithms the term "prune-and-searchcomes originally from the computational geometry literature (such as in the work of clarkson [ and megiddo [ ]the term "decreaseand-conqueris from levitin [