What is Big-O notation ?

Milan Panda 26.4.19 No comments


Big-O notation :-
      It deals with the maximum time required by the algorithm f(n) is said to be O(g(n)) if there exists        a positive constants c and no. Such that h(n)<=c.g(n) for all n>=no.
      Big-O notation gives the  upper bound of time requires by the algorithm.


No comments :

Post a Comment

Subscribe to: Post Comments ( Atom )

Subscribe

Milan Panda
Admin
About Me | Contact
Copyright 2023-2024 © Programming1011 . 🎀 Developed and Design By- Milan Panda. Happy Holi All Of You 🎀