Data Structures and Algorithms 102: Deep Dive into Data Structures and Algorithms

Strengths and weaknesses of a data structure can be identified using a mathematical concept known as Big O Notation as discussed earlier on https://dev.to/atukwatsetracy/introduction-to-data-structures-algorithms-10gn.It is a tool used to analyze the cost of an Algorithm.An algorithm may not have the same performance for different types of inputs because its performance changes With the increase in the input size.The study of change in performance of the algorithm with the change in the order of the input size is defined as Asymptotic Analysis.
The 3 mainly asymptotic notations are;

• Big-O notation:This represents the upper bound of the running time of an algorithm. Thus, it gives the worst-case complexity of an algorithm.
• Omega notation:Omega notation represents the lower bound of the running time of an algorithm. Thus, it provides the best case complexity of an algorithm.
• Theta notation:It represents the upper and the lower bound of the running time of an algorithm, it is used for analyzing the average-case complexity of an algorithm.