A time complexity bounded by O(n) for input size n. A single pass with constant work per input entry has this bound.
Ancestors (6)
- Time complexity
- Complexity class
- Computational complexity theory
- Theoretical computer science
- Computer science
- Home
Incoming links (25)
- Constant segment of an array
- Filtering a list by unfolding
- Integer-square membership in a square-root Beatty sequence
- Linear flattening of a binary tree
- List-based set representation
- Longest bitonic contiguous segment
- Lower weighted median
- Maximum priority queue
- Maximum-subarray segment summary
- 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 computer science course of the University of Oxford / 2015 / Advanced data structures and algorithms / 1 / d / Solution
- Past exam of the short options paper shared by Prelims and Parts A and B of the physics course of the University of Oxford / 2017 / S18 / 3 / 6 / 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 / 2016 / Functional programming, design and analysis of algorithms (resit) / 4 / d / Solution
- Past exam of the year 1 of the computer science course of the University of Oxford / 2016 / Functional programming, design and analysis of algorithms (resit) / 4 / f / Solution
- Past exam of the year 1 of the computer science course of the University of Oxford / 2018 / Functional programming, design and analysis of algorithms / 1 / b / Solution
- Past exam of the year 1 of the computer science course of the University of Oxford / 2018 / Functional programming, design and analysis of algorithms / 5 / d / 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) / 3 / a / 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 / 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) / 4 / a / 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) / 4 / b / 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) / 4 / c / Solution
- Skew-binary random-access list
- Stable list partition
- Three-stack deque
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.