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 Solvers69
Suggested Problems
-
Find the sum of all the numbers of the input vector
55374 Solvers
-
Find out missing number from a vector of 9 elements
322 Solvers
-
Side of an equilateral triangle
7207 Solvers
-
347 Solvers
-
Find out sum of all elements of given Matrix
540 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.