An analysis of selection sort using recurrence relations.

Francesc J. Ferri; Jesús Albert

Qüestiió (1996)

  • Volume: 20, Issue: 1, page 111-119
  • ISSN: 0210-8054

Abstract

top
This paper presents a method for obtaining the expected number of data movements executed by the well-known Selection sort algorithm along with its corresponding variance. The approach presented here requires hardly any specific mathematical background. In particular, the average-case cost and variance are represented using recurrence relations whose solutions lead to the desired results. Even though this method is not applicable in general, it serves to conveniently present average-case algorithm analysis in depth in an elementary course on Algorithms.

How to cite

top

Ferri, Francesc J., and Albert, Jesús. "An analysis of selection sort using recurrence relations.." Qüestiió 20.1 (1996): 111-119. <http://eudml.org/doc/40218>.

@article{Ferri1996,
abstract = {This paper presents a method for obtaining the expected number of data movements executed by the well-known Selection sort algorithm along with its corresponding variance. The approach presented here requires hardly any specific mathematical background. In particular, the average-case cost and variance are represented using recurrence relations whose solutions lead to the desired results. Even though this method is not applicable in general, it serves to conveniently present average-case algorithm analysis in depth in an elementary course on Algorithms.},
author = {Ferri, Francesc J., Albert, Jesús},
journal = {Qüestiió},
keywords = {Algoritmos de clasificación; Algoritmos de ordenador; Cálculo por ordenador; Logical-software},
language = {eng},
number = {1},
pages = {111-119},
title = {An analysis of selection sort using recurrence relations.},
url = {http://eudml.org/doc/40218},
volume = {20},
year = {1996},
}

TY - JOUR
AU - Ferri, Francesc J.
AU - Albert, Jesús
TI - An analysis of selection sort using recurrence relations.
JO - Qüestiió
PY - 1996
VL - 20
IS - 1
SP - 111
EP - 119
AB - This paper presents a method for obtaining the expected number of data movements executed by the well-known Selection sort algorithm along with its corresponding variance. The approach presented here requires hardly any specific mathematical background. In particular, the average-case cost and variance are represented using recurrence relations whose solutions lead to the desired results. Even though this method is not applicable in general, it serves to conveniently present average-case algorithm analysis in depth in an elementary course on Algorithms.
LA - eng
KW - Algoritmos de clasificación; Algoritmos de ordenador; Cálculo por ordenador; Logical-software
UR - http://eudml.org/doc/40218
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.