Timeline for What is O in Big O?
Current License: CC BY-SA 3.0
4 events
| when toggle format | what | by | license | comment | |
|---|---|---|---|---|---|
| Sep 21, 2012 at 0:36 | history | edited | SoftwareSavant | CC BY-SA 3.0 |
corrected spelling and answer
|
| Sep 14, 2011 at 12:19 | comment | added | SoftwareSavant | Not to argue with you here, but that's kind of what I meant. What does run time mean right? Well, run time is determined by what has to be processed on the machine. I guess I kind of use cycle liberally here. By cycle I guess I should have said iterate-through or something like that. You are right about upper bound though, It does not determine the average. Therefore I accept the downgrade. | |
| Sep 14, 2011 at 1:37 | comment | added | Casey Patton | -1 because this is just plain old incorrect AND answered a separate question than was asked. The question was why is the letter "O" used, not "how does Big O notation work?". You're incorrect about how Big-oh works as well though...looping through an array is O(n) where n is the size of the array, not O(1). The notation has nothing to do with "cycles" of an algorithm...it's a measurement of the upper bound of the run time of an algorithm. | |
| Sep 13, 2011 at 19:46 | history | answered | SoftwareSavant | CC BY-SA 3.0 |