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 | 4009 |
2 | jiangly | 3823 |
3 | Benq | 3738 |
4 | Radewoosh | 3633 |
5 | jqdai0815 | 3620 |
6 | orzdevinwang | 3529 |
7 | ecnerwala | 3446 |
8 | Um_nik | 3396 |
9 | ksun48 | 3390 |
10 | gamegame | 3386 |
# | User | Contrib. |
---|---|---|
1 | cry | 166 |
2 | maomao90 | 163 |
2 | Um_nik | 163 |
4 | atcoder_official | 161 |
5 | adamant | 159 |
6 | -is-this-fft- | 158 |
7 | awoo | 157 |
8 | TheScrasse | 154 |
9 | nor | 153 |
9 | Dominater069 | 153 |
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.