Tag: Big O Notation

  • Algorithms 101: Big O Notation

    Algorithms 101: Big O Notation

    Big O Notation Big O notation is a mathematical notation used to describe the upper limit of the runtime of an algorithm as a function of the input size. # Example functions to demonstrate Big O notation # O(1) – Constant Time def constant_time_example(arr): return arr[0] # Accessing the first…