Definition of Algorithm:
Al algorithm is a step-by-step instruction used to perform an ultimate task.
Worst-case time complexity:
Worst-case time complexity denotes the longest running time of an algorithm to complete a task given any input size.
Big O notation:
Big O notation is used to determine the performance of an algorithm and compare and analyze algorithms. It describes the execution time of a task in relation to the number of steps required to complete a task.
Big O notation is written in the form of O(n) where O stands for “Order of Magnitude” and n represents the number of inputs or what we are comparing the task against.
In one word, Big O notation is a way of describing or talking about the performance and efficiency of code.
Post a Comment