A hash table has a size of 11 and data filled in its position like {3,5,7,9,6}how many comparisons have to be made if data is not found in the list in worst case
Answers
Answered by
0
Explanation:
- w eiekdkxljxkyxlyxluxkyzkgxmxlyxlhxhlxlhclhchlxmhxlhclx
- kxkyzlyclucluclxlckgxlxykdyk
Similar questions
Business Studies,
5 months ago
Math,
5 months ago
Hindi,
5 months ago
Environmental Sciences,
9 months ago
Environmental Sciences,
9 months ago
Math,
11 months ago
Social Sciences,
11 months ago