SORTING ALGORITHMS

D. Thiebaut, -- Smith College

A short introduction

1. Graphical representation of the sorted part of the array.
2. Graphical representation of the unsorted part of the array.
3. Shows the number of comparisons, performed by the sorting algorithm.
4. Shows the number of swaps, performed by the sorting algorithm.

1. Graphical representation of the sorted part of the array.
2. Graphical representation of the unsorted part of the array.
3. Shows the number of comparisons, performed by the sorting algorithm.
4. Shows the code listing of the performed sorting algorithm.

Instead of the square, representing the number of swaps, you can choose the option seeing the code listing of the algoritm, while it is running.

Copyright (c) 1997 Biliana Kaneva, Dominique Thiébaut
Smith College

Display Pagerank