Originally posted by silix
View Post
You cannot say that something is O(1) if it includes something have a logarithmic complexity.
I know that CFS use lists but I am assuming that the number of lookups is constant or else CFS would be O(n)
Leave a comment: