Timeline for Lower bound and worst case scenario
Current License: CC BY-SA 4.0
9 events
| when toggle format | what | by | license | comment | |
|---|---|---|---|---|---|
| Apr 14, 2020 at 0:34 | comment | added | AAAA | @vonbrand , Yes I have assumed when I said that " among all worst cases times of algorithms" that the best case algorithm is included in these algorithms. | |
| Apr 14, 2020 at 0:26 | comment | added | vonbrand | @AAAA, not exactly. It is the worst case time for the best algorithm, more or less (the worst cases can very well be different for different algorithms). | |
| Apr 14, 2020 at 0:21 | vote | accept | AAAA | ||
| Apr 14, 2020 at 0:19 | comment | added | Steven | Intuitively yes! | |
| Apr 14, 2020 at 0:18 | history | edited | Steven | CC BY-SA 4.0 |
added 42 characters in body
|
| Apr 14, 2020 at 0:13 | comment | added | AAAA | So according to your stated definition the lower bound is the minimum time among all worst cases times of algorithms that solves this problem ? | |
| Apr 14, 2020 at 0:06 | history | edited | Steven | CC BY-SA 4.0 |
edited body
|
| Apr 14, 2020 at 0:01 | history | edited | Steven | CC BY-SA 4.0 |
added 424 characters in body
|
| Apr 13, 2020 at 23:54 | history | answered | Steven | CC BY-SA 4.0 |