Definitions

from Wiktionary, Creative Commons Attribution/Share-Alike License.

  • noun computing A sorting algorithm that operates by recursively partitioning the items to be sorted into two sets.
  • verb transitive, computing To sort with such an algorithm.

Etymologies

from Wiktionary, Creative Commons Attribution/Share-Alike License

Quick +‎ sort, from its computational efficiency.

Support

Help support Wordnik (and make this page ad-free) by adopting the word quicksort.

Examples

  • Recall from Section 8.2 that the simple O (n2) methods are better than the O (n log n) methods such as quicksort for small n.

    Recently Uploaded Slideshows 2009

  • What I love is that shell sort beats quicksort every time, and its easy, and nobody can tell you precisely how it works.

    Snell-Pym » Efficient Software 2007

  • It doesn't always beat quicksort, but its consistent.

    Snell-Pym » Efficient Software 2007

  • If you write your bubble sort algorithm in assembly, and I write my merge-sort/quicksort in Ada or insert whatever language you think sucks the most, mine will beat yours with a large enough problem set.

    A Java parable 2006

  • You would like to sort it efficiently, looking for a solution you found the quicksort algorithm on Wikipedia you could use the List.sort function, the purpose is to teach you how to think functionally:

    Site Home DorianCorompt 2012

  • They're not really asking for somebody who can invent a new algorithm better than quicksort or even bridge C++ to Ada to PL/SQL to PHP or implement a perfect Strategy pattern using techniques borrowed from OCaml … they're asking for a PHP web developer who can configure, theme, and write some custom modules for Drupal that might work with some outside systems that others seem to be responsible for.

    Technosailor.com sandysmith 2010

  • The concept of the quicksort algorithm used in programming, is to divide an conquer.

    EzineArticles 2010

  • Here is when the quicksort algorithm could become handy.

    EzineArticles 2010

  • If it had showed quicksort (I can't understand why it didn't) then you'd have seen some intermediate structure there too. then your profs are kinda dumb, there are plenty of times when its acceptable to use bubble sort ....

    Slashdot: Developers 2010

  • They're not really asking for somebody who can invent a new algorithm better than quicksort or even bridge C++ to Ada to PL/SQL to PHP or implement a perfect Strategy pattern using techniques borrowed from OCaml … they're asking for a PHP web developer who can configure, theme, and write some custom modules for Drupal that might work with some outside systems that others seem to be responsible for.

    Technosailor.com sandysmith 2010

Comments

Log in or sign up to get involved in the conversation. It's quick and easy.