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 Solvers68
Suggested Problems
-
6719 Solvers
-
Project Euler: Problem 7, Nth prime
1776 Solvers
-
What is the distance from point P(x,y) to the line Ax + By + C = 0?
560 Solvers
-
Find the maximum number of decimal places in a set of numbers
3566 Solvers
-
Fahrenheit to Celsius converter
611 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.