Free download Algorithms by Jeff Erickson. Published by Independent pub. English | 472 Pages | PDF | ISBN: 9781792644832
Description of Algorithms
They are the machines that proofs build and the music that programs play. Their history is as old as mathematics itself.
This textbook is a wide-ranging, idiosyncratic treatise on the design and analysis of algorithms, covering several fundamental techniques, with an emphasis on intuition and the problem-solving process.
The book includes important classical examples, hundreds of battle-tested exercises, far too many historical digressions, and exaclty four typos.
An algorithm is an explicit, precise, unambiguous, mechanically-executable
sequence of elementary instructions, usually intended to accomplish a specific purpose.
Although both place-value notation and al-Khwarizmi’s works were already
known by some European scholars, the “Hindu-Arabic” numeric system was popularized in Europe by the medieval Italian mathematician and tradesman Leonardo of Pisa, better known as Fibonacci.
Thanks in part to his 1202 book Liber Abaci, 3 written figures began to replace the counting table (then known as an abacus) and finger arithmetic4 as the preferred platform for calculation5 in Europe in the 13th century—not because written decimal figures were easier to learn or use, but because they provided an audit trail.Ciphers became common in Western Europe only with the advent of movable type, and truly ubiquitous only after cheap paper became plentiful in the early 19th century.