Timeline for Merge Sort Algorithm in Python
Current License: CC BY-SA 3.0
5 events
| when toggle format | what | by | license | comment | |
|---|---|---|---|---|---|
| Feb 5, 2014 at 21:53 | review | First posts | |||
| Feb 5, 2014 at 22:00 | |||||
| Feb 5, 2014 at 21:48 | comment | added | ASKASK | that is true; I also have a bunch of tips for his coding style though | |
| Feb 5, 2014 at 21:48 | history | edited | ASKASK | CC BY-SA 3.0 |
added 1005 characters in body; added 75 characters in body; added 289 characters in body
|
| Feb 5, 2014 at 21:48 | comment | added | Gareth Rees |
Using heapq.merge seems like it would be contrary to the spirit of the OP's exercise (that is, learning how merge sort works)! I mean, if you're going to use heapq.merge, why not just use sorted?
|
|
| Feb 5, 2014 at 21:35 | history | answered | ASKASK | CC BY-SA 3.0 |