Optimizing event selection with the random grid search

Additional comments including restrictions and unusual features: For cases with exceptionally large numbers of events, the program may take several hours to run. However, the system can be trivially parallelized, with no change to the program, by splitting large files into N smaller files and running the same set of cuts over the N files. The counts associated with each cut can then be summed over the N files.