(Untitled)

[spacehamster3d]

I feel like updating, but I don't feel like writing anything.

So I copied Purple's survey.

1. Grab the book nearest to you, turn to page 18, find line 4. Write down what it says: "Show that the n/k sublists, each of length k, can be sorted by insertion sort in Θ(nk) worst-case time."
2. Stretch your left arm out as far as you can. What do you touch

Comments

[dapperdanman]

man I'm like uber popular today or something. you're the second person to copy my silly survey. haha.