KnowledgeHub
Questions
Tags
Users
Search
Alex Rivera
|
Logout
Edit Question
Title
Body
I was going through some data structures and I noticed this as a time complexity: O(log(log(n))))-competitive . I read that constant-competitive was the ratio of the expected time/optimal time. But what does it mean to have a set-competitive?
Tags (comma-separated)
Save Edits
Cancel