Pages

Monday, November 1, 2010

Time complexity of Hash table

The best time is 0(1), where are the worst case is 0(n). - Due to collisions.
Posted by at

No comments:

Post a Comment

Subscribe to: Post Comments (Atom)