Linux's CFS is O(log N) to insert; O(1) to switch tasks (N being number of threads). [1] So O(N log N) it seems. [1] https://en.wikipedia.org/wiki/Completely_F

Linux's CFS is O(log N) to insert; O(1) to switch tasks (N being number of threads). [1] So O(N log N) it seems. [1] https://en.wikipedia.org/wiki/Completely_Fair_Scheduler#Algorithm https://en.wikipedia.org/wiki/Completely_Fair_Scheduler#Algo...