Question

Searching Design an application that has an array of 23 integers. It should call a module (seqSearch) that uses the sequential search algorithm to locate the specified value. The module should keep a count of the number of comparisons it makes until it finds the value and pass that back to the main/calling module. Then the program should call another module (binSearch) that uses the binary search algorithm to locate the same value. It should also keep a count of the number of comparisons it makes and pass that back to the main/calling module. User Inputs 1. 23 integers 2. Integer to search for Processing a. Prompt user for, read in, and store 23 integers in an array b. Prompt user for and read in search value Do not use built-in search functions. Develop them. c. Perform sequential search of the array for search value and count comparisons. d. Perform binary search of the array for search value and count comparisons. Outputs Print the 23 integers entered and the search value. State whether the integer you were searching for was found. Print how many comparisons were required for the sequential search Print how many comparisons were required for the binary search Notes/Hints Always use meaningful variable names. Always print descriptive labels on the outputs

          Searching Design an application that has an array of 23 integers. It should call a module (seqSearch) that
uses the sequential search algorithm to locate the specified value. The module should keep a count of the
number of comparisons it makes until it finds the value and pass that back to the main/calling module.
Then the program should call another module (binSearch) that uses the binary search algorithm to locate
the same value. It should also keep a count of the number of comparisons it makes and pass that back to
the main/calling module.
User Inputs
1. 23 integers
2. Integer to search for
Processing
a. Prompt user for, read in, and store 23 integers in an array
b. Prompt user for and read in search value
Do not use built-in search functions. Develop them.
c. Perform sequential search of the array for search value and count comparisons.
d. Perform binary search of the array for search value and count comparisons.
Outputs
Print the 23 integers entered and the search value.
State whether the integer you were searching for was found.
Print how many comparisons were required for the sequential search
Print how many comparisons were required for the binary search
Notes/Hints
Always use meaningful variable names.
Always print descriptive labels on the outputs

Searching Design an application that has an array of 23 integers. It should call a module (seqSearch) that
uses the sequential search algorithm to locate the specified value. The module should keep a count of the
number of comparisons it makes until it finds the value and pass that back to the main/calling module.
Then the program should call another module (binSearch) that uses the binary search algorithm to locate
the same value. It should also keep a count of the number of comparisons it makes and pass that back to
the main/calling module.
User Inputs
1. 23 integers
2. Integer to search for
Processing
a. Prompt user for, read in, and store 23 integers in an array
b. Prompt user for and read in search value
Do not use built-in search functions. Develop them.
c. Perform sequential search of the array for search value and count comparisons.
d. Perform binary search of the array for search value and count comparisons.
Outputs
Print the 23 integers entered and the search value.
State whether the integer you were searching for was found.
Print how many comparisons were required for the sequential search
Print how many comparisons were required for the binary search
Notes/Hints
Always use meaningful variable names.
Always print descriptive labels on the outputs

Added by Victor H.

Question

Please give Ace some feedback