The sorting technique where array to be sorted is partitioned again and again in such a way that all elements less than or equal to partitioning element appear before it and those which are greater appear after it, is called ..............
A. Merge sort
B. Quick sort
C. Selection sort
D. None of these
Answer:B
The sorting technique where array to be sorted is partitioned again and again in such a way that all elements less than or equal to partitioning element appear before it and those which are greater appear after it, is called ..............
A. Merge sort B. Quick sort C. Selection sort D. None of these