Skip to content

Instantly share code, notes, and snippets.

@naohaq

naohaq/quicksort.txt

Last active December 12, 2015 03:09
Show Gist options
  • Save naohaq/4704919 to your computer and use it in GitHub Desktop.
Save naohaq/4704919 to your computer and use it in GitHub Desktop.
Download ZIP
Raw
quicksort.txt
procedure quicksort(A,M,N); value M,N;
array A; integer M,N;
begin integer I,J;
if M < N then begin partition(A,M,N,I,J);
quicksort(A,M,J);
quicksort(A,I,N);
end
end quicksort
@naohaq
Copy link
Author

naohaq commented Feb 4, 2013

from Algorithm 64: Quicksort http://dl.acm.org/citation.cfm?doid=366622.366644

Sign up for free to join this conversation on GitHub. Already have an account? Sign in to comment