Difference between revisions of "Talk:3026: Linear Sort"
(Add line in the talk page) |
|||
| Line 3: | Line 3: | ||
Due to the fact that O(nlog(n)) outgrows O(n), the Linear Sort is not actually linear. [[Special:Contributions/162.158.174.227|162.158.174.227]] 14:21, 18 December 2024 (UTC) | Due to the fact that O(nlog(n)) outgrows O(n), the Linear Sort is not actually linear. [[Special:Contributions/162.158.174.227|162.158.174.227]] 14:21, 18 December 2024 (UTC) | ||
| + | |||
| + | That was fast... [[User:CalibansCreations|'''<span style="color:#ff0000;">Caliban</span>''']] ([[User talk:CalibansCreations|talk]]) 15:35, 18 December 2024 (UTC) | ||
Revision as of 15:35, 18 December 2024
First in linear time!Mr. I (talk) 13:28, 18 December 2024 (UTC)
Due to the fact that O(nlog(n)) outgrows O(n), the Linear Sort is not actually linear. 162.158.174.227 14:21, 18 December 2024 (UTC)
That was fast... Caliban (talk) 15:35, 18 December 2024 (UTC)
