Caitlin Wilson

15%
Flag icon
if you want to group n items into m buckets, the grouping can be done in O(nm) time—that is, the time is simply proportional to the number of items times the number of buckets. And as long as the number of buckets is relatively small compared to the number of items, Big-O notation will round that to O(n), or linear time.
Algorithms to Live By: The Computer Science of Human Decisions
Rate this book
Clear rating
Open Preview