How Big is Big? How Fast is Fast? - Franck Leprevost - Bog

This book takes up the challenge to equip first year students in computer science, engineering, life science or mathematics with the algorithmic mindset needed in their studies, and in many aspects of their lives, while assuming almost no prior knowledge in mathematics beyond what is taught at elementary school. Students of other programs, and actually anyone interested in understanding how to think as a problem-solver, will benefit from this tutorial and its extensive list of solved exercises. A problem-solver needs a problem to tackle. Contemporary online banking, secure company and state communication, e-commerce, private communication in today's cyberworld: all crucially rely on prime numbers. But how to check whether a number is prime or not? How to perform this test in a couple of seconds for an integer larger than the number of particles in the observable universe? How to assess the balance between speed and risk? The author uses this problem as a pretext to present in a very clear way some of the most relevant algorithms in the mathematics of computation and in computer science. While literature and pictural art punctuate its chapters, this elegantly written book goes beyond. It guides the novice to assess orders of magnitude, to think algorithmically, and to make sound decisions despite partial information.