big o notation
Big O notation - worst-case scenario, quantify performance as a input
size becomes arbitrary large
O(1) - constant time
O(log(n)) - logarithmic time
O(n) - linear time
O(n log(n)) - linearlogarithmic time
O(n^2) - quadric time
O(n^3) - cubic time
O(b^n) - exponential time, b > 1
O(n!) - factorial timebig o notation in data structure
The Big O notation is used to express the upper bound of the runtime of an algorithm and thus measure the worst-case time complexity of an algorithm. It analyses and calculates the time and amount of memory required for the execution of an algorithm for an input value.Copyright © 2021 Codeinu
Forgot your account's password or having trouble logging into your Account? Don't worry, we'll help you to get back your account. Enter your email address and we'll send you a recovery link to reset your password. If you are experiencing problems resetting your password contact us
