"Bibliography [29] M. V. Wilkes, D. J. Wheeler and S. Gill. The preparation of programs for an electronic digital computer, with special reference to the EDSAC and the use of a library of subroutines . Addison-Wesley Press, Cambridge, Mass., 1951. [30] United States Government Accountability Office. COLLEGE TEXTBOOKS: Stu- dents have greater access to textbook information (gao-13-368), 2013. [31] Cyril Northcote Parkinson. Parkinson’s Law, or the Pursuit of Progress . John Murray, London, 1958. [32] Richard E. Pattis. Textbook errors in binary searching. In Proceedings of the Nineteenth SIGCSE Technical Symposium on Computer Science Education , SIGCSE ’88, pages 190–194, New York, NY, USA, 1988. ACM. [33] Giuseppe Peano. Studii de Logica Matematica. In Atti della Reale Accademia delle scienze di Torino , volume 32 of Classe di Scienze Fisiche Matematiche e Naturali , pages 565–583. Accademia delle Scienze di Torino, Torino, April 1897. [34] Tim Peters. [Python-Dev] Sorting. Python-Dev mailing list, https://mail.python. org/pipermail/python-dev/2002-July/026837.html , July 2002. [35] Bertrand Russell. The theory of implication. American Journal of Mathematics , 28:159–202, 1906. [36] Bruce A. Tate. Seven Languages in Seven Weeks: A Pragmatic Guide to Learning Programming Languages . Pragmatic Bookshelf, 1st edition, 2010. [37] Alfred North Whitehead and Bertrand Arthur William Russell. Principia mathe- matica; vol. 1 . Cambridge Univ. Press, Cambridge, 1910. [38] J. W. J. Williams. Algorithm 232: Heapsort. Communications of the ACM , 7(6):347– 348, 1964. 613"