Computer Science, Python, Big O Notation, Time Complexity, Algorithms.
Ο (Omicron), which is what we refer to as Big O. This is the most common case used to describe time complexity, and we will be discussing it in this article. O(1), O(n) — Constant and Linear Time The simplest option is to use O(n) notation, which means that the running time of the algorithm