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.
Must a hash table be implemented using an array? Will an alternative data structure achieve the same efficiency? If yes, why? If no, what condition must the data structure satisfy to ensure the same efficiency as provided by arrays?
No. You could implement the
HashTableinterface with other datastructures besided the arrray. E.g. a Red-Black tree (java’s TreeMap).This offers
O(logN)access time.But
Hash Tableis expected to haveO(1)access time (at best case – no collisions).This can be achieved only via an array which offers the possibility of random access in constant time.
Must have a comparable performance (less than
O(N)) with an array. A treemap hasO(logN)worst access time for all operations