Sorting algorithms/Quicksort: Difference between revisions
Content added Content deleted
(add C, array of integers) |
No edit summary |
||
| Line 4: | Line 4: | ||
In this task, the goal is to sort an array of elements using the [http://en.wikipedia.org/wiki/Quicksort Quicksort] algorithm. The elements must have a total 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. |
In this task, the goal is to sort an array of elements using the [http://en.wikipedia.org/wiki/Quicksort Quicksort] algorithm. The elements must have a total 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. |
||
=={{header |
=={{header|C}}== |
||
void quick(int *left, int *right) |
void quick(int *left, int *right) |
||
{ |
{ |
||