Inspired by Project Euler problem #539
You'll be given a vector from 1 to n;
Going from left to right, remove the first number and every other number afterward until the end of the list.
Repeat the procedure from right to left, removing the right most number and every other number from the numbers left. Continue removing every other numbers, alternating left to right and right to left, until a single number remains.
Example with n=9
1 2 3 4 5 6 7 8 9
2 4 6 8
2 6
6
Solution Stats
Problem Comments
Solution Comments
Show commentsProblem Recent Solvers67
Suggested Problems
-
Project Euler: Problem 2, Sum of even Fibonacci
2838 Solvers
-
Project Euler: Problem 5, Smallest multiple
1651 Solvers
-
Back to basics 11 - Max Integer
811 Solvers
-
Create a vector whose elements depend on the previous element
790 Solvers
-
Test Problem; Create a 5x5 array containing all ones
405 Solvers
More from this Author12
Problem Tags
Community Treasure Hunt
Find the treasures in MATLAB Central and discover how the community can help you!
Start Hunting!
Similar to, though simpler than, James's decimation problem: https://www.mathworks.com/matlabcentral/cody/problems/1092-decimation.