Programming Language: C++

Lab - Searching and Sorting

Objectives:

Use a single dimension array

Use a menu to call various functions

Use multiple sorts and searches

Instructions:

Code a program with functions to search and sort an array, along with a print menu function and a dispatch function. Also set up a 100 position integer array and an integer variable, called size, globally (before all methods are coded).

Then the array and size do not have to be passed to any of these functions. (The alternative approach would be to define the array in the dispatch method after reading in a size. Then array name and size would be passed to all methods.)

The menu should look like the following:

0. Exit

1. Get the size needed for today's use of the array.

2. Fill an array with random numbers from 1-100.

3. Print the array with position numbers.

4. Sort the array in ascending sequence

5. Sort the array in descending sequence - use a different sort algorithm from step 4.

6. Sequential search of the array for a target - target should be passed to method and the method returns the found location or -1.

7. Binary search of the array for a target - target should be passed to method and the method returns the found location or -1. Remember that the array must be sorted before calling the binary search function.

Run:

The program should start with a request for a size from the user. (Type in 15.)

the lab in this order:

Ask the user for the size of the array (1)

Fill the array with random values (2)

Print the array (3) (List the position number and the contents of the array position)

Sequentially search the array for a number in the array and then one not in the array, printing the appropriate messages of "Found in position ____" and "Not Found" (6, 6)

Sort the array into ascending sequence (4)

Print the array (3)

Do a binary search of the array for a number in the array and then for a value not in the array, printing the appropriate messages of "Found in position ____" and "Not Found" (7, 7)

Sort the array into descending sequence (5) (Use a different sort algorithm from code 4)

Finally, print the array again (3)

The main method will look like this: (everything else will be done in other functions)

int main ()

{

printMenu();

cout << "Type in a choice " << endl;

cin >> choice;

while (choice != 0)

{

dispatch (choice); // one big switch statement

printMenu();

cout << "Type in a choice " << endl;

cin >> choice;

}

return 0;

}

For the two search methods (choice 6 and 7), the program must ask for the target and then read in a target before calling the search method. After calling the search method, the program must determine if the search returned an integer (print "Found in position ______") or the search returned a -1 (print "Not Found").

Submission: Turn in your source and output file to D2L in a zipped folder.