Numerical recipes in C: the art of scientific computing
Numerical recipes in C: the art of scientific computing
A transition from bubble to shell sort
SIGCSE '88 Proceedings of the nineteenth SIGCSE technical symposium on Computer science education
Average-case analysis of algorithms and data structures
Handbook of theoretical computer science (vol. A)
Algorithms in C++
The art of computer programming, volume 3: (2nd ed.) sorting and searching
The art of computer programming, volume 3: (2nd ed.) sorting and searching
Sorting on Electronic Computer Systems
Journal of the ACM (JACM)
Analysis of Internal Computer Sorting
Journal of the ACM (JACM)
Journal of the ACM (JACM)
ACM Computing Surveys (CSUR)
Remark on algorithm 175: Shuttle sort
Communications of the ACM
Communications of the ACM
Communications of the ACM
Elements of Software Science (Operating and programming systems series)
Elements of Software Science (Operating and programming systems series)
Computer Science Illuminated
Discrete Mathematics in Computer Science
Discrete Mathematics in Computer Science
Software Tools
The Design and Analysis of Computer Algorithms
The Design and Analysis of Computer Algorithms
A FORTRAN primer (Addison-Wesley series in computer science and information processing)
A FORTRAN primer (Addison-Wesley series in computer science and information processing)
A programming language
Gene Sorting in Differential Evolution
ISNN 2009 Proceedings of the 6th International Symposium on Neural Networks: Advances in Neural Networks - Part III
Simulation and Gaming
Techniques for visualizing data structures in algorithmic animations
Information Visualization
Sorting algorithms as special cases of a priority queue sort
Proceedings of the 42nd ACM technical symposium on Computer science education
The introduction of computer science to NZ high schools: an analysis of student work
Proceedings of the 7th Workshop in Primary and Secondary Computing Education
Hi-index | 0.00 |
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.