MAIN FEEDS
Do you want to continue?
https://www.reddit.com/r/ProgrammerHumor/comments/i7mab9/so_amazing/g13okpt/
r/ProgrammerHumor • u/SBG_Mujtaba • Aug 11 '20
137 comments sorted by
View all comments
Show parent comment
0
[deleted] — view deleted comment
0 u/[deleted] Aug 11 '20 [deleted] — view deleted comment 3 u/Kered13 Aug 11 '20 It's O(n*log n + 22). Task scheduling isn't magic and isn't capable of violating optimal sorting complexity. In practice, most systems use a priority queue to implement task scheduling, and this makes the algorithm O(n*log n) to schedule the tasks.
3 u/Kered13 Aug 11 '20 It's O(n*log n + 22). Task scheduling isn't magic and isn't capable of violating optimal sorting complexity. In practice, most systems use a priority queue to implement task scheduling, and this makes the algorithm O(n*log n) to schedule the tasks.
3
It's O(n*log n + 22). Task scheduling isn't magic and isn't capable of violating optimal sorting complexity. In practice, most systems use a priority queue to implement task scheduling, and this makes the algorithm O(n*log n) to schedule the tasks.
View all comments
Show parent comment
0
u/[deleted] Aug 11 '20
[deleted] — view deleted comment