Question

Consider the following unsorted list: 8, 3, 25, 6, 10, 17, 1, 2, 18, 5 (Here consider 8 is pivot for first pass and initially it is exchanged with the last element in the list) For Quick Sort Algorithm the partitions after the first pass will be

Answer 1

Answer:

khudkpata lag le jaaaa jaaaa