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.
I’m looking for Big O notation – avereage , for only the access of one element. Here is what I have so far. Once again that is Big O, Average, Access. Actually I only need it for a Searchable Red and Black Tree and a simple Modulus Hash.
Arrays – O(1)
Linked Lists – O(X)
Trees(defined above) – ?
Hashes(defined above) – ?
Tree = O(log n)
Hashtable = O(1)