Quicksort algorithm again revisited.

Knessl, Charles; Szpankowski, Wojciech

Discrete Mathematics and Theoretical Computer Science. DMTCS [electronic only] (1999)

  • Volume: 3, Issue: 2, page 43-64
  • ISSN: 1365-8050

How to cite

top

Knessl, Charles, and Szpankowski, Wojciech. "Quicksort algorithm again revisited.." Discrete Mathematics and Theoretical Computer Science. DMTCS [electronic only] 3.2 (1999): 43-64. <http://eudml.org/doc/120586>.

@article{Knessl1999,
author = {Knessl, Charles, Szpankowski, Wojciech},
journal = {Discrete Mathematics and Theoretical Computer Science. DMTCS [electronic only]},
keywords = {algorithms; analysis of algorithms; asymptotic analysis; binary search tree; sorting},
language = {eng},
number = {2},
pages = {43-64},
publisher = {Maison de l'Informatique et des Mathématiques Discrètes, MIMD},
title = {Quicksort algorithm again revisited.},
url = {http://eudml.org/doc/120586},
volume = {3},
year = {1999},
}

TY - JOUR
AU - Knessl, Charles
AU - Szpankowski, Wojciech
TI - Quicksort algorithm again revisited.
JO - Discrete Mathematics and Theoretical Computer Science. DMTCS [electronic only]
PY - 1999
PB - Maison de l'Informatique et des Mathématiques Discrètes, MIMD
VL - 3
IS - 2
SP - 43
EP - 64
LA - eng
KW - algorithms; analysis of algorithms; asymptotic analysis; binary search tree; sorting
UR - http://eudml.org/doc/120586
ER -

NotesEmbed ?

top

You must be logged in to post comments.

To embed these notes on your page include the following JavaScript code on your page where you want the notes to appear.

Only the controls for the widget will be shown in your chosen language. Notes will be shown in their authored language.

Tells the widget how many notes to show per page. You can cycle through additional notes using the next and previous controls.

    
                

Note: Best practice suggests putting the JavaScript code just before the closing </body> tag.