question suggest some approach and reason behind it
# | User | Rating |
---|---|---|
1 | tourist | 3690 |
2 | jiangly | 3647 |
3 | Benq | 3581 |
4 | orzdevinwang | 3570 |
5 | Geothermal | 3569 |
5 | cnnfls_csy | 3569 |
7 | Radewoosh | 3509 |
8 | ecnerwala | 3486 |
9 | jqdai0815 | 3474 |
10 | gyh20 | 3447 |
# | User | Contrib. |
---|---|---|
1 | maomao90 | 174 |
2 | awoo | 165 |
3 | adamant | 161 |
4 | TheScrasse | 160 |
5 | nor | 158 |
6 | maroonrk | 156 |
7 | -is-this-fft- | 152 |
8 | orz | 146 |
9 | SecondThread | 145 |
9 | pajenegod | 145 |
Name |
---|
Prove that it is always optimal to swap any element into its final position.
Think of the array as a permutation, and consider cycles in the permutation. Define $$$f(A)$$$ as the sum of one minus the size of each cycle, where fixed points (elements in their final positions) are not counted. The $$$f$$$ value of a sorted array is $$$0$$$. Prove that any swap decreases $$$f$$$ by at most $$$1$$$, and there's always an operation that decreases $$$f$$$ by $$$1$$$.
How can you use knowledge of graph theory to easily determine how many swaps it takes to sort each group of elements?
Stop posting blogs for questions which're already google-able