Joined
Last Seen
-1 Reputation Points
- Strength to Increase Rep
- +0
- Strength to Decrease Rep
- -0
0% Quality Score
- Upvotes Received
- 0
- Posts with Upvotes
- 0
- Upvoting Members
- 0
- Downvotes Received
- 1
- Posts with Downvotes
- 1
- Downvoting Members
- 1
0 Endorsements
Ranked #72.7K
~253 People Reached
Favorite Forums
Computer Science
x
2
Re:
Below is a QuickSort Serial Algorithm..... 1. procedure QUICKSORT(A,q,r) 2. begin 3. if q < r then 4. begin 5. x := A[q]; 6. s := q; 7. for i := q+1 to r do 8. if A[i] <= x then 9. begin 10. s :=s+1; 11. swap(A[s],A[i]); 12. end … |