BIG OH specifies only an asymptotic upper bound, while BIG THETA species both the asymptotic upper and lower bound. It's usually more useful and easier to only worry about the worst case, and say that its run time or whatever is BIG OH of something. There may be certain classes of inputs for which the algorithm will have a smaller asymptotic run time, so in these cases, you wont be able to specify BIG THETA for general input.
>>3
I dont't expect the SICP crew who work CSR jobs to understand when I say "The first thing that comes to my mind is when I'm a sorting algorithm. Big Oh and Big Theta come into play if I would change the list from an array, to say, a linked list."
Big Theta is harder to calculate and speaking of spacial needs actually Big Oh is much more important.
Regardless, I usually optimize the Big Thetas and find a hybrid way of lowering Big Ohs
>>4,5
First I thought it was some kind of joke. I thought it was irony, something along the lines of ``Bonzi_buddy_programmer'' or ``Myspace_programmer''. But you're proud of that Bangalore Enterprise Level shite. Aren't you?