News for hackers. Stuff that matters.
Re:Competitive programming is useless by baobabKoodaa on Monday August 23, 2021 @01:42PM (#28279389)
Bubble sort provides O(n^2) time complexity for a task that can be easily solved with O(nlogn) time complexity. The 5-minute load time for GTA was caused by a developer using an algorithm with O(n^2) time complexity when they could have used an algorithm with O(nlogn) time complexity. So, yes, I would say it actually was the reason (unless you are specifically asking if the bad algorithm choice was bubble sort, in which case the answer is no).

There are no comments on this comment yet.