Timeline for Heapsort for sorted input
Current License: CC BY-SA 3.0
9 events
| when toggle format | what | by | license | comment | |
|---|---|---|---|---|---|
| Jan 2, 2015 at 11:15 | comment | added | Dan Allford | I was just hoping for big-O. I understand that this will be nlogn because heapsort is nlogn for all inputs. The thing I want to know is does the fact that we have this additional information allow us to solve the problem more simply, the layout of the book suggests that we can, but I'm not sure. Thank you :) | |
| Jan 2, 2015 at 5:37 | comment | added | Raphael | Do you want $O$-classes or more precise results? | |
| Jan 2, 2015 at 5:36 | history | edited | Raphael | edited tags | |
| Jan 1, 2015 at 22:43 | answer | added | n.Perception | timeline score: 2 | |
| Jan 1, 2015 at 15:07 | history | tweeted | twitter.com/#!/StackCompSci/status/550669567224471553 | ||
| Jan 1, 2015 at 11:03 | comment | added | David Richerby | I deleted the follow-up questions from your post: two questions is quite enough for one post. If you want to re-ask them, put them in separate questions. (But you might want to wait for an answer to this one, first, as that may help you solve the others on your own.) | |
| Jan 1, 2015 at 11:02 | history | edited | David Richerby | CC BY-SA 3.0 | Deleted additional questions. |
| Jan 1, 2015 at 10:53 | review | First posts | |||
| Jan 1, 2015 at 11:03 | |||||
| Jan 1, 2015 at 10:46 | history | asked | Dan Allford | CC BY-SA 3.0 |