Write an algorithm to sort a list of elements using quick sort and hand simulate on a data set of at least 9 elements?

Answer 1

Design an algorithms to sent n numbers using insertion sort technique and trace the algorithm with an example. A sorting technique that sequences a list by continuously dividing the list into two parts and moving the lower items to one side and the higher items to the other. It starts by picking one item in the entire list to serve as a pivot point. The pivot could be the first item or a randomly chosen one. All items that compare lower than the pivot are moved to the left of the pivot; all equal or higher items are moved to the right. It then picks a pivot for the left side and moves those items to left and right of the pivot and continues the pivot picking and dividing until there is only one item left in the group. It then proceeds to the right side and performs the same operation again. See sort algorithm. {(12),1,5,7,19,15,8,9,10} {(12),1,5,7,10,15,8,9,19} {(12),1,5,7,10,9,8,15,19} {8,1,5,7,10,9,(12),15,19} {(7),1,5,8,10,9}{12}{(15),19} {5,1,(7),8,10,9}{12}{15,19} {(5),1}{7}{(8),10,9}{12}{15}{19} {1,(5)}{7}{(8),9,10}{12}{15}{19} {1,(5)}{7}{(8),9,10}{12}{15}{19} {1}{5}{7}{8}{(9),10}{12}{15}{19} {1}{5}{7}{8}{9}{10}{12}{15}{19} This quick sort uses randomly chosen pivots (in red) to keep dividing the list into two until there is only one item on each side of the pivot left.