Functional Problem Solving (CSC 151 2016S) : EBoards
Primary: [Front Door] [Schedule] - [Academic Honesty] [Disabilities] [Email] - [FAQ] [Teaching & Learning] [Grading] [Taking Notes] [Rubric]
Current: [Assignment] [EBoard] [Lab] [Outline] [Reading]
Sections: [Assignments] [EBoards] [Labs] [Outlines] [Readings] - [Examples] [Handouts]
Reference: [Setup] [Remote] [VM] [Errors] - [Functions A-Z] [Functions By Topic] - [Racket] [Scheme Report (R5RS)] [R6RS] [TSPL4]
Related Courses: [Curtsinger (2016S)] [Davis (2013F)] [Rebelsky (2015F)] [Weinman (2014F)]
Misc: [SamR] [Glimmer Labs] [CS@Grinnell] [Grinnell] - [Issue Tracker (Course)]
Overview
Can I take the final on Wednesday afternoon instead of Thurssday morning?
Yes.
How is merge sort like ATP/TF sort?
How is merge sort different from ATP/TF sort?
How do you put them back together?
Lab writeup: NONE
The experiment procedure is your friend.
Since it's so easy to merge in ATP/TF sort (that is, the "divide into small/large, sort, shove together" sort), why do we use merge sort instead?
Maybe dividing into small and large is difficult.
Finding the median usually involves sorting. Non-sorting mechanisms that the class came up with are slow.
Why do we have two versions of merge sort?