D.S & Algorithm

Quicksort

Quicksort Quicksort is depended on the divide and conquer technique. Set is reduced by sorting two smallest sets. Steps:Step-1: Identify the key value.Step-2: Scan from R->L stopping at value < key Interchange value & keyStep-3: Scan from L->R stopping at value > key Interchange value & keyStep-4: Continued step 2 & 3 Perform QUICKSORT on the given data: 44 33 …

Quicksort Read More »

Scroll to Top