Based on your analysis/ identify the searching type of the code snippet. Then describe the searching best case and worst case. 2.Show and describe 2 statements from the code snippet that it is the searching type based on your answer in (a). 3.The function in the code snippet above is not complete and at least 4 additional statements are needed to complete the code. Show the possible full code for the function and briefly explain any modifications to the code snippet.
1.Based on your analysis/ identify the searching type of the code snippet. Then describe the searching best case and worst case.
2.Show and describe 2 statements from the code snippet that it is the searching type based on your answer in (a).
3.The function in the code snippet above is not complete and at least 4 additional statements are needed to complete the code. Show the possible full code for the function and briefly explain any modifications to the code snippet.
4.The problem of the searching technique indicated in the searchitem function is the complexity in the order of n. Thus,a hash table is used. Let Say if we have eight persons with their IDs need to be stored in the hash table as follows: 147354864,834185952,735489973,135152056,616500306,106500306, 217540406, and 177357855.
4a)Using hash table size of 10, write the hashing function and show the hash table for all the IDs.
4b)There should be a collision in your hash table in (i). Thus, construct a hashing function based on linear probing that will avoid the collision. Then, show the new hash table for all collisions identified in (i) only after the linear probing is executed.
Step by step
Solved in 4 steps with 1 images
