hash access time is best time O(1) and worst case O(n). I am wondering what’s the average case?
Share
Sign Up to our social questions and Answers Engine to ask questions, answer people’s questions, and connect with other people.
Login to our social questions & Answers Engine to ask questions answer people’s questions & connect with other people.
Lost your password? Please enter your email address. You will receive a link and will create a new password via email.
Please briefly explain why you feel this question should be reported.
Please briefly explain why you feel this answer should be reported.
Please briefly explain why you feel this user should be reported.
hash access time is best time O(1) and worst case O(n). I am wondering what’s the average case?
For a hash that isn’t nearing full the average case is roughly O(1). The details depend a bit on how collisions are resolved and how full the hash is. Usually efficiency starts really decreasing around 80% capacity.