Tek-Tips is the largest IT community on the Internet today!
Members share and learn making Tek-Tips Forums the best source of peer-reviewed technical information on the Internet!
-
Congratulations strongm on being selected by the Tek-Tips community for having the most helpful posts in the forums last week. Way to Go!
-
Quicksort Algorithm
Maybe I am in the wrong forum. I am new to tek-tips, could anyone point me in the right direction?- WildRyan
- Post #2
- Forum: Object-Oriented Analysis & Design
-
Quicksort Algorithm
If I understand this algorithm correctly it will sort an array (A) with p being a pointer to the first element, and r being a pointer to the last element in descending order. 1.Quicksort(A,p,r) 2. if p < r then 3. q = Partition(A,p,r) 4. Quicksort(A,p,q) 5. Quicksort(A,q+1,r)...- WildRyan
- Thread
- Replies: 3
- Forum: Object-Oriented Analysis & Design
