Write a C++ program to find the number of comparisons using binarySearch and the sequintial search algorithm as follows: Suppose list is an array of 1000 elements. 1.1 Use a random number generator to fill list. 1.2 Use any sorting algorithm to sort the list. 1.3 Search list for some items as follows: a. Use the binary search algorithm to searcg the list. (You may need to modify the algorithm to count the number of comparisons. b. Use the binary search algorithm to search the list, switching to a sequentialsearch when the size of the search list reduces to less than 15. (Use the sequential search algorithm for a sorted list.) Print the number of comparisons for Questions 1.3a and b. If the item is found in the list, then print its position
Write a C++ program to find the number of comparisons using binarySearch and the sequintial search
Suppose list is an array of 1000 elements.
1.1 Use a random number generator to fill list.
1.2 Use any sorting algorithm to sort the list.
1.3 Search list for some items as follows:
a. Use the binary search algorithm to searcg the list. (You may need to modify the algorithm to count the number of comparisons.
b. Use the binary search algorithm to search the list, switching to a sequentialsearch when the size of the search list reduces to less than 15. (Use the sequential search algorithm for a sorted list.)
Print the number of comparisons for Questions 1.3a and b. If the item is found in the list, then print its position.
Trending now
This is a popular solution!
Step by step
Solved in 3 steps with 1 images