mathworld.wolfram.com/Quicksort.html

Preview meta tags from the mathworld.wolfram.com website.

Linked Hostnames

6

Thumbnail

Search Engine Appearance

Google

https://mathworld.wolfram.com/Quicksort.html

Quicksort -- from Wolfram MathWorld

Quicksort is the fastest known comparison-based sorting algorithm (on average, and for a large number of elements), requiring O(nlgn) steps. Quicksort is a recursive algorithm which first partitions an array {a_i}_(i=1)^n according to several rules (Sedgewick 1978): 1. Some key nu is in its final position in the array (i.e., if it is the jth smallest, it is in position a_j). 2. All the elements to the left of a_j are less than or equal to a_j. The elements a_1, a_2, ..., a_(j-1) are called...



Bing

Quicksort -- from Wolfram MathWorld

https://mathworld.wolfram.com/Quicksort.html

Quicksort is the fastest known comparison-based sorting algorithm (on average, and for a large number of elements), requiring O(nlgn) steps. Quicksort is a recursive algorithm which first partitions an array {a_i}_(i=1)^n according to several rules (Sedgewick 1978): 1. Some key nu is in its final position in the array (i.e., if it is the jth smallest, it is in position a_j). 2. All the elements to the left of a_j are less than or equal to a_j. The elements a_1, a_2, ..., a_(j-1) are called...



DuckDuckGo

https://mathworld.wolfram.com/Quicksort.html

Quicksort -- from Wolfram MathWorld

Quicksort is the fastest known comparison-based sorting algorithm (on average, and for a large number of elements), requiring O(nlgn) steps. Quicksort is a recursive algorithm which first partitions an array {a_i}_(i=1)^n according to several rules (Sedgewick 1978): 1. Some key nu is in its final position in the array (i.e., if it is the jth smallest, it is in position a_j). 2. All the elements to the left of a_j are less than or equal to a_j. The elements a_1, a_2, ..., a_(j-1) are called...

  • General Meta Tags

    20
    • title
      Quicksort -- from Wolfram MathWorld
    • DC.Title
      Quicksort
    • DC.Creator
      Weisstein, Eric W.
    • DC.Description
      Quicksort is the fastest known comparison-based sorting algorithm (on average, and for a large number of elements), requiring O(nlgn) steps. Quicksort is a recursive algorithm which first partitions an array {a_i}_(i=1)^n according to several rules (Sedgewick 1978): 1. Some key nu is in its final position in the array (i.e., if it is the jth smallest, it is in position a_j). 2. All the elements to the left of a_j are less than or equal to a_j. The elements a_1, a_2, ..., a_(j-1) are called...
    • description
      Quicksort is the fastest known comparison-based sorting algorithm (on average, and for a large number of elements), requiring O(nlgn) steps. Quicksort is a recursive algorithm which first partitions an array {a_i}_(i=1)^n according to several rules (Sedgewick 1978): 1. Some key nu is in its final position in the array (i.e., if it is the jth smallest, it is in position a_j). 2. All the elements to the left of a_j are less than or equal to a_j. The elements a_1, a_2, ..., a_(j-1) are called...

  • Open Graph Meta Tags

    5
    • og:image
      https://mathworld.wolfram.com/images/socialmedia/share/ogimage_Quicksort.png
    • og:url
      https://mathworld.wolfram.com/Quicksort.html
    • og:type
      website
    • og:title
      Quicksort -- from Wolfram MathWorld
    • og:description
      Quicksort is the fastest known comparison-based sorting algorithm (on average, and for a large number of elements), requiring O(nlgn) steps. Quicksort is a recursive algorithm which first partitions an array {a_i}_(i=1)^n according to several rules (Sedgewick 1978): 1. Some key nu is in its final position in the array (i.e., if it is the jth smallest, it is in position a_j). 2. All the elements to the left of a_j are less than or equal to a_j. The elements a_1, a_2, ..., a_(j-1) are called...

  • Twitter Meta Tags

    5
    • twitter:card
      summary_large_image
    • twitter:site
      @WolframResearch
    • twitter:title
      Quicksort -- from Wolfram MathWorld
    • twitter:description
      Quicksort is the fastest known comparison-based sorting algorithm (on average, and for a large number of elements), requiring O(nlgn) steps. Quicksort is a recursive algorithm which first partitions an array {a_i}_(i=1)^n according to several rules (Sedgewick 1978): 1. Some key nu is in its final position in the array (i.e., if it is the jth smallest, it is in position a_j). 2. All the elements to the left of a_j are less than or equal to a_j. The elements a_1, a_2, ..., a_(j-1) are called...
    • twitter:image:src
      https://mathworld.wolfram.com/images/socialmedia/share/ogimage_Quicksort.png

  • Link Tags

    4
    • canonical
      https://mathworld.wolfram.com/Quicksort.html
    • preload
      //www.wolframcdn.com/fonts/source-sans-pro/1.0/global.css
    • stylesheet
      /css/styles.css
    • stylesheet
      /common/js/c2c/1.0/WolframC2CGui.css.en

Links

45