/*

CSCI 221 Homework Assignment 7 (Self Assessment. Not to be graded.)

A virus outbroke for 100 days and was quenched. 
CDC (Centers for Disease Control) collected data of cases from each city. 
For example, here are the cases in New York City:  
Day 1, 0 
Day 2, 1 
Day 3, 5 
Day 4, 20 
... 
Day 43, 22000 
Day 44, 22085 (peak) 
Day 45, 21964 
... 
Day 89, 12 
Day 90, 0  
... 
Day 100, 0

In each city, the confirmed cases of infection increases from Day 1 until
reaching a peak on some day, and then starts to decrease. The data for each
city form an array of integers with only one peak, i.e. the virus does not come
back and forth.

How to find the peak day of each city as fast as possible? Refer to zyBook for
Recursive Binary Search. Adapt it to solve the problem fast to avoid searching
the entire array. Implement your idea to java code and test it with sample
data generated by your own.

*/