Does quicksort use pointers in cpp?
better than bubble atleast
right...recursion is better O() decreases significantly..it becomes O[log N] rt?
Quicksort is a sorting technique, used to sort the elements of array in ascending or descending order. Normally you don't need to use pointers. But yeah you can also use pointers to implement Quicksort!!