Question

John has a set of cards laid on a table in this order:

A, B, C, D, E, F

His friend shuffles the order of the cards randomly, which results in this order:
D, F, B, C, A, E

If John is allowed to swap only 2 adjacent cards at a time, what is the smallest number of swaps to reach the original order of cards?

Answer 1

okay so I think I did this wrong (like I read the question wrong) but I think the lowest number of times you would have to swap the cards is 9. Like I said, not sure, so if you have the real answer please tell me because now I'm curious...
but I hope this helps somewhat!