面试题精选（84）：使序列有序的最少交换次数（minimum swaps） + 删除序列中所有重复的元素

题目描述：（minimum swaps）

Given a sequence, we have to find the minimum no of swaps required to sort the sequence.

 

分析：

formula：  no. of elements out of place  -  "cycles" in the sequence

 

A cycle is a set of elements, each of which is in the place of another.  So in example sequences { 2, 1, 4, 3}, there are two cycles: {1, 2} and {3, 4}.  1 is in the place where 2 needs to go, and 2 is in the place where 1 needs to go 1, so they are a cycle; likewise with 3 and 4.

The sequences {3, 2, 1, 5, 6, 8, 4, 7 }also has two cycles: 3 is in the place of 1 which is in the place of 3, so {1, 3} is a cycle; 2 is