Since there is no loop, it is O(1).
More Related Contents:
- O(3^n) exponential time complexity [closed]
- What is a plain English explanation of “Big O” notation?
- What does O(log n) mean exactly?
- Difference between Big-O and Little-O Notation
- Time complexity of Euclid’s Algorithm
- What would cause an algorithm to have O(log log n) complexity?
- What is pseudopolynomial time? How does it differ from polynomial time?
- What would cause an algorithm to have O(log n) complexity?
- Are there any cases where you would prefer a higher big-O time complexity algorithm over the lower one?
- Big O of JavaScript arrays
- Maximum single-sell profit
- Examples of Algorithms which has O(1), O(n log n) and O(log n) complexities
- Why do we ignore co-efficients in Big O notation?
- Writing a specific function in python
- Invalid selector: Compound class names not permitted error using Selenium
- Implement a queue in which push_rear(), pop_front() and get_min() are all constant time operations
- Big-O for Eight Year Olds? [duplicate]
- webdriver.FirefoxProfile(): Is it possible to use a profile without making a copy of it?
- python 3.0 open() default encoding
- Time complexity of Sieve of Eratosthenes algorithm
- Make sure that you use the correct version of ‘pip’ installed for your Python interpreter located at ‘dir:\projectPath\venv\Scripts\python.exe’
- Failed to load resource: the server responded with a status of 429 (Too Many Requests) and 404 (Not Found) with ChromeDriver Chrome through Selenium
- “Eager” Page Load Strategy workaround for Chromedriver Selenium in Python
- Convert object data type to string issue in python
- Python ModuleNotFoundError while importing a module in conftest for Pytest framework
- Quicksort superiority over Heap Sort
- What is the complexity of this simple piece of code?
- Time Complexity of two for loops [duplicate]
- How to bypass being rate limited ..HTML Error 1015 using Python
- Do iterative and recursive versions of an algorithm have the same time complexity?