Tri rapide
en construction
Définition
XXXXXXXXX
Français
XXXXXXXXX
Anglais
Quicksort Algorithm
The Quicksort algorithm is a systematic routine for sorting elements of an array. It is efficient when compared to other common sorting algorithms, and it is considered unstable because the relative order of equal elements is not guaranteed. The name "Quicksort" refers to the fact that this algorithm is capable of sorting data much faster than any other traditionally used sorting algorithm.
Contributeurs: Isaline Hodecent, wiki
