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
- New version after 9 days2 days ago
- New version after 3 days34 days ago
- New version after 40 days37 days ago
- Turn your phone or tablet into a chess clock50 days ago
- Guest program: bouncing balls67 days ago
- New version after 3 months, and turtle graphics77 days ago
- Interactively zooming in to the Mandelbrot set on a touchscreen96 days ago
- A little timer app97 days ago
- New version after 4 monthsJun 28, 2024
- Visualizing the digits of πMay 04, 2024
Leave a comment
Log in with itch.io to leave a comment.