Can anyone please verify my implementation of Iterative Merge Sort ? I need to know that is it correct and can I use it in solving problems. The code is commented as my level. Thanks in advance.
# | User | Rating |
---|---|---|
1 | tourist | 3803 |
2 | jiangly | 3707 |
3 | Benq | 3627 |
4 | ecnerwala | 3584 |
5 | orzdevinwang | 3573 |
6 | Geothermal | 3569 |
6 | cnnfls_csy | 3569 |
8 | Radewoosh | 3542 |
9 | jqdai0815 | 3532 |
10 | gyh20 | 3447 |
# | User | Contrib. |
---|---|---|
1 | awoo | 161 |
2 | maomao90 | 160 |
3 | adamant | 157 |
4 | maroonrk | 154 |
5 | -is-this-fft- | 148 |
5 | SecondThread | 148 |
7 | Petr | 147 |
7 | atcoder_official | 147 |
9 | TheScrasse | 145 |
9 | nor | 145 |
Can anyone please verify my implementation of Iterative Merge Sort ? I need to know that is it correct and can I use it in solving problems. The code is commented as my level. Thanks in advance.
Name |
---|
A better idea: just use the sort() function which is probably also a lot faster.
I think any sort task would do the trick. Also you can stress it with built-in c++ std::sort.