This code was written to use Python 3.1.
This code doesn't use any third party packages. It does, however, use the defaultdict data type available from the collections package, as well as heapq, datetime and statistics which should all come standard with Python 3.1.
In this coding challenge we developed an algorithm to read in values and create a running medium through a heap algorithm. This is done to decrease the computational time as heap structures are well suited for calculating a medium.
My Repo Structure ├── README.md ├── run.sh ├── src │ └── find_political_donors.py ├── input │ └── itcont.txt ├── output | └── medianvals_by_zip.txt | └── medianvals_by_date.txt ├── insight_testsuite └── run_tests.sh └── tests └── test_1 | ├── input | │ └── itcont.txt | |__ output | │ └── medianvals_by_zip.txt | |__ └── medianvals_by_date.txt