Functional Problem Solving (CSC 151 2014F) : Outlines
Primary: [Front Door] [Schedule] - [Academic Honesty] [Disabilities] [Email] - [FAQ] [Teaching & Learning] [Grading] [Rubric] - [Calendar]
Current: [Assignment] [EBoard] [Lab] [Outline] [Reading]
Sections: [Assignments] [EBoards] [Examples] [Handouts] [Labs] [Outlines] [Readings]
Reference: [Setup] [VM] [Errors] - [Functions A-Z] [Functions By Topic] - [Racket] [Scheme Report (R5RS)] [R6RS] [TSPL4]
Related Courses: [Davis (2013F)] [Rebelsky (2014S)] [Weinman (2014F)]
Misc: [Submit Questions] - [SamR] [Glimmer Labs] [CS@Grinnell] [Grinnell] - [Issue Tracker (Course)]
Held: Tuesday, 25 November 2014
Back to Outline 46 - Binary Search. On to Outline 48 - An Introduction to Sorting.
Summary
We continue our explorations of binary search, grounding our explorations in practice.
Related Pages
Overview
Administrivia
Suppose we have data for various students on campus: Last Name (string), First Name (string), Graduation Year (integer), Box Number (integer), and Phone number (string). We might search by any of the four criteria (and by other criteria) and we might therefore order in various ways.
(define people
(vector
("Aanderson" "Aan" 2017 4114 "x4410")
("Brown" "Bruin" 2016 8123 "x9000")
("Doe" "J" 2018 9999 "none")
("Smith" "Kieran" 2015 4112 "x9231")
("Taylor" "Mic" 2017 1234 "x0001")))