Write a C++ program that implements Shaker-Sort on an array of structs that represent
people.

Your program should be able to take the contents of any one of these files
  /home/118/database1.txt
  /home/118/database2.txt
  /home/118/database3.txt
  /home/118/database5.txt
  /home/118/database10.txt
  /home/118/database20.txt
  /home/118/database30.txt
  /home/118/database50.txt
  /home/118/database100.txt
and sort them so that the people appear in alphabetical order of their names.
(Sort primarily on last names. When two people have the same last name, order
them based on their first names. If two people have the same first and last
names, then their ordering doesn't matter)

Time the sorting process, and verify that it is O(N squared).

Turn in your program together with the data and calculations that show that it
is O(N squared).