Text books, including books for general audiences, invariably mention bubble sort in discussions of elementary sorting algorithms. We trace the history of bubble sort, its popularity, and its endurance in the face of pedagogical assertions that code and algorithmic examples used in early courses should be of high quality and adhere to established best practices. This paper is more an historical analysis than a philosophical treatise for the exclusion of bubble sort from books and courses. However, sentiments for exclusion are supported by Knuth 17, "In short, the bubble sort seems to have nothing to recommend it, except a catchy name and the fact that it leads to some interesting theoretical problems." Although bubble sort may not be a best practice sort, perhaps the weight of history is more than enough to compensate and provide for its longevity.
%0 Journal Article
%1 611918
%A Astrachan, Owen
%C New York, NY, USA
%D 2003
%I ACM
%J SIGCSE Bull.
%K 2013 bubble kde seminar sort
%N 1
%P 1--5
%R 10.1145/792548.611918
%T Bubble sort: an archaeological algorithmic analysis
%U http://portal.acm.org/citation.cfm?id=611918
%V 35
%X Text books, including books for general audiences, invariably mention bubble sort in discussions of elementary sorting algorithms. We trace the history of bubble sort, its popularity, and its endurance in the face of pedagogical assertions that code and algorithmic examples used in early courses should be of high quality and adhere to established best practices. This paper is more an historical analysis than a philosophical treatise for the exclusion of bubble sort from books and courses. However, sentiments for exclusion are supported by Knuth 17, "In short, the bubble sort seems to have nothing to recommend it, except a catchy name and the fact that it leads to some interesting theoretical problems." Although bubble sort may not be a best practice sort, perhaps the weight of history is more than enough to compensate and provide for its longevity.
@article{611918,
abstract = {Text books, including books for general audiences, invariably mention bubble sort in discussions of elementary sorting algorithms. We trace the history of bubble sort, its popularity, and its endurance in the face of pedagogical assertions that code and algorithmic examples used in early courses should be of high quality and adhere to established best practices. This paper is more an historical analysis than a philosophical treatise for the exclusion of bubble sort from books and courses. However, sentiments for exclusion are supported by Knuth [17], "In short, the bubble sort seems to have nothing to recommend it, except a catchy name and the fact that it leads to some interesting theoretical problems." Although bubble sort may not be a best practice sort, perhaps the weight of history is more than enough to compensate and provide for its longevity.},
added-at = {2013-05-28T17:46:25.000+0200},
address = {New York, NY, USA},
author = {Astrachan, Owen},
biburl = {https://www.bibsonomy.org/bibtex/268e8985978a6c6abd57b7bbef5740d59/jpba},
description = {Bubble sort},
doi = {10.1145/792548.611918},
interhash = {a7b4dd529c860c4c616849b8438862f8},
intrahash = {68e8985978a6c6abd57b7bbef5740d59},
issn = {0097-8418},
journal = {SIGCSE Bull.},
keywords = {2013 bubble kde seminar sort},
number = 1,
pages = {1--5},
publisher = {ACM},
timestamp = {2013-05-28T17:46:25.000+0200},
title = {Bubble sort: an archaeological algorithmic analysis},
url = {http://portal.acm.org/citation.cfm?id=611918},
volume = 35,
year = 2003
}