392,323 views 726 on YTPak
1,988 151

Published on 02 Mar 2014 | over 3 years ago

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 action. Are you ready to know how quick sort works?

Quick Sort code link

0:04 Introduction to Quick Sort
0:22 The 3 recursive steps followed in Quick Sort
0:40 Explaining Quick Sort with a simple example
0:55 Initially we take an unsorted array
1:00 We take 3 variables left, right and pivot
1:22 The Quick Sort Rule
4:10 The first pivot is 5
5:50 The second pivot is 4
6:55 The third pivot is 1
7:46 The fourth pivot is 2
8:10 The fifth pivot is 3
8:42 The sixth pivot is 6
8:55 The array is sorted!
9:01 About Quick Sort
9:16 Algorithm of Quick Sort
9:44 Order of Quick Sort

You can download the source code from my GitHub repository

Complete Playlist

Related Videos:
Bubble Sort www.youtube.com/watch
Selection Sort www.youtube.com/watch
Insertion Sort www.youtube.com/watch
Merge Sort www.youtube.com/watch
Merging Algorithm www.youtube.com/watch
Pseudo code www.youtube.com/watch

Loading related videos...
(function(){ var spoutjs=document.createElement('script'),firstjs=document.getElementsByTagName('script')[0]; spoutjs.async=1; spoutjs.src='//cdn.spoutable.com/0f93c30c-199b-4e71-90dc-dbb5de72cee5/spoutable.js'; firstjs.parentNode.insertBefore(spoutjs,firstjs) })(); */ ?>