mnemonic for Big-O notatin
 

i am cramming for AP CS AB right now...is there an easy way to remember Big-O notation for lists, arrays, trees, collections, and sorting mechanisms? Perhaps a mnemonic? i know some things, like doing anything in an unbalanced bst is always O(n)except searching can be O(n^2) if its totally unbalanced which makes sense intuitively anyway so i dont have to memorize 6that, and i know that balanced bst is always log(n) except its n for traversal...

Why are you trying to memorize this? If you learn the concept, shouldn't you be able to figure it out easily by looking at the algorithm?

well i think i did pretty well on AP CS AB, however i have this feeling that maybe i got owned and didnt realize it...idk i thought i actually knew most of the stuff there...but im not perfectly sure that i got a 5