I was wondering if anyone knew of a way to measure the effiency of code other than Big-O.

I remember hearing that there were other ways, but I can't remember any of them.

You can actually time the code(empirical analysis) and another is where you basically count up operations. Also within asymptopic analysis you have big omega, little-omega, and little-o. These have well defined meanings and are basically sets of functions. So like if f(x) = x^2 we can say that
f = O(x^2), f = O(x^3), f = o(x^2), f = big omega(x^2), and f = little omega(x).

Learn assembly to get that extra little bit of efficiency out of your code.

assembler is for the mentaly insane and hardcore dudes, wish i knew there kung fu :)

I'm taking an assembler class at college. Starts in a couple weeks. Along with my object oriented c++ class.

I do know assembly or at least I'm supposed to know :)

Break out the Cormen!

Er, for the asymptotic analysis...not assembly. :P

I forgot one that Cormen uses theta notation. I've never got around to reading the entire book. It's like 1000 pages or something. I've also got to get around to watching all of these videos. http://18.89.1.101/sma/5503fall2001/index5503fall2001.html

Well, it's not exactly bedtime reading... :) But I believe they only discuss asymptotic complexity itself for the first chapter or two. Of course, only using the book for this discussion is a lot like buying a car for the radio. :)

Yes

there are other ways of measuring code efficiency also like Omega , Theta etc., u can find the details in DataStructures using C++ of Sartaj Sahni.

U can have a complte descrition in thatBye