Seite auf deutsch

Sorting algorithms

Sorting an array of items is one of the oldest and most important tasks that can be carried out with a computer. For this reason, the first sorting algorithms were devised very shortly after the advent of electronic computers.

In this tutorial, we present some of the most important sorting algorithms - with an interactive graphical display of each sorting routine:

• Bubble Sort
• Cocktail Shaker Sort (improved Bubble Sort)
• Merge Sort
• Quick Sort

For executing the animations, your browser needs to support Java 2, or newer.

Authors of this tutorial, and in particular of these applets: Hermann Gruber and Felix Wimmer