Timeline for Insertion Sort in C++
Current License: CC BY-SA 3.0
7 events
| when toggle format | what | by | license | comment | |
|---|---|---|---|---|---|
| Apr 12, 2017 at 5:59 | history | edited | Clearer | CC BY-SA 3.0 |
added 5 characters in body
|
| Nov 15, 2015 at 20:43 | comment | added | Clearer | Of course! Usually I don't bother but I should make a habit of actually doing this right... always. And yes, the names are horrible. | |
| Nov 15, 2015 at 20:40 | history | edited | Clearer | CC BY-SA 3.0 |
Added comparator
|
| Nov 15, 2015 at 20:32 | history | edited | Clearer | CC BY-SA 3.0 |
Updated to use `std::rotate`; changed comment about `std::copy*` to fit with `std::rotate`
|
| Nov 15, 2015 at 8:51 | comment | added | Snowhawk |
You should also accept a comparator in your insertion_sort to pass to std::upper_bound. std::rotate could be used instead of your own handwritten for.
|
|
| Nov 15, 2015 at 7:32 | review | First posts | |||
| Nov 15, 2015 at 8:47 | |||||
| Nov 15, 2015 at 7:27 | history | answered | Clearer | CC BY-SA 3.0 |