The Gateway to Computer Science Excellence
0 votes
39 views
QUICKSORT(A,p,r)
1    if p < r
2    q = PARTITION(A,p,r)
3    QUICKSORT(A, p , q-1)
4    QUICKSORT(A, q + 1, r)

How would you modify QUICKSORT to sort into nonincreasing order?

in Algorithms by | 39 views

1 Answer

0 votes

If you observe PARTITION of the array algorithm carefully then you'll observe at line 4 i.e. in 

$if   A[j]\leq x$

simply the change it to $\leqslant$ which is

$if A[j]\geqslant x$

this will make all the elements greater than pivot move to the left of the array and rest to the right which is the desired result.

by

Related questions

Quick search syntax
tags tag:apple
author user:martin
title title:apple
content content:apple
exclude -tag:apple
force match +apple
views views:100
score score:10
answers answers:2
is accepted isaccepted:true
is closed isclosed:true
52,345 questions
60,483 answers
201,810 comments
95,288 users