Timeline for big-O and Θ notation subset
Current License: CC BY-SA 3.0
12 events
| when toggle format | what | by | license | comment | |
|---|---|---|---|---|---|
| Oct 30, 2018 at 22:47 | history | edited | Raphael |
edited tags
|
|
| Jun 17, 2016 at 15:39 | comment | added | adrianN | Maybe check out our reference question | |
| Jun 17, 2016 at 11:28 | comment | added | Raphael | Which two statements? | |
| Jun 17, 2016 at 11:28 | comment | added | Raphael | The title you have chosen is not well suited to representing your question. Please take some time to improve it; we have collected some advice here. Thank you! | |
| Jun 17, 2016 at 8:14 | history | edited | David Richerby |
edited tags
|
|
| Jun 17, 2016 at 5:38 | history | edited | Evil | CC BY-SA 3.0 |
deleted 30 characters in body
|
| Jun 16, 2016 at 19:54 | comment | added | David Richerby | What part seems contradictory? | |
| Jun 16, 2016 at 19:26 | history | migrated | from stackoverflow.com (revisions) | ||
| Jun 16, 2016 at 16:28 | answer | added | rp.beltran | timeline score: 7 | |
| Jun 16, 2016 at 16:19 | comment | added | shivani1007 | Θ is asymptotically tight bound for f(n) having both lower and upper bound. Whereas, O notation gives an upper bound on a function. @MattBall | |
| Jun 16, 2016 at 16:11 | answer | added | Yerken | timeline score: 4 | |
| Jun 16, 2016 at 16:07 | history | asked | shivani1007 | CC BY-SA 3.0 |