Answer to Question #29529 in C++ for Arjita

Question

1.choose 7-15 equidistant pivot candidates from the list
2. Isloate the pivot candidates by moving them to the end of list.
3.Sort these pivot candidates with insertion sort.
4.Passively select 3 to 7 pivots starting from the second sorted candidate and every other candidate
5.Partition the list around pivots
6.Recursively call Multiple Pivot sort on any partition with more than 15 elements.Call Insertion sort on any partition with 2-15 elements