aparler/RosettaCodeData
1
0
Fork 0
Code Issues 12 Pull requests 3 Projects Releases Packages Wiki Activity Actions

Just another update

Browse source
This commit is contained in:
Ingy döt Net 2015-02-20 00:35:01 -05:00
parent a25938f123
commit 00a190b0a6
6591 changed files with 94363 additions and 23227 deletions
Download patch file Download diff file Expand all files Collapse all files

3
Task/Sorting-algorithms-Quicksort/00DESCRIPTION
View file

@ -1,7 +1,8 @@
{{Sorting Algorithm}}[[Category:Recursion]]
{{wikipedia|Quicksort}}
The task is to sort an array (or list) elements using the ''quicksort'' algorithm. The elements must have a strict weak order and the index of the array can be of any discrete type. For languages where this is not possible, sort an array of integers.
The task is to sort an array (or list) elements using the ''quicksort'' algorithm.
The elements must have a strict weak order and the index of the array can be of any discrete type. For languages where this is not possible, sort an array of integers.
Quicksort, also known as ''partition-exchange sort'', uses these steps.