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

76.0% Correct | 24.0% Incorrect
Last Solution submitted on Apr 11, 2024

Problem Comments

Solution Comments

Show comments

Problem Recent Solvers16

Suggested Problems

More from this Author18

Community Treasure Hunt

Find the treasures in MATLAB Central and discover how the community can help you!

Start Hunting!