Quick SortΒΆ
Global Algorithm - One-Dimensional Algorithm
Quick Sort algorithm is a comparison sort and has the complexity O(nlogn) on average. It is efficient but not stable.
Input Parameters
| Parameter | Type | Constraint | Description | Remarks |
|---|---|---|---|---|
| \(Y\) | \(Y \in \mathbb R^N\) | \(N \in \mathbb{N}\) |
Output Parameters
| Parameter | Type | Constraint | Description | Remarks |
|---|---|---|---|---|
| \(\hat{Y}\) | \(\hat{Y} \in \mathbb R^N\) | \(N \in \mathbb{N}\) | Sorted data sequence of length \(N\) | The output result is sensitive to improper values such as ‘nan’, ‘inf’, ‘null’, etc. |
Single Steps using the Algorithm
References
- C.A.R. Hoare, Quicksort, Computer Journal, vol. 5(1), pp. 10-15, 1962. (Reprinted in Hoare and Jones: Essays in computing science, 1989.)