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
- Pong Wars, MMO edition5 days ago
- New version after 41 days, and stop-motion animation7 days ago
- Drawing with a pen on a pendulum42 days ago
- New version after 16 days48 days ago
- New version after 9 days65 days ago
- New version after 3 days96 days ago
- New version after 40 days99 days ago
- Turn your phone or tablet into a chess clockNov 01, 2024
- Guest program: bouncing ballsOct 15, 2024
- New version after 3 months, and turtle graphicsOct 05, 2024
Leave a comment
Log in with itch.io to leave a comment.