1. Advanced Data Structure using C++

LECTURE NOTES OF ADVANCED DATA STRUCTURE (MT-CSE 110)
Algorithm for Quick Sort
Quik_Sort(a,l,h)
Where a = represents list of elements.
l = represents the position of the first element in the list
h = represents the position of the last element in the list
1. [Initially]
low =l
high =h
key = a[(l + h)/2] [Middle element of the list]
2. Repeat through step 7 while (low