A time complexity bounded by O(1) independently of input size, under a stated computational cost model. Fixed-size machine arithmetic may be constant time, whereas arbitrary-precision arithmetic depends on operand length.
Ancestors (6)
- Time complexity
- Complexity class
- Computational complexity theory
- Theoretical computer science
- Computer science
- Home
Incoming links (17)
- Maximum priority queue
- Past exam of the computer science course of the University of Oxford / 2015 / Advanced data structures and algorithms / 1 / a / Solution
- Past exam of the year 1 of the computer science course of the University of Oxford / 2003 / Functional programming, data structures and algorithms, procedural programming, and digital hardware / 6 / b / Solution
- Past exam of the year 1 of the computer science course of the University of Oxford / 2003 / Functional programming, data structures and algorithms, procedural programming, and digital hardware / 7 / a / Solution
- Past exam of the year 1 of the computer science course of the University of Oxford / 2003 / Functional programming, data structures and algorithms, procedural programming, and digital hardware / 8 / c / Solution
- Past exam of the year 1 of the computer science course of the University of Oxford / 2018 / Imperative programming / 3 / a / Solution
- Past exam of the year 1 of the computer science course of the University of Oxford / 2018 / Imperative programming / 3 / c / Solution
- Past exam of the year 1 of the computer science course of the University of Oxford / 2018 / Imperative programming / 3 / d / Solution
- Past exam of the year 1 of the computer science course of the University of Oxford / 2018 / Imperative programming / 4 / b / Solution
- Past exam of the year 1 of the computer science course of the University of Oxford / 2018 / Imperative programming / 4 / c / Solution
- Past exam of the year 1 of the computer science course of the University of Oxford / 2018 / Imperative programming / 6 / c / ii / Solution
- Past exam of the year 1 of the computer science course of the University of Oxford / 2022 / Functional programming, design and analysis of algorithms (resit) / 2 / c / Solution
- Past exam of the year 1 of the computer science course of the University of Oxford / 2022 / Functional programming, design and analysis of algorithms (resit) / 2 / e / Solution
- Past exam of the year 1 of the computer science course of the University of Oxford / 2022 / Functional programming, design and analysis of algorithms (resit) / 2 / g / Solution
- Past exam of the year 1 of the computer science course of the University of Oxford / 2022 / Functional programming, design and analysis of algorithms (resit) / 2 / h / Solution
- Past exam of the year 1 of the computer science course of the University of Oxford / 2022 / Functional programming, design and analysis of algorithms (resit) / 3 / a / Solution
- Skew-binary random-access list
Discussion (0) New discussion
There are no discussions about this article yet.
Articles by others on the same topic (0)
There are currently no matching articles.