Timeline for Data structure for sorting by multiple attributes
Current License: CC BY-SA 3.0
3 events
| when toggle format | what | by | license | comment | |
|---|---|---|---|---|---|
| Dec 9, 2015 at 14:24 | comment | added | user22815 | @Adrian correct, with a limited number of swaps this approach would not work. You could do some calculations ahead of time to determine the minimum number of swaps necessary to achieve the maximum result, or to determine a strategy to maximize the result if the actual maximum is not possible. | |
| Dec 9, 2015 at 9:02 | comment | added | Adrian Buzea | I think you're right. I was overthinking it. What about the case where I can only do a maximum of K swaps ? This would not work anymore, and I'd have to do it my way right ? | |
| Dec 8, 2015 at 18:19 | history | answered | user22815 | CC BY-SA 3.0 |