Is it possible to use binary search on a table whose size


1. Is it possible to use binary search on a table whose size is prime?

2. Compute the hash code for each of the following symbols by adding up the letters (A = 1, B = 2, etc.) and taking the result modulo the hash table size. The hash table has 19 slots, numbered 0 to 18.

els, jan, jelle, maaike

Does each symbol generate a unique hash value? If not, how can the collision problem be dealt with?

Solution Preview :

Prepared by a verified Expert
Data Structure & Algorithms: Is it possible to use binary search on a table whose size
Reference No:- TGS01154957

Now Priced at $20 (50% Discount)

Recommended (95%)

Rated (4.7/5)