Computer Science, asked by Niraja5430, 9 months ago

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 manavd
0

Explanation:

  • w eiekdkxljxkyxlyxluxkyzkgxmxlyxlhxhlxlhclhchlxmhxlhclx
  • kxkyzlyclucluclxlckgxlxykdyk
Similar questions