'Describe algorithm' presentation slideshows

Data Structures -1 st exam-

Data Structures -1 st exam-. ????????. [10] We define f(n) = O(g(n)) if and only if there is a real constant c>0 and an integer constant n 0 >0, such that f(n) <= cg(n) for all n >= n 0 . Using this definition, show that a.[5]9n 3 + 100n + 1 = O(n 3 ) Ans : 9n 3 + 100n + 1<=cn 3

226 views • 17 slides