Timeline for Sort deck of cards with least no of moves
Current License: CC BY-SA 3.0
10 events
| when toggle format | what | by | license | comment | |
|---|---|---|---|---|---|
| Jul 6, 2016 at 3:28 | comment | added | D.W.♦ | What' s the original source for this question? This question appears to be copied from stackoverflow.com/q/21852309/781723, without attribution or credit. That constitutes plagiarism, which isn't welcome here. Please consult our guidelines on how to reference material written by others, and edit the question to follow them: cs.stackexchange.com/help/referencing | |
| Aug 26, 2015 at 8:09 | answer | added | Sufyan Nisar | timeline score: -2 | |
| Aug 26, 2015 at 7:31 | history | edited | Raphael |
edited tags
|
|
| Aug 26, 2015 at 6:44 | vote | accept | HimalayanCoder | ||
| Aug 25, 2015 at 20:45 | answer | added | Dennis Kraft | timeline score: 3 | |
| Aug 25, 2015 at 20:45 | history | edited | HimalayanCoder | CC BY-SA 3.0 |
deleted 12 characters in body
|
| Aug 25, 2015 at 20:43 | comment | added | knok16 | Hint: you can mention that some subsequences can be already sorted. And among all such subsequences you can leave some untouched subsequnce and do $MoveCard$ operation only for another cards. It will save some moves. | |
| Aug 25, 2015 at 20:40 | comment | added | D.W.♦ | Hint: Consider all of the cards that you never call MoveCard on. Where will they end up, in the final configuration? If you underline those numbers in the initial configuration, do you see a pattern? What order do they have to be in? What does this imply for your problem? | |
| Aug 25, 2015 at 20:04 | review | First posts | |||
| Aug 25, 2015 at 20:53 | |||||
| Aug 25, 2015 at 20:00 | history | asked | HimalayanCoder | CC BY-SA 3.0 |