Fundamentals of Computer Science II (CSC-152 99F)


Class 25: Sorting Algorithms

Back to Binary Search. On to More Efficient Sorting Algorithms.

Held Thursday, October 7, 1999

Overview

Today, we'll visit the issue of sorting: turning a collection of elements into a collection in which smaller elements precede larger elements. Our focus will primarily be on sorting arrays.

Notes

Contents

Handouts

Summary


An Introduction to Sorting

Examples

A Sortable Class

Common Sorting Algorithms

Iterative Selection Sort

Bubble Sort

Insertion Sort

Choosing a Sorting Method


History

Tuesday, 10 August 1999

Tuesday, 5 October 1999

Back to Binary Search. On to More Efficient Sorting Algorithms.


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 http://www.math.grin.edu/~rebelsky/Courses/CS152/99F/Outlines/outline.25.html

Source text last modified Tue Oct 5 16:46:55 1999.

This page generated on Tue Oct 5 16:47:23 1999 by Siteweaver. Validate this page's HTML.

Contact our webmaster at rebelsky@grinnell.edu