What is Big O of N notation?
Big O of N notation or O(n) is the size of the input to your function. Simply put, how long it takes for your computer to run your function and the memory required for your computer to do so.
When is it useful?
Big-O notation helps programmers to measure the scalability of an algorithm. It indicates the maximum number of operations taken by an algorithm for giving output based on how much data the program has to work on. In simple words, Big-O notation describes the relationship between steps required to execute the algorithm and input to the algorithm. This relationship shows the time efficiency or time complexity.
To learn more, please visit this link.