Programming For Big Data [ DvcScheduleV2.cpp and StaticArray.h and/or DynamicArray.h ] Assignment 5 's runtime was too slow -- a couple of minutes or so. It's because of the duplicate-checking, with over 4 billion compares. Rewrite the duplicate-checking logic from Assignment 5, using a technique from "Techniques For Big Data, Reading" to do fewer compares (check the term first then section number for the duplicate check), and come up with the exact same results as Assignment 5 . You may use your StaticArray.h from Assignment 3 and/or your DynamicArray.h from assignments 4 , but you may not use any STL containers. Submit the H file(s) you use in your solution, even if there are no changes since your previous work. Your project will be compiled for grading using the default stack memory size of 1MB. Progress Bar Since this version is supposed to be fast, there is no longer a need for a progress bar. Include one if you wish (you may see the run time dramatically changed), or you may leave it out -- your choice. But if you do have a progress bar, do remember to "flush