Quicksort
El quicksort a l'è 'n algoritm de ordenament assee efficient desviluppaa in del 1959 del Tony Hoare e se ben implementaa el pò vess dò o trii voeult pussee svelt de l'heap sort e del merge sort.
L'è consideraa 'n algoritm divide et impera degià che 'l scerniss on "pivot" e ja ordena a segonda che sien pussee grand o piscininn.
Bibliografia
- Sedgewick, R. (1978). "Implementing Quicksort programs". Comm. ACM. 21 (10): 847–857. doi:10.1145/359619.359631.
Vos corelaa
- Introsort
This article uses material from the Wikipedia Lumbaart article Quicksort, which is released under the Creative Commons Attribution-ShareAlike 3.0 license ("CC BY-SA 3.0"); additional terms may apply (view authors). El contegnud a l'è disponibil sota la licenza CC BY-SA 4.0, se l'è minga indicad diversament. Images, videos and audio are available under their respective licenses.
®Wikipedia is a registered trademark of the Wiki Foundation, Inc. Wiki Lumbaart (DUHOCTRUNGQUOC.VN) is an independent company and has no affiliation with Wiki Foundation.