Timeline for Theta estimation of two functions
Current License: CC BY-SA 3.0
5 events
| when toggle format | what | by | license | comment | |
|---|---|---|---|---|---|
| Nov 10, 2014 at 20:43 | comment | added | David Richerby | I'm sorry but the simplest possible way to explain anything has to be a correct explanation. An explanation that is simple but wrong is not useful. | |
| Nov 10, 2014 at 20:39 | comment | added | Yunrock | Thanks a lot to show me that the earth isn't plane... If you, Einstein, read again the question can note this "Can someone just explain this in beginners terms for me? I don't know what Big-O or theta even refer to in this notation". I just show this topics in simple way as possible. | |
| Nov 10, 2014 at 8:52 | comment | added | David Richerby | Unfortunately, this answer is wrong in several ways. Complexity is a measure of problems, not algorithms. $O()$ and $\Theta()$ are measures of functions, not algorithms. $O()$ provides an upper bound on a function: that function could be used to describe the worst-case running time of an algorithm, or used for anything else, such as the best case. | |
| Nov 10, 2014 at 4:48 | review | First posts | |||
| Nov 10, 2014 at 8:52 | |||||
| Nov 10, 2014 at 4:46 | history | answered | Yunrock | CC BY-SA 3.0 |