QUICK Sort Algorithm in C++ | OOP (C++) LECTURE – 29 |

Quick Sort Algorithm implemented in C++.
Sorting Algorithms.
Sorting Array.
Divide and Conquer.
Data Structure and Algorithm in C++.
Pivot selection.
This video lecture tells about a practice problem of quick sort in C++. The problem is to pass the address of an array, pass starting index of the array, and pass the ending index of the array in a function of the class. Store the address of the array in a pointer variable and then sort the array by using sorting algorithm quick sort recursively. Quick sort is an efficient sorting algorithm. It uses divide and conquer technique. It selects an element as a pivot and then divide the array into two halves according to the pivot. The smallest values are the left side of the pivot and the larger values are right side of the pivot. Selection of the pivot is depend upon your choice. First element may be a pivot, last element may be a pivot, and middle value of the array may be a pivot. The process is repeatedly performed until all the elements are divided into units (single elements). When all the elements are into a unit elements then combine (conquer) all the elements and the array is in sorted form. The quick sort algorithm is fast as compared to other sorting algorithms such as bubble sort, selection sort, and insertion sort. It consumes short memory as compared to merge sort.


#TutorZeeshanOnline #Cplusplus #QuickSort #ObjectOrientedProgramming #Sorting #divideandconquer #pivot #SortingAlgorithm #middleValue #singleElement #fastSortingAlgorithm #arrays #recursiveFunctions



 You can also join us on Facebook.
https://www.facebook.com/Tutor-Zeeshan-Online-108287117562788



Instagram:
https://www.instagram.com/tutor.zeeshan/