could anyone help me in the following question
Show that the function f(n) = 4n2 + 6n + 1 is O(n2) by finding the suitable values of c and n0
![]()
|
Results 1 to 4 of 4
Thread: Big-O computationThreaded View
|
Click Here to Expand Forum to Full Width |