[Current] [News] [Glance] [Discussions] [Instructions] [Search] [Links] [Handouts] [Outlines] [Readings] [Labs] [Homeworks] [Quizzes] [Exams] [Examples] [Fall2000.01] [Spring2000]
Back to Sorting Lab. On to Merge Sort Lab.
Held Tuesday, November 21, 2000
Summary
Today we revisit the question of sorting by considering some sorting algorithms that are typically more efficient than insertion sort. These algorithms depend on the divide and conquer strategy that we used so successfully in binary search.
Notes
Overview
call-with-values
,
but that seems somewhat extreme.
(define dac-sort (lambda (lst) (letrec ((divide ...) (join ...)) (let* ((divided (divide lst)) (first (car divided)) (second (cdr divided))) (join (dac-sort first) (dac-sort second))))))
Thursday, 24 August 2000
Tuesday, 21 November 2000
Back to Sorting Lab. On to Merge Sort Lab.
[Current] [News] [Glance] [Discussions] [Instructions] [Search] [Links] [Handouts] [Outlines] [Readings] [Labs] [Homeworks] [Quizzes] [Exams] [Examples] [Fall2000.01] [Spring2000]
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.cs.grinnell.edu/~rebelsky/Courses/CS151/2000F/Outlines/outline.47.html
Source text last modified Tue Nov 21 08:48:18 2000.
This page generated on Tue Nov 21 08:58:02 2000 by Siteweaver. Validate this page's HTML.
Contact our webmaster at rebelsky@grinnell.edu