Timeline for Rearranging Cartons Algorithm
Current License: CC BY-SA 3.0
9 events
| when toggle format | what | by | license | comment | |
|---|---|---|---|---|---|
| Dec 26, 2012 at 14:00 | answer | added | ratchet freak | timeline score: 1 | |
| Dec 26, 2012 at 11:32 | comment | added | 7Aces | Thanks a lot! :D @PetarMinchev I believe both the problem are the same at the root level. I'll study the solution to that problem, meanwhile, what's the protocol to follow if you find an answer in a comment? | |
| Dec 26, 2012 at 10:34 | comment | added | Petar Minchev | Here is the solution - stackoverflow.com/questions/7797540/… | |
| Dec 26, 2012 at 10:28 | comment | added | Giorgio | @7Aces: I also do not understand the down vote and the votes to close. The question is very clear (and IMHO, interesting too): find an algorithm that computes an optimal solution. Upvoting and voting to keep open. | |
| Dec 26, 2012 at 10:26 | comment | added | Giorgio | @ratchet freak: I am not sure this is bubble sort: in bubble sort you repeatedly scan an array and perform the swaps during each scan. Here you want to find a minimal sequence of swaps that produces a solution. Seems like a problem that can be solved using streams and lazy evaluation. | |
| Dec 26, 2012 at 5:29 | comment | added | 7Aces | Reason for down-voting? @ratchetfreak I find bubblesort per se inefficient. I am trying to find an algorithm that can handle such large data-sets in an efficient way. | |
| Dec 26, 2012 at 1:52 | review | Close votes | |||
| Dec 26, 2012 at 14:28 | |||||
| Dec 25, 2012 at 23:54 | comment | added | ratchet freak | in other words you want to find the most efficient bubblesort... | |
| Dec 25, 2012 at 21:10 | history | asked | 7Aces | CC BY-SA 3.0 |