Sorting Algorithm | Quick Sort - step by step guide

In this video we will learn about Quick sort algorithm which like Merge sort algorithm uses recursive approach to sort a given unsorted array. In this video I will be showing you Quick sort not in code but in ion. Are you ready to know how quick sort works?\r
\r
Quick Sort code link\r
\r
\r
0:04 Introduction to Quick Sort\r
0:22 The 3 recursive steps followed in Quick Sort\r
0:40 Explaining Quick Sort with a simple example\r
0:55 Initially we take an unsorted array\r
1:00 We take 3 variables left, right and pivot\r
1:22 The Quick Sort Rule\r
4:10 The first pivot is 5\r
5:50 The second pivot is 4\r
6:55 The third pivot is 1\r
7:46 The fourth pivot is 2\r
8:10 The fifth pivot is 3\r
8:42 The sixth pivot is 6\r
8:55 The array is sorted!\r
9:01 About Quick Sort\r
9:16 Algorithm of Quick Sort\r
9:44 Order of Quick Sort\r
\r
\r
You can download the source code from my GitHub repository\r
\r
\r
Complete Playlist\r
\r
\r
Related Videos:\r
Bubble Sort \r
Selection Sort \r
Insertion Sort \r
Merge Sort \r
Merging Algorithm \r
Pseudo code