To Prepare (in repl.it)

Please do screenshots of the repl.it terminal after using Unix commands to:

• make a directory called Sorting
  
  
• make a directory called Searching
  
  
• move SelSortMain.cpp, SelSort.cpp, and SelSort.h into the Sorting directory
  
  
• move BinMain.cpp, BinSearch.cpp, and BinSearch.h into the Searching directory
  
  
• take a screenshot here
  
  
• change into the Sorting directory and use pwd and ls to show where you are and what files are there
  
  
• change back one directory
  
  
• change into the Searching directory and use pwd and ls to show where you are and what files are there
  
  
• take a screenshot here

You can store your work for this part in the Sorting directory.

Please use the code provided for you in repl.

Your goal here will be to modify the code so that you are sorting in ascending order (smallest to largest) instead of descending order (largest to smallest).

Hint: this will involve only changing one comparison in SelSort.cpp

You can store your work for this part in the Searching directory.

You have been given the code for performing a Binary Search in the repl link provided for this exercise. As a side reference, the code for performing a Sequential Search was also given.

Step 1-Modify the Binary Search

To get a better understanding of how the Binary Search is working, add some statements to the routine. i.e. Make these changes in BinSearch.cpp

• Create a local variable in the BinarySearch function called "loopCtr" and initialize it to 1.
• After the
  difference = intArray[mid] - target; statement, add some cout statements to print some headings and the values of

  Target:   Mid:  Difference:  LoopCtr:  

• After your new cout statements, add these statements:
  printArray(intArray, mid);
  loopCtr++;

Step 2-Compare the Runs

Run the code and search for the first, middle, and last items. Based on your observations, construct the following table in a file and save it to show your lab instructor:

	Sequential	Binary
Is the data sorted? (yes or no)
How many comparisons are made to find the first item (index 0)?
How many comparisons are made to find the middle item (index 49)?
How many comparisons are made to find the last item (index 99)?

Step 3-Challenge Questions

Save these questions and your answers to the same file as above.

Suppose your array contained 1,000,000 elements:

1. For a Sequential Search, how many comparisons would the program need to find the last value in the array?
   
   
2. For a Binary Search, how many comparisons would the program need to find the last value?  
   
   
3. In this case, which do you think will be faster?