Grokking Algorithms

Więcej o książce

This fully-illustrated introduction covers essential computer programming algorithms, preparing you for common interview questions and daily applications. The book simplifies complex topics, making it accessible without dense proofs. You’ll explore search, sort, and graph algorithms, along with data structures like arrays, lists, hash tables, trees, and graphs. It also addresses NP complete and greedy algorithms, highlighting performance trade-offs. Each chapter includes exercises and code samples, complemented by over 400 illustrations for clarity. The first edition successfully engaged over 100,000 readers, and this revised edition features updated content on trees, NP complete problems, and Python 3 code. With friendly explanations, clever examples, and skill-building exercises, learning these algorithms becomes enjoyable. Starting with basic tasks like sorting and searching, you’ll progress to advanced topics such as data compression and artificial intelligence. The new coverage includes binary search trees, balanced trees, and B-trees, along with insights on data structure performance relevant to modern CPUs. By the end, you’ll have mastered widely applicable algorithms and be well-prepared for job interviews. This book is ideal for self-taught programmers, engineers, job seekers, or anyone looking to enhance their algorithm knowledge. The author, Aditya Bhargava, is a Software Engineer with a background in Computer Sc