I *heart* geeks

[pixiecrinkle]

In my programming class, we are currently learning about algorithm efficiency, which is written via "Big-O notation." This is an actual quote from my class's chat room:

Is the Week 12 Powerpoint supposed to be all of the material needed to cover this topic? The Horton text mentions nothing about "Big O". When I did an internet search on "Big O" there was some interesting information, but not much that related to sort algorithms.

Ahem. Not even a smiley.

Comments

[automat76.livejournal.com]

you could recommend some reading material: the missing piece meets the big o (http://www.amazon.com/exec/obidos/tg/detail/-/0060256575/qid=1070343276//ref=sr_8_xs_ap_i13_xgl14/103-2470053-5686258?v=glance&s=books&n=507846) :-)