A transition from bubble to shell sort

Authors:
Joseph B. Klerlein;Curtis Fullbright
Affiliations:
Western Carolina Univ., Cullowhee, NC;Western Carolina Univ., Cullowhee, NC
Venue:
SIGCSE '88 Proceedings of the nineteenth SIGCSE technical symposium on Computer science education
Year:
1988

Citing 4
Cited 2

Using Modula-2: an introduction to computer science I

Using Modula-2: an introduction to computer science I
Introduction to Pascal and structured design

Introduction to Pascal and structured design
The art of computer programming, volume 3: (2nd ed.) sorting and searching

The art of computer programming, volume 3: (2nd ed.) sorting and searching
Data Structures and Algorithms

Data Structures and Algorithms

Bubble sort: an archaeological algorithmic analysis

SIGCSE '03 Proceedings of the 34th SIGCSE technical symposium on Computer science education
A new approach to bucket sort

SEPADS'08 Proceedings of the 7th WSEAS International Conference on Software Engineering, Parallel and Distributed Systems

Quantified Score

Hi-index	0.00

Visualization

Abstract

This paper describes a sorting method obtained by modifying bubble sort. This new sort, while still inefficient, sets the stage for Shell sort. It also raises some interesting questions which students can investigate.