Quick sort Algorithm Explained [ Part - 1 ] | Divide And Conquer
--- Quick sort
In this algorithm we perform sorting by choosing a key element that is called as pivot element, and we partition the unsorted array around this pivot, such that all the elements
which are smaller than pivot gets in left, and elements which are greater than pivot gets in right side of the pivot element.
and if it is equal to the pivot, we can move it either side, left or right.
and we continue to choose pivot and perform partitioning until all the elements get sorted.
Quick sort Algorithm Solution [ Part - 2 ] | Divide And Conquer : • Quick sort Algorithm Solution [ Part - 2 ...
Median of medians Algorithm - [Linear Time Complexity O(n)] #PART-1 : • Median of medians Algorithm - [Linear Time...
Median of medians Algorithm - [Linear Time O(n)] #PART-2 : • Median of medians Algorithm - [Linear Time...
Full Course : https://www.udemy.com/course/algorith...
Instagram : / basicsstrong
Website : http://basicsstrong.com