Timeline for Sort array in the minimum number of moves
Current License: CC BY-SA 3.0
5 events
| when toggle format | what | by | license | comment | |
|---|---|---|---|---|---|
| Oct 12, 2014 at 18:47 | vote | accept | devongovett | ||
| Oct 12, 2014 at 6:38 | answer | added | Florian F | timeline score: 7 | |
| Oct 12, 2014 at 6:36 | comment | added | Ian Mercer |
How did you 'transform the indices'? If after swapping 1<>7 you replace all forward references to 7 with 1 and vice-versa, 7<>8 would become 1<>8 and these three values would then be in the correct positions.
|
|
| Oct 12, 2014 at 5:29 | history | edited | devongovett |
edited tags
|
|
| Oct 12, 2014 at 4:57 | history | asked | devongovett | CC BY-SA 3.0 |