A hash system that employs a trie for data storage is full t

A hash system that employs a trie for data storage is full table hashing static hashing logarithmic hashing Extensible hashing Which of the following is the sort with the best average performance but with potentially the worst performance? Heap sort Shuffle short Shell sort Quick sort.

Solution

5.

Extendible hashing :It is one type of a type
of hash system where that uses a trie for bucket lookup.

From the question :

a hash system that employes a trie for data storage is
Extendible hashing .

Option 4 is correct choice.

6.

quick sort is the sort with the best average performance but with potentially the worst performance.

Option 4 is correct choice.