Difference between revisions of "Talk:2939: Complexity Analysis"
(Typo! :P.) |
|||
| Line 1: | Line 1: | ||
<!--Please sign your posts with ~~~~ and don't delete this text. New comments should be added at the bottom.--> | <!--Please sign your posts with ~~~~ and don't delete this text. New comments should be added at the bottom.--> | ||
| − | + | I could be mistaken, but I think the "Best case" doesn't actually describe a situation where the algorithm takes the minimum amount of time. Rather, it describes that the algorithm wasn't necessary in the first place, possibly due to something like the list incidentally already being sorted. [[Special:Contributions/172.68.23.74|172.68.23.74]] 23:25, 29 May 2024 (UTC) | |
| − | I could be mistaken, but I think the "Best case" doesn't actually describe | ||
Revision as of 23:26, 29 May 2024
I could be mistaken, but I think the "Best case" doesn't actually describe a situation where the algorithm takes the minimum amount of time. Rather, it describes that the algorithm wasn't necessary in the first place, possibly due to something like the list incidentally already being sorted. 172.68.23.74 23:25, 29 May 2024 (UTC)
