1. 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. insertion sort
b. merge sort
c. selection sort
d. Quicksort
D. Quicksort method
Comments
Leave a comment