Problem 44712. Sort Reversal
There are n index cards in a row, with n distinct integers written on them (one number per card) so that the numbers are sorted in decreasing order. You are only allowed to exchange pair of cards that have exactly one card between them.
Given an odd value n, what is the minimum number of exchanges required to reverse the order of arrangement?
THEORY: The problem can be solved by applying a sorting algorithm such as bubble sort or insertion sort first to the numbers in odd positions and then to the numbers in even positions.
Solution Stats
Problem Comments
Solution Comments
Show commentsProblem Recent Solvers16
Suggested Problems
-
Number of 1s in the Binary Representation of a Number
442 Solvers
-
133 Solvers
-
Find the sum of the elements in the "second" diagonal
1141 Solvers
-
Magic is simple (for beginners)
8661 Solvers
-
344 Solvers
More from this Author18
Problem Tags
Community Treasure Hunt
Find the treasures in MATLAB Central and discover how the community can help you!
Start Hunting!