Timeline for Asymptotic Notation Analysis
Current License: CC BY-SA 4.0
9 events
when toggle format | what | by | license | comment | |
---|---|---|---|---|---|
Sep 10, 2018 at 3:03 | review | First posts | |||
Sep 10, 2018 at 13:44 | |||||
Aug 28, 2018 at 18:35 | comment | added | Raphael | Note that as soon as O is involved, n tends towards infinity (in this context). So those lower bounds on n are irrelevant. | |
Aug 28, 2018 at 18:34 | history | edited | Raphael |
edited tags
|
|
Aug 28, 2018 at 18:34 | 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! | |
Aug 28, 2018 at 18:34 | comment | added | Raphael | Welcome to Computer Science! What have you tried? Where did you get stuck? We do not want to just hand you the solution; we want you to gain understanding. However, as it is we do not know what your underlying problem is, so we can not begin to help. See here for tips on asking questions about exercise problems. If you are uncertain how to improve your question, why not ask around in Computer Science Chat? | |
S Aug 28, 2018 at 13:21 | history | suggested | ScottK | CC BY-SA 4.0 |
Fixing spelling mistake
|
Aug 28, 2018 at 6:57 | review | Suggested edits | |||
S Aug 28, 2018 at 13:21 | |||||
Aug 28, 2018 at 6:55 | answer | added | ScottK | timeline score: 4 | |
Aug 28, 2018 at 1:54 | history | asked | geometry18 | CC BY-SA 4.0 |