Held Friday, February 11, 2000
Today, we conclude our initial study of algorithms by investigating a final sorting algorithm typically known as Quicksort. We then consider some of the implications of the focus of many programmers and computer scientists on efficiency.
Question 12 for today's class: Computer programmers often emphasize efficiency as the primary criterion for evaluating algorithms. What effects do you think this emphasis has?
Question 13 for Monday's class: What implication of computing do you most want to consider this semester? Why?
To sort a collection 1. Make two new piles, which we'll call small and large 2. Step through the collection a. Put small things in the small pile b. Put large things in the large pile 3. Sort each pile separately 4. Put them back together
Saturday, 22 January 2000
Friday, 11 February 2000
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.12.html
Source text last modified Fri Feb 11 09:23:16 2000.
This page generated on Fri Feb 11 09:22:41 2000 by Siteweaver. Validate this page's HTML.
Contact our webmaster at email@example.com