In my Foundations of Computer Science class, we are learning about growth functions (big-oh, big-omega, and big-theta). Now I understand the concept of these three. However, I still have a few questions: 1- If a function grows faster past a certain point, does that make it better in programming because it grows faster, or does it just take up more space? 2- If I have f(n) is the big-oh of g(n), then does that automatically make g(n) the big-omega of f(n)? 3- On a graph where (n) is the intersection point of the two functions, what is that point essentially saying. I believe (at least), that it means once that number is hit in both functions, then the faster accelerating one takes off and never looks back. Any help would be greatly appreciated. My teacher is a scary Russian guy who speaks broken english, and I can't understand a word he says!