The extra working storage required by an algorithm, excluding the storage occupied by its input. This includes temporary tables and the stack of active recursive calls.
Ancestors (4)
Incoming links (33)
- Array reversal
- Brent cycle-finding algorithm
- Destructive binary search tree flattening
- Distinct-index two-sum by suffix lower bounds
- In-place linked-list reversal
- Past exam of the year 1 of the computer science course of the University of Oxford / 2013 / Imperative programming / 1 / a / Solution
- Past exam of the year 1 of the computer science course of the University of Oxford / 2013 / Imperative programming / 1 / b / Solution
- Past exam of the year 1 of the computer science course of the University of Oxford / 2013 / Imperative programming / 2 / b / ii / Solution
- Past exam of the year 1 of the computer science course of the University of Oxford / 2013 / Imperative programming / 3 / b / Solution
- Past exam of the year 1 of the computer science course of the University of Oxford / 2013 / Imperative programming / 4 / a / Solution
- Past exam of the year 1 of the computer science course of the University of Oxford / 2013 / Imperative programming / 6 / b / Solution
- Past exam of the year 1 of the computer science course of the University of Oxford / 2013 / Imperative programming / 8 / d / Solution
- Past exam of the year 1 of the computer science course of the University of Oxford / 2014 / Imperative programming / 1 / a / Solution
- Past exam of the year 1 of the computer science course of the University of Oxford / 2014 / Imperative programming / 4 / g / Solution
- Past exam of the year 1 of the computer science course of the University of Oxford / 2015 / Imperative programming (resit) / 2 / a / Solution
- Past exam of the year 1 of the computer science course of the University of Oxford / 2018 / Imperative programming / 3 / g / Solution
- Past exam of the year 1 of the computer science course of the University of Oxford / 2018 / Imperative programming / 5 / d / iii / Solution
- Past exam of the year 1 of the computer science course of the University of Oxford / 2018 / Imperative programming / 5 / d / ii / Solution
- Past exam of the year 1 of the computer science course of the University of Oxford / 2019 / Functional programming, design and analysis of algorithms / 5 / c / Solution
- Past exam of the year 1 of the computer science course of the University of Oxford / 2019 / Functional programming, design and analysis of algorithms / 7 / a / Solution
- Past exam of the year 1 of the computer science course of the University of Oxford / 2019 / Functional programming, design and analysis of algorithms / 7 / b / iii / Solution
- Past exam of the year 1 of the computer science course of the University of Oxford / 2021 / Imperative programming (resit) / 1 / e / Solution
- Past exam of the year 1 of the computer science course of the University of Oxford / 2021 / Imperative programming (resit) / 2 / a / Solution
- Past exam of the year 1 of the computer science course of the University of Oxford / 2021 / Imperative programming (resit) / 5 / c / Solution
- Past exam of the year 1 of the computer science course of the University of Oxford / 2021 / Imperative programming (resit) / 5 / d / Solution
- Past exam of the year 1 of the computer science course of the University of Oxford / 2022 / Imperative programming (resit) / 1 / b / Solution
- Past exam of the year 1 of the computer science course of the University of Oxford / 2022 / Imperative programming (resit) / 2 / e / Solution
- Past exam of the year 1 of the computer science course of the University of Oxford / 2023 / Imperative programming / 1 / c / Solution
- Past exam of the year 1 of the computer science course of the University of Oxford / 2023 / Imperative programming / 1 / e / Solution
- Past exam of the year 1 of the computer science course of the University of Oxford / 2023 / Imperative programming / 4 / c / Solution
- Sorted sparse dot product
- Sparse dot product by merging indices
- Staircase matrix search
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.