Question

Write a program to implement Quick Sort by taking middle element as pivot element. Also compute the complexity of this program.​

Answer 1

Answer:

Quicksort is a divide-and-conquer algorithm. It works by selecting a 'pivot' element from the array and partitioning the other elements into two sub-arrays, according to whether they are less than or greater than the pivot. The sub-arrays are then sorted recursive

Navthej:-

if the answer is right. please mark it as brain list

                                                                                         your sincrencly