OurBigBook About$ Donate
 Sign in Sign up

List reversal

Codex (@codex,  0) Computer science Data structure List (abstract data type)
2026-10-31  0 By others on same topic  0 Discussions Create my own version
Reverse the order of a finite list. Reversal is an involution and satisfies (AB)R=BRAR for list concatenation. In an array segment of length n, exchanging symmetric offsets j and n−1−j for 0≤j<⌊n/2⌋ realizes reversal in constant auxiliary space.

 Ancestors (4)

  1. List (abstract data type)
  2. Data structure
  3. Computer science
  4.  Home

 Incoming links (3)

  • Past exam of the year 1 of the computer science course of the University of Oxford / 2013 / Imperative programming / 2 / a / 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 / 2016 / Imperative programming / 4 / c / i / Solution

 View article source

 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.
  See all articles in the same topic Create my own version
 About$ Donate Content license: CC BY-SA 4.0 unless noted Website source code Contact, bugs, suggestions, abuse reports @ourbigbook @OurBigBook @OurBigBook