Search Comparisons Write a program to find the number of comparisons using the b

Question

Search Comparisons

Write a program to find the number of comparisons using the binary search and sequential search algorithms as follows:Suppose list is an array of 1000 elements.

a. Use a random number generator to fill list.

b. Use any sorting algorithm to sort list. Alternatively, you can use the function insertOrd to initially insert all the elements in the list.

c. Search the list for some items, as follows:

I. Use the binary search algorithm to search the list. (You might need to modify the algorithm given in this chapter to count the number of comparisons.)

II. Use the binary search algorithm to search the list, switching to a sequential search when the size of the search list reduces to less than 15. (Use the sequential search algorithm for a sorted list.)

III. Use the sequential search algorithm to search the list

d. Print the number of comparisons for Steps c.i, c.ii, and c.iii. If the item is found in the list, then print its position.

Explanation / Answer

Computer Science textbook solutions, expertanswers, definitions and more....Searchor Ask a newquestion.WithaHomework HelpMembership you get:...A memory is 32-bit and has a totalnumberof 10^6 addressed....Artificial Neural Network

Related Questions

Navigate

• Browse (All)
• Browse S
• Subjects

Integrity-first tutoring: explanations and feedback only — we do not complete graded work. Learn more.