Bubble sort: An archaeological algorithmic analysis

SIGCSE Bulletin (Association for Computing Machinery, Special Interest Group on Computer Science Education)

Volumn , Issue , 2003, Pages 1-5

  Astrachan, Owen ^a  

^a Duke University   (United States)

Author keywords

Analysis; Bubble sort; Performance

Indexed keywords

COMPUTATIONAL COMPLEXITY; COMPUTER SCIENCE; CURRICULA; ENGINEERING EDUCATION; PERFORMANCE; SORTING; STUDENTS;

BUBBLE SORT; HISTORICAL ANALYSIS;

ALGORITHMS;

EID: 0038688015     PISSN: 00978418     EISSN: None     Source Type: Conference Proceeding    
DOI: None     Document Type: Conference Paper

References (25)

1. The jargon file. http://www.jargon.net/jargonfile/b/bogo-sort.html.
2. Aho, A. V., Hopcroft, J. E., and Ullman, J. D. The Design and Analysis of Computer Algorithms. Addison-Wesley, 1974.
3. Bell, D. The principles of sorting. The Computer Journal 1 (1958), 71-77.
4. Bose, R. C., and Nelson, R. J. A sorting problem. Journal of the ACM (JACM) 9, 2 (1962), 282-296.
5. Cooper, D. Oh My! Modula-2! W.W. Norton, 1990.
6. Dale, N., and Lewis, J. Computer Science Illuminated. Jones and Bartlett, 2002.
7. Demuth, H. Electronic Data Sorting. PhD thesis, Stanford University, 1956.
8. Demuth, H. personal communication. 2000.
9. Flores, I. Analysis of internal computer sorting. Journal of the ACM (JACM) 8, 1.
10. Friend, E. Sorting on electronic computer systems. J. ACM 3 (1956), 134-168.
11. Gotlieb, C. Sorting on computers. Communications of the ACM 6, 5 (May 1963), 194-201.
12. Halstead, M. H. Elements of Software Science, Operating, and Programming Systems Series, vol. 7, Elsevier, 1977.
13. Iverson, K. A Programming Language. John Wiley, 1962.
14. Juelich, O. Remark on algorithm 175 shuttle sort. Communications of the ACM 6, 12 (December 1963), 739.
15. Kernighan, B. W., and Plauger, P. Software Tools. Addison-Wesley, 1976.
16. Klerlein, J. B., and Fullbright, C. A transition from bubble sort to shell sort. In The Papers of the Nineteenth Technical Symposium on Computer Science Education (February 1988), ACM Press, pp. 183-184. SIGCSE Bulletin V. 20 N. 1.
17. Knuth, D. The Art of Computer Programming: Sorting and Searching, 2 ed., vol. 3. Addison-Wesley, 1998.
18. Knuth, D. E. The dangers of computer science theory. Logic, Methodology and Philosophy of Science 4 (1973). Also in Selected Papers on Analysis of Algorithms, CLSI, 2000.
19. Ledley, R. Programming and Utilizing Digital Computers. McGraw-Hill, 1962.
20. Martin, W. A. Sorting. ACM Computing Surveys 3, 4 (1971), 147-174.
21. McCracken, D., Weiss, H., and Lee, T. Programming Business Computers. John Wiley, 1959.
22. Organick, E. I. A Fortran Primer. Addison-Wesley, 1963.
23. Press, W. H., Flannery, B. P., Teukolsky, S. A., and Vetterling, W. T. Numerical Recipes in C: The Art of Scientific Computing. Cambridge University Press, 1988.
24. Sedgewick, R. Algorithms in C++, 3 ed. Addison-Wesley, 1998.
25. Shaw, C., and Trimble, T. Algorithm 175: Shuttle sort. Communications of the ACM 6, 6 (June 1963), 312-313.