Algorithms and OOD (CSC 207 2013F) : EBoards
It's almost time for prereg. Have you thought about what you're going to do next in CS?
As long as you're thinking about next semester, you might want to start thinking beyond next semester. What will you do this coming summer?
Any comments on iterative merge sort?
Professor Walker has been talking a lot about memory efficiency. You may find it useful to build one helper array (of size N) where you copy values before merging back into the main array. (The typical strategy is to copy the first half of the section to be merged into the helper array, and then you can merge back in place.)
_There's a bug in Sam's Quicksort
Thanks AK. I'll fix.
_Can you cut problems 5-8?
Copyright (c) 2013 Samuel A. Rebelsky.
This work is licensed under a Creative Commons Attribution 3.0 Unported License. To view a copy of this license, visit
or send a letter to Creative Commons, 543 Howard Street, 5th Floor,
San Francisco, California, 94105, USA.