If I have 50,000 entries and, say, 100,000 slots available in a hash table. What would be the best way to choose the appropriate bucket array size for each index if you did not use LinkedLists so that the array never jumps? Would a 30% excess be appropriate?
Some languages support dynamic size for the array (there is no need to declare the size of the array). The data determined the size of the array dynamically. And languages that need size also support dynamic array.
, 50 000, , 50 000 (.. , 1.. 50 000, ).
, O (n) . . , , . , , 90% . .
, , , , .
, . , -.
- , - - (.. , ). , , . , , , .