"O(n log n)" (big O of n log n)
lyrics by Benjamin Newman
ttto: "Blowin' in the Wind" by Bob Dylan

(no capo)

/: D G D (Bm) / (D) G A - :/

How many times must two strings be compared
To sort alphabetically?
And how long does it take to empty a heap
Or fill up a binary tree?
If you store every bit string between 1 and n
How many bits will that be?

	/ G A D Bm / G A D - /

	The answer, my friends, is O(n log n)
	The answer's O(n log n)