Read in these two files and store their contents in 2 arrays of strings. Do not use a vector.
Sort both arrays using either a selection sort or an insertion sort. Use the same sort routine for sorting both arrays. Do not use the STL sort algorithm or quick sort.
Search the dictionary array for each keyword. If the keyword is not present in the dictionary array, write a message to the output file that the keyword is not found in the dictionary (see sample output below). Count the number of keywords not found. You will print this number at the end of the program. Your search must be a binary search.
Additional Requirements
You must include at least two additional functions:
a sort function
a search function that looks for each keyword in the dictionary array.