CSS 341  Lab #6 Sorting and Searching 
Due Thursday, March 9 

You will sort and search for grades given names. This is very similar to
the sample code "linearSearch.vbs" but you will use an insertion sort
to sort the names and then a binary search to locate a name so you can
obtain the grade.

Use the file lab6.vbs which currently simply reads the names and grades into
arrays and uses a linear search to find a name. Notice that I have hardcoded
in the filenames, so when it is run, a file won't have to be chosen to open.
The .txt files named names.txt and grades.txt must be in the same folder
as your program.

Recall the algorithm to insert one name into a sorted array from lecture:

   copy the target name into another variable 
   loop from the end of the sorted part of the array down to beginning
       if (target name < loop index name)
           copy loop index name down (and associated grade)
       else
           found right place, exit the loop in this case (hint -- boolean)
       end if
   end the loop
   now that you've made room, insert target name into correct sorted position

The target name is the first name that is not sorted. For example, if count
is four, meaning that four names are sorted, then the target name is in
subscript four (the fifth actual name).