The CS 5 Times Penguin Rescue! Dunedin, New Zealand (Penguin Press): A daring mission has been mounted to rescue two adorable penguins who had been given up as lost after a spaceship crash. Risking her life with an untested experimental jet pack, a brave Chemistry penguin mixed a witches’ brew of propellant, fueled the pack, and set off across the sky in search of her missing colleagues, who were running out of fish when last heard from. “We are, like, so grateful for this, like, attempt, and, like, we, like, hope for her, like, success,” stated a jittery CS 5 student. “We like, love our, like, penguins and are, like, so helpless with our, like, homework assignments without, like, their, like, help.” Further quotes were unavailable due to an unexpected attack from a WRIT 1 instructor.
37
Embed
The CS 5 Timesjulie/cs5/f18/Lecture07Black.pdf · Cartoon courtesy of “Computers and Intractability: A Guide to the Theory of NP-Completeness” by M. Garey and D. Johnson “I
This document is posted to help you gain knowledge. Please leave a comment to let me know what you think about it! Share it to your friends and learn new things together.
Transcript
The CS 5 TimesPenguin Rescue!Dunedin, New Zealand (Penguin Press):
A daring mission has beenmounted to rescue two adorable penguinswho had been given up as lost after aspaceship crash. Risking her life with anuntested experimental jet pack, a brave Chemistry penguin mixed a witches’ brew of propellant, fueled the pack, and set off across the sky in search of her missing colleagues, who were running out of fish when last heard from.
“We are, like, so grateful for this, like, attempt, and, like, we, like, hope for her, like, success,” stated a jittery CS 5 student. “We like, love our, like, penguins and are, like, so helpless with our, like, homework assignments without, like, their, like, help.”
Further quotes were unavailable due to an unexpected attack from a WRIT 1 instructor.
Mergesort
msort([42, 3, 1, 5, 27, 8, 2, 7])
msort([42, 3, 1, 5]) msort([27, 8, 2, 7])
merge([1, 3, 5, 42], [2, 7, 8, 27])
[
Mergesort
msort([42, 3, 1, 5, 27, 8, 2, 7])
msort([42, 3, 1, 5]) msort([27, 8, 2, 7])
merge([1, 3, 5, 42], [2, 7, 8, 27])
[1,
✓
Mergesort
msort([42, 3, 1, 5, 27, 8, 2, 7])
msort([42, 3, 1, 5]) msort([27, 8, 2, 7])
merge([1, 3, 5, 42], [2, 7, 8, 27])
[1,2
✓ ✓
Mergesort
msort([42, 3, 1, 5, 27, 8, 2, 7])
msort([42, 3, 1, 5]) msort([27, 8, 2, 7])
merge([1, 3, 5, 42], [2, 7, 8, 27])
[1,2,3
✓ ✓✓
Mergesort
msort([42, 3, 1, 5, 27, 8, 2, 7])
msort([42, 3, 1, 5]) msort([27, 8, 2, 7])
merge([1, 3, 5, 42], [2, 7, 8, 27])
[1,2,3,5
✓ ✓✓ ✓
Mergesort
msort([42, 3, 1, 5, 27, 8, 2, 7])
msort([42, 3, 1, 5]) msort([27, 8, 2, 7])
merge([1, 3, 5, 42], [2, 7, 8, 27])
[1,2,3,5,7
✓ ✓✓ ✓ ✓
Mergesort
msort([42, 3, 1, 5, 27, 8, 2, 7])
msort([42, 3, 1, 5]) msort([27, 8, 2, 7])
merge([1, 3, 5, 42], [2, 7, 8, 27])
[1,2,3,5,7,8
✓ ✓✓ ✓ ✓ ✓
Mergesort
msort([42, 3, 1, 5, 27, 8, 2, 7])
msort([42, 3, 1, 5]) msort([27, 8, 2, 7])
merge([1, 3, 5, 42], [2, 7, 8, 27])
[1,2,3,5,7,8,27
✓ ✓✓ ✓ ✓ ✓ ✓
Mergesort
msort([42, 3, 1, 5, 27, 8, 2, 7])
msort([42, 3, 1, 5]) msort([27, 8, 2, 7])
merge([1, 3, 5, 42], [2, 7, 8, 27])
[1,2,3,5,7,8,27,42]
✓ ✓✓ ✓ ✓ ✓ ✓✓
Done!
Let’s try it out - and let’s not even make n a power of 2!