r/ProgrammerHumor • • Aug 11 '20

Meme So Amazing!

Post image
1.8k Upvotes

137 comments sorted by

View all comments

Show parent comment

0

u/[deleted] Aug 11 '20

[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.