Grokking Algorithms Second Edition
Download Grokking Algorithms Second Edition PDF/ePub or read online books in Mobi eBooks. Click Download or Read Online button to get Grokking Algorithms Second Edition book now. This website allows unlimited access to, at the time of writing, more than 1.5 million titles, including hundreds of thousands of titles in various foreign languages.
Grokking Algorithms, Second Edition
Author: Aditya Y Bhargava
language: en
Publisher: Simon and Schuster
Release Date: 2024-03-26
A friendly, fully-illustrated introduction to the most important computer programming algorithms. Suitable for self-taught programmers, engineers, job seekers, or anyone who wants to brush up on algorithms.
Grokking Algorithms, Second Edition
Author: Aditya Y Bhargava
language: en
Publisher: Simon and Schuster
Release Date: 2024-04-02
A friendly, fully-illustrated introduction to the most important computer programming algorithms. Master the most widely used algorithms and be fully prepared when you’re asked about them at your next job interview. With beautifully simple explanations, over 400 fun illustrations, and dozens of relevant examples, you’ll actually enjoy learning about algorithms with this fun and friendly guide! In Grokking Algorithms, Second Edition you will discover: Search, sort, and graph algorithms Data structures such as arrays, lists, hash tables, trees, and graphs NP-complete and greedy algorithms Performance trade-offs between algorithms Exercises and code samples in every chapter Over 400 illustrations with detailed walkthroughs The first edition of Grokking Algorithms proved to over 100,000 readers that learning algorithms doesn't have to be complicated or boring! This revised second edition contains brand new coverage of trees, including binary search trees, balanced trees, B-trees and more. You’ll also discover fresh insights on data structure performance that takes account of modern CPUs. Plus, the book’s fully annotated code samples have been updated to Python 3. Foreword by Daniel Zingaro. About the technology The algorithms you use most often have already been discovered, tested, and proven. Grokking Algorithms, Second Edition makes it a breeze to learn, understand, and use them. With beautifully simple explanations, over 400 fun illustrations, and dozens of relevant examples, it’s the perfect way to unlock the power of algorithms in your everyday work and prepare for your next coding interview—no math required! About the book Grokking Algorithms, Second Edition teaches you important algorithms to speed up your programs, simplify your code, and solve common programming problems. Start with tasks like sorting and searching, then build your skills to tackle advanced problems like data compression and artificial intelligence. You’ll even learn to compare the performance tradeoffs between algorithms. Plus, this new edition includes fresh coverage of trees, NP-complete problems, and code updates to Python 3. What's inside Search, sort, and graph algorithms Data structures such as arrays, lists, hash tables, trees, and graphs NP-complete and greedy algorithms Exercises and code samples in every chapter About the reader No advanced math or programming skills required. About the author Aditya Bhargava is a Software Engineer with a dual background in Computer Science and Fine Arts. He blogs on programming at adit.io. Table of Contents 1 Introduction to algorithms 2 Selection sort 3 Recursion 4 Quicksort 5 Hash tables 6 Beadth-first search 7 Trees 8 Balanced trees 9 Dijkstra’s algorithm 10 Greedy algorithms 11 Dynamic programming 12 k-nearest neighbors 13 where to go next
How Computers Make Books
Author: John Whitington
language: en
Publisher: Simon and Schuster
Release Date: 2024-06-06
Learn about computer science by exploring the fascinating journey it took to make this book! How Computers Make Books introduces what’s wonderful about computer science by showing how computers have transformed the art of publishing books. Author and publishing software developer John Whitington reveals the elegant computer science solutions invented to solve big publishing challenges. In How Computers Make Books you’ll discover: How human descriptions are translated into computer programs How a computer can understand document formatting How a program decides where to print ink on a page Why computer science is so interesting to computer scientists, and why it might interest you …and much more! How do computers represent all the different languages and letters used by humans? How do we compress a book’s worth of complex information so it can be transferred in seconds? And what exactly is a computer program? This book answers all those questions by telling the story of how it was created! About the technology Computers are part of every step in creating a book, from capturing the author’s words as a digital document to controlling how the ink gets onto the paper. How Computers Make Books introduces basic computer science concepts like file formatting, transfer, and storage, computer programming, and task automation by guiding you through the modern digital printing process. About the book This book takes you on a journey from the plain white page, weaving through typesetting, making gray images from black ink, electronic file formats, and more. It makes computer science come alive as you see how every word, illustration, and page has its own story. You’ll even learn to write your own simple programs and discover hands-on what’s so intoxicating about computer science. What's inside How human descriptions are translated into computer programs How a digital computer thinks about print documents How a program decides where to print ink on a page How the history of typesetting shows up in modern books About the reader For the curious-but-clueless about computer science—and anyone interested in how computers make books! About the author John Whitington is the founder of a company that builds software for electronic document processing. He has studied and taught Computer Science at Queens’ College, Cambridge. Technical editor on this book was Bojan Stojanovic. Table of Contents 1 Putting marks on paper 2 Letter forms 3 Storing words 4 Looking and finding 5 Typing it in 6 Saving space 7 The sums behind the screen 8 Gray areas 9 A typeface 10 Words to paragraphs 11 Out into the world