Quick Sort Algorithm Explained and Implemented with Examples in Java | Sorting Algorithms | Geekific

Support us on Patreon: / geekific
GitHub Repository: github.com/geekific-official/...
Stay updated on our videos by subscribing to the channel and hitting the like button!
In the past few weeks, we’ve been adding a ton of videos to the sorting algorithms series. However, these videos were still missing one of the most important and efficient sorting algorithms. Today we intend we fix this, because in this video we detail and implement the quick sort algorithm.
Timestamps:
00:00 Introduction
01:25 Sorting an array using Quick Sort!
05:09 Quick Sort Implementation
09:25 Putting our Code to the Test
10:14 Thanks for Watching!
If you found this video helpful, check other Geekific uploads:
- Merge Sort (MergeSort) - Explained and Implemented: • Merge Sort Algorithm E...
- Java's Stream API Explained with Examples: • Java Stream API Explai...
- LinkedList Implementation in Java: • Implementing the Linke...
- New Features in Java 17: • New Features in Java 1...
- Sorting Algorithms Complexity: • Sorting Algorithms Tim...
- Generics and Wildcards in Java Made Simple: • Generics and Wildcards...
- Heap Space vs. Stack Memory in Java: • Heap Space vs. Stack M...
- Graphs, The Fundamentals: • Introduction to Graphs...
- Introduction to Unit-Testing with TDD: • Introduction to Unit-T...
- Dual-Pivot Quicksort Explained and Implemented in Java: • Dual-Pivot Quicksort E...
- TimSort Explained and Implemented in Java: • TimSort Explained and ...
#Geekific #SortingAlgorithms #QuickSort #Java

[@trannhanITSinhVien]

I think we have a simpler way for partition of an array: arr[] 1. Choose a pivot: p 2. Use two cursors L (left) that is the first index of array and R (right) is the last index. 3. Rule: while L = p (loop until we find an element that is less than pivot) 3.3. If L < R: swap(arr[L], arr[R]) 4. Return L (partition point) Then we call quickSort(arr, begin, mid - 1) and quickSort(arr, mid, end). With "begin" is the first index of array, "end" is the last index, "mid" = partition point.

[@santhoshkumar1278]

Thanks for this video. The explanations for the partition call stack was really helpful in understanding the algorithm better.

[@FluteVJ]

Fantastic explanation. To improvise the performance we can avoid the swapping for the pivotIndexCounter == i. At 6:42 inside the if condition you can add the below code to do that. if(pivotIndexCounter==i) { pivotIndexCounter++; continue; }

[@jeffreyadams1234]

Great content

[@tioluwani6928]

Thank you 🙏

[@svalyavasvalyava9867]

Thank you!

[@geekific]

My pleasure :)

[@Real_Dk]

Excellent

[@geekific]

Glad you liked it :)

[@MineCrafterCity]

I think this is isn't fully correct. You need to have a pivot and a "i" and "j" and you compare those with the pivot.

[@geekific]

Half of the video was dedicated to implement the method that plays around with the pivot. Check again!

[@jeffreyadams1234]

Excellent

[@geekific]

Thank you! Cheers!