advanced sorting in this shellsort partitioning quicksort we discussed simple sorting in the aptly titled "simple sorting the sorts described there--the bubbleselectionand insertion sorts--are easy to implement but are rather slow in "recursion,we described the mergesort it runs much faster than the simple sorts but requires twice as much space as the original arraythis is often serious drawback this covers two advanced approaches to sortingshellsort and quicksort these sorts both operate much faster than the simple sortsthe shellsort in about ( *(logn) timeand quicksort in ( *logntime neither of these sorts requires large amount of extra spaceas mergesort does the shellsort is almost as easy to implement as mergesortwhile quicksort is the fastest of all the general-purpose sorts we'll conclude the with brief mention of the radix sortan unusual and interesting approach to sorting we'll examine the shellsort first quicksort is based on the idea of partitioningso we'll then examine partitioning separatelybefore examining quicksort itself shellsort the shellsort is named for donald shellthe computer scientist who discovered it in it' based on the insertion sortbut adds new feature that dramatically improves the insertion sort' performance the shellsort is good for medium-sized arraysperhaps up to few thousand itemsdepending on the particular implementation it' not quite as fast as quicksort and other ( *lognsortsso it' not optimum for very large files howeverit' much faster than the ( sorts like the selection sort and the insertion sortand it' very easy to implementthe code is short and simple radix sort