Question

Given N numbers and another permutation of those numbers, What is the minimum number of exchanges for the N numbers to be converted to the given permutation, given only two adjacent numbers can be exchanged?
Example :
Given numbers 34, 29, 12, 78 and 90
Premutation :90, 29, 78, 34, 12
Minimum exchanges :
• Exchange78,90—34,29,12,90,78
• Exchange12,90—34,29,90,12,78
• Exchange34,29—29,34,12,90,78
• Exchange12,78—29,34,90,78,12
• Exchange34,90—29,90,34,78,12
• Exchange29,90—90,29,34,78,12
• Exchange34,78—90,29,78,34,12
I need an algorithm....

Answer 1

Looks like a bubble sort where the value sorted for is the index of the second data-set (90 = 1, 29 =2 etc).