f(n) is O(g(n)) and g(n) is O(h(n)), then f(n) if O(h(n)). -------------That's right!
But I'm not sure that I understand what you mean. ----------Prove something is O(1)?And you know it's O(g(n)) but g(n) is not const? To: [email protected] From: [email protected] Date: Wed, 25 Aug 2010 03:53:19 +0000 Subject: [c-prog] Big-O Notation Here's my question: "Assuming f(n) is O(g(n)) how do I prove that c is O(1)?" I know that the theory of transivity says if f(n) is O(g(n)) and g(n) is O(h(n)), then f(n) if O(h(n)). Am I on the right track? [Non-text portions of this message have been removed]
