Given an array with N elements and an array of N indices find the lowest possible amounts of swaps
Hint: Assume you have four items that are in order a,b,c,d but you want them in order b, c, d, a. How many swaps do you need and why? 

Then you generalise this to the whole array.