Fundamentals of Computer Science I (CSC-151.02 2000F)

Class 45: Introduction to Sorting

Back to Searching, continued. On to Merge Sort.

Held Friday, November 17, 2000


Today we move on to algorithm design for a very common problem, that of sorting. When you sort an array or vector, you put the elements in order (e.g., alphabetical, numerical, ...).



The Problem of Sorting

Sorting Examples

Formal Description

Insertion Sort

Bubble Sort

Bubble Sort


Thursday, 24 August 2000

Back to Searching, continued. On to Merge Sort.

Disclaimer Often, these pages were created "on the fly" with little, if any, proofreading. Any or all of the information on the pages may be incorrect. Please contact me if you notice errors.

This page may be found at

Source text last modified Fri Nov 17 10:58:12 2000.

This page generated on Fri Nov 17 20:45:12 2000 by Siteweaver. Validate this page's HTML.

Contact our webmaster at