An Algorithmic and Social Introduction to Computer Science (CSC-105 2000S)


Class 11: Sorting

Back to Searching. On to Sorting, Revisited.

Held Wednesday, February 9, 2000

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.

Question 11 for today's class: Describe how to put a pile of books in alphabetical order by author.

Question 12 for Friday's class: Computer programmers often emphasize efficiency as the primary criterion for evaluating algorithms. What effects do you think this emphasis has?

Notes

Contents

Summary


An Introduction to Sorting

Examples

Common Sorting Algorithms

Bubble Sort

Insertion Sort

Choosing a Sorting Method


History

Saturday, 22 January 2000

Wednesday, 9 February 2000

Back to Searching. On to Sorting, Revisited.


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/CS105/2000S/Outlines/outline.11.html

Source text last modified Wed Feb 9 09:20:03 2000.

This page generated on Wed Feb 9 09:22:01 2000 by Siteweaver. Validate this page's HTML.

Contact our webmaster at rebelsky@grinnell.edu