A little recursion problem
Lua Carousel » Devlog
Are you reading this on your phone? Quick, see if you can solve this problem without getting up and switching devices.
Convolving a list with itself. Given a list [x1, x2, ..., xn−1, xn], where n is unknown, construct [(x1, xn), (x2, xn−1), ..., (xn−1, x2), (xn, x1)] in n recursive calls.
If you can't do it, try installing Lua Carousel below and try again.
(Problem found in this paper (pdf).)
Get Lua Carousel
Lua Carousel
Write programs on desktop and mobile
Status | In development |
Category | Tool |
Author | Kartik Agaram |
Tags | LÖVE |
More posts
- Visualizing the digits of π4 days ago
- Drawing histograms35 days ago
- The simplest possible dither38 days ago
- All the 1-D cellular automata46 days ago
- A Sokoban client based on Lua Carousel57 days ago
- Lots of charts74 days ago
- A little programming game77 days ago
- New version after 51 days81 days ago
- Pong Wars99 days ago
Leave a comment
Log in with itch.io to leave a comment.