In an alternating permutation of numbers 1 to n, the numbers are arranged so that they alternately increase and decrease. For example, there are five alternating permutations of the numbers 1, 2, 3, and 4:
1 3 2 4
1 4 2 3
2 3 1 4
2 4 1 3
3 4 1 2
Write a function to count the alternating permutations for a set of n numbers.
Solution Stats
Problem Comments
3 Comments
Solution Comments
Show comments
Loading...
Problem Recent Solvers14
Suggested Problems
-
Find all elements less than 0 or greater than 10 and replace them with NaN
15822 Solvers
-
Sort a list of complex numbers based on far they are from the origin.
5823 Solvers
-
357 Solvers
-
Matrix of almost all zeros, except for main diagonal
191 Solvers
-
Regular polygon bounded by and bounding a circle
46 Solvers
More from this Author330
Problem Tags
Community Treasure Hunt
Find the treasures in MATLAB Central and discover how the community can help you!
Start Hunting!
The test case result for n=5 seems a tad high.
Tim, that last case is altperm(altperm(5)). I did that to discourage lookup solutions.
Oops--my mistake.