BIG-O NOTATIONS

Big-O notations are used to represent Space or Time complexities of algorithms. There’re more notations such as Theta and Omega. But we’ll restrict the discussion to the frequently used Big-O notation. Here are some terminology and complexity in Big-O notations you should keep in mind. BIG-O NOTATIONS – GRAPHICAL – YOU ALREADY KNOW IT If … Read more

Time complexity of linear search

The time complexity of linear search is O(n).  In the best case its time complexity is O (1). In the linear search, you search an element in a list sequentially until you find that element. For example, Suppose you want to find the element 2 in the given list below. You have to traverse the … Read more