Definitions for quicksort
quick·sort

WiktionaryRate this definition:0.0 / 0 votes

1. quicksortnoun

   A sorting algorithm that operates by recursively partitioning the items to be sorted into two sets.

2. quicksortverb

   To sort with such an algorithm.

3. Etymology: quick sort, from its computational efficiency.

WikipediaRate this definition:0.0 / 0 votes

1. Quicksort

   Quicksort is an efficient, general-purpose sorting algorithm. Quicksort was developed by British computer scientist Tony Hoare in 1959 and published in 1961, it is still a commonly used algorithm for sorting. Overall, it is slightly faster than merge sort and heapsort for randomized data, particularly on larger distributions.Quicksort is a divide-and-conquer algorithm. It works by selecting a 'pivot' element from the array and partitioning the other elements into two sub-arrays, according to whether they are less than or greater than the pivot. For this reason, it is sometimes called partition-exchange sort. The sub-arrays are then sorted recursively. This can be done in-place, requiring small additional amounts of memory to perform the sorting. Quicksort is a comparison sort, meaning that it can sort items of any type for which a "less-than" relation (formally, a total order) is defined. Most implementations of quicksort are not stable, meaning that the relative order of equal sort items is not preserved. Mathematical analysis of quicksort shows that, on average, the algorithm takes O ( n log ⁡ n ) {\displaystyle O(n\log {n})} comparisons to sort n items. In the worst case, it makes O ( n 2 ) {\displaystyle O(n^{2})} comparisons.

WikidataRate this definition:0.0 / 0 votes

1. Quicksort

   Quicksort, or partition-exchange sort, is a sorting algorithm developed by Tony Hoare that, on average, makes O comparisons to sort n items. In the worst case, it makes O comparisons, though this behavior is rare. Quicksort is often faster in practice than other O algorithms. Additionally, quicksort's sequential and localized memory references work well with a cache. Quicksort is a comparison sort and, in efficient implementations, is not a stable sort. Quicksort can be implemented with an in-place partitioning algorithm, so the entire sort can be done with only O additional space used by the stack during the recursion.

How to pronounce quicksort?

1. Alex

   US English

   David

   US English

   Mark

   US English

   Daniel

   British

   Libby

   British

   Mia

   British

   Karen

   Australian

   Hayley

   Australian

   Natasha

   Australian

   Veena

   Indian

   Priya

   Indian

   Neerja

   Indian

   Zira

   US English

   Oliver

   British

   Wendy

   British

   Fred

   US English

   Tessa

   South African

How to say quicksort in sign language?

Numerology

1. Chaldean Numerology

   The numerical value of quicksort in Chaldean Numerology is: 2

2. Pythagorean Numerology

   The numerical value of quicksort in Pythagorean Numerology is: 7

Popularity rank by frequency of use

References

1. ^ Wiktionary
   https://en.wiktionary.org/wiki/Quicksort
2. ^ Wikipedia
   https://en.wikipedia.org/wiki/Quicksort
3. ^ Wikidata
   https://www.wikidata.org/w/index.php?search=quicksort