Random Recollections of CPS 100
(Set to the music of Bare Naked Ladies - One Week)

It's been one week since this program ran,
The recursive function's doing things that I haven't planned,
Clones, clones, a billion clones,
The program crashes, I'll just ask Astrachan.
It's the base case I've forgotten here,
An infinite recursion, one of my greatest fears,
The recursion should now come to a halt,
The program crashes anyway, it's a Seg Fault.

Want to sort a complex vector
Pointers to objects
Got to use the Comparer class
Then compile, make a file
Lots of problems take a while,
About to give up,
But the problem was a missing "const."

Two to the tenth's ten twenty-four
What is that for?
Running searches on a search tree.
B-searching makes the same sense,
Halve the elements,
But they have to be in order.

The Quadratics are Insertion Sort,
Selection Sort, and Bubble Sort,
I hate the latter;
It's the slowest of the methods.
Divide then sort,
You'll have MergeSort,
But faster still is still QuickSort
Takes n log n,
But Merging is more stable.

How do you know which data form to implement,
Which structure will be the most elegant,
Then there's always the problems of efficiency,
Don't understand what I mean,
Well, you'll soon see.
It can be a hash table or a search tree,
But in the end it comes down to "it depends."

It's been one week since I got some sleep
Got a Huff program due and now I'm angry,
Five days since I understood, wonderin'
What was wrong with my struct, but now that's all good.
It's been three days since my queue would run
Got the priority mixed up, but now that's all done.
Now got compression, but I don't know
What is held in the sequence of those one and those zeros.

A function for hashing, a type of mapping,
Insert with linear or quadratic probing,
Both of the methods are both sins,
You'll have collisions,
Hash with Chaining gives precision.
Use a vector with linked lists hanging off it,
N time searching it
But the vector is gigantic.

Virtual functions use inheritance,
Why's this done then?
It's good to use a commons interface.
Virtual functions can be virtually pure,
Equal to zero, only be sure,
That it's implemented in the sub class.
Gotta get in sync with RSG,
They will all be inheriting Grammer Elements,
Public of the super class.

How do you know which data form to implement,
Which structure will be the most elegant,
Then there's always the problems of efficiency,
Don't understand what I mean,
Well, you'll soon see.
It can be a hash table or a search tree,
But in the end it comes down to "it depends."

It is one week 'till this program's due.
I've been to every single class, but I have no clue.
Five days since I looked at it,
The concepts are strange, the ideas completely new.
Three days, I have three late days,
No wait, miscount, I actually only have two.
Yesterday I finally started it,
Cause there's still five days before this program's due.

It'll still be five days before this program's due.
It'll still be five days before this program's due.

At home in B101 in the LSRC.