## Big o notation in data structures

Big O notation is the most efficient tool to compare the efficiency of algorithms. it represents the upper bound of an algorithm. it tells the asymptotic behavior of a function and how fast a function f(n) grows as input size n becomes large. Big O notation – Definition A function f(n) is order of g(n) if…