What do you think?
Rate this book
Εννέα αλγόριθμοι που άλλαξαν το μέλλον
Κάθε μέρα, πραγματοποιούμε σπουδαία κατορθώματα χρησιμοποιώντας τους υπολογιστές μας. Όταν «ανεβάζουμε» μια φωτογραφία στο Facebook μεταβιβάζονται εκατομμύρια στοιχεία πληροφορίας μέσω πολλών διαδικτυακών συνδέσμων που είναι επιρρεπείς σε σφάλματα• ωστόσο, τελικά ένα άψογο αντίγραφο της φωτογραφίας φτάνει στον προορισμό του. Χωρίς καν να το γνωρίζουμε, εφαρμόζουμε κρυπτογράφηση δημόσιου κλειδιού για να μεταβιβάσουμε απόρρητες πληροφορίες, όπως αριθμούς πιστωτικών καρτών, και χρησιμοποιούμε ψηφιακές υπογραφές για να επαληθεύσουμε την ταυτότητα των ιστοτόπων που επισκεπτόμαστε. Πώς άραγε εκτελούν οι υπολογιστές μας αυτές τις εργασίες με τόση ευκολία; Αυτό είναι το πρώτο βιβλίο που απαντά στο παραπάνω ερώτημα σε γλώσσα που μπορούν να την καταλάβουν όλοι, αποκαλύπτοντας τις εκπληκτικές ιδέες που αποτελούν την κινητήρια δύναμη των προσωπικών υπολογιστών, των φορητών υπολογιστών και των έξυπνων κινητών μας. Χρησιμοποιώντας παραστατικά παραδείγματα, ο John MacCormick εξηγεί τα βασικά «τεχνάσματα» που χρησιμοποιούν εννέα τύποι υπολογιστικών αλγορίθμων. Οι επαναστατικοί αυτοί αλγόριθμοι έχουν αλλάξει τον κόσμο μας: το βιβλίο αυτό ξεκλειδώνει τα μυστικά τους, και αποκαλύπτει τις εκπληκτικές ιδέες που χρησιμοποιούν οι υπολογιστές μας κάθε μέρα.
264 pages, Paperback
First published January 1, 2012
257 people are currently reading
3288 people want to read
Ratings & Reviews
Friends & Following
Create a free account to discover what your friends think of this book!
Community Reviews
Displaying 1 - 30 of 162 reviews
June 24, 2013
Physicist Richard Feynman remarked about scientists that if you can't explain what you are doing to your grandmother, then you don't understand what you are doing. That's from the guy who made common sense out of quantum electrodynamics (QED).
The sorry fact of the matter is that science relies upon obscure vocabulary, technical jargon and a maze of self-reference, a practice that holds the curious public at a comfortable two-arms-length distance. Important information is certainly conveyed through that technical mess, for sure, but important interests are protected from general scrutiny just as surely.
John MacCormick's "9 Algorithms That Changed the Future" has done for a handful of computer algorithms what Feynman did for QED. I would add two caveats to that statement, though. First, these 9 algorithms are profoundly more relevant to the everyday lives of virtually everyone using a computer. They are, in fact, what make modern computing possible. We use these algorithms with every search, email and internet transaction. Second, these algorithms are accessible to a popular understanding in a way that QED will, I doubt, ever be, even in hands of a genius like Feynman.
The only way to make complex topics accessible to a general audience is through the skillful us of analogy, and here is MacCormick's talent. For example, sending encrypted messages between two computers (such as we do each time we make an online purchase) is analogous to the problem of having to share a secret between two people at opposite ends of a crowded room when information can only be yelled from one end of the room to the other, in full earshot of everyone present. This is the task of computers trading your credit card number, for example. MacCormick makes this complicated task - the algorithm that accomplishes this seemingly impossible obstacle - easily evident by using yet another analogy, one related to the solution instead of the problem, one involving buckets of paint.
I'll not go into the details of that analogy. Readers can check out chapter 4 of MacCormick's book.
He distills a broad set of computer tricks down to a set of analogies that I think are accessible to anyone. However, this book is not all analogy. There are several cases where he is simply telling the reader how something happens, but he makes it unintimidating. Consider error correction, for example, that beautiful algorithmic trick that lets us transmit a file with millions of bits of data without a single little smidgeon arriving out of place. Without it we could not rely on the integrity of a single communication we make. With it, we generally have no idea it is there, hovering over every puff of transmission we send and receive, checking every bit twice to be sure the noise in the line doesn't degrade our eloquence and attention to detail.
MacCormick has done two groups of people a favor. The first and largest is the computer using public. I have long lamented that I am, almost universally, strictly a user of modern technology. If I were transported back in time 100,000 years with nothing but my current knowledge, I don't know that I know much that would advance the technology or civilization of people of that time. I could not, for example, demonstrate how to generate electricity, build a combustion engine (I certainly have no idea how to forge metal), or even get water out of a well with anything other than buckets. While this book doesn't allow me to instruct neanderthals about error correction in digital communications, it does, at least, let me see behind the curtain a bit and have a sense that I understand how this seeming miracle actually works. I am morphed from a passive user to an active one, if only in a trivial sense.
The second group that benefits from MacCormick's book is that of computer scientists, as well as the mathematicians and programmers that largely round out the technical aspects of computer program architecture. This book makes at least these few algorighms accessible. At the same time, the book inspires a sense of admiration for the brilliance behind the tricks and manipulations that make our computers do what they do.
MacCormick has done an admirable job. I recommend this book to anyone with a curiosity about how computers, and more specifically computers in communication, do what they do.
The sorry fact of the matter is that science relies upon obscure vocabulary, technical jargon and a maze of self-reference, a practice that holds the curious public at a comfortable two-arms-length distance. Important information is certainly conveyed through that technical mess, for sure, but important interests are protected from general scrutiny just as surely.
John MacCormick's "9 Algorithms That Changed the Future" has done for a handful of computer algorithms what Feynman did for QED. I would add two caveats to that statement, though. First, these 9 algorithms are profoundly more relevant to the everyday lives of virtually everyone using a computer. They are, in fact, what make modern computing possible. We use these algorithms with every search, email and internet transaction. Second, these algorithms are accessible to a popular understanding in a way that QED will, I doubt, ever be, even in hands of a genius like Feynman.
The only way to make complex topics accessible to a general audience is through the skillful us of analogy, and here is MacCormick's talent. For example, sending encrypted messages between two computers (such as we do each time we make an online purchase) is analogous to the problem of having to share a secret between two people at opposite ends of a crowded room when information can only be yelled from one end of the room to the other, in full earshot of everyone present. This is the task of computers trading your credit card number, for example. MacCormick makes this complicated task - the algorithm that accomplishes this seemingly impossible obstacle - easily evident by using yet another analogy, one related to the solution instead of the problem, one involving buckets of paint.
I'll not go into the details of that analogy. Readers can check out chapter 4 of MacCormick's book.
He distills a broad set of computer tricks down to a set of analogies that I think are accessible to anyone. However, this book is not all analogy. There are several cases where he is simply telling the reader how something happens, but he makes it unintimidating. Consider error correction, for example, that beautiful algorithmic trick that lets us transmit a file with millions of bits of data without a single little smidgeon arriving out of place. Without it we could not rely on the integrity of a single communication we make. With it, we generally have no idea it is there, hovering over every puff of transmission we send and receive, checking every bit twice to be sure the noise in the line doesn't degrade our eloquence and attention to detail.
MacCormick has done two groups of people a favor. The first and largest is the computer using public. I have long lamented that I am, almost universally, strictly a user of modern technology. If I were transported back in time 100,000 years with nothing but my current knowledge, I don't know that I know much that would advance the technology or civilization of people of that time. I could not, for example, demonstrate how to generate electricity, build a combustion engine (I certainly have no idea how to forge metal), or even get water out of a well with anything other than buckets. While this book doesn't allow me to instruct neanderthals about error correction in digital communications, it does, at least, let me see behind the curtain a bit and have a sense that I understand how this seeming miracle actually works. I am morphed from a passive user to an active one, if only in a trivial sense.
The second group that benefits from MacCormick's book is that of computer scientists, as well as the mathematicians and programmers that largely round out the technical aspects of computer program architecture. This book makes at least these few algorighms accessible. At the same time, the book inspires a sense of admiration for the brilliance behind the tricks and manipulations that make our computers do what they do.
MacCormick has done an admirable job. I recommend this book to anyone with a curiosity about how computers, and more specifically computers in communication, do what they do.
September 20, 2019
I should have read this book at the beginning of my career. On the other hand, after 10 years experience I may appreciate it even more.
August 31, 2012
A surprisingly interesting and simple read (though perhaps overly simple in many parts) on some of the most important computer algorithms used today and how computer scientists solved for them. The writing is better than you would expect, the concepts are interesting (how google developed search algorithms, how secure transactions are run online, etc.), and the details are explained in a way so that no prior knowledge of algorithms or computer programming is necessary.
The only thing some readers may find annoying is that the author really dumbs down the math (almost insulting so, and to like a first grade level in parts), but to be honest, the fact that he made things so granular and simple shows that he really thought about explaining the algorithms in their most basic form to give a clear understanding.
This book is not written for computer scientists, but for regular people who just have a passing interest in how some of the most important algorithms work and how they came to be. It's a good breezy-ish read.
The only thing some readers may find annoying is that the author really dumbs down the math (almost insulting so, and to like a first grade level in parts), but to be honest, the fact that he made things so granular and simple shows that he really thought about explaining the algorithms in their most basic form to give a clear understanding.
This book is not written for computer scientists, but for regular people who just have a passing interest in how some of the most important algorithms work and how they came to be. It's a good breezy-ish read.
April 23, 2022
Nice insight into some of the programming concepts and tricks that sustain our information society.
July 6, 2012
I like the premise of this book: Describe the key algorithms that make everyday computing possible in a simple accessible manner. Some of these algorithms include, indexing and pagerank which govern how search engines work, compression algorithms like JPEG which shrink the size of files, public key encryption which is the foundation for secure internet commerce and digital signatures, among others. I believe the author achieves his stated purpose which is to relate these beautiful and critical algorithms in a way that the general public can appreciate, much the same way you can appreciate stargazing more completely by learning a little astronomy. The book is written at a very basic level however so my guess is that anyone with an undergrad education in the physical sciences or engineering and some computing experience will find it too elementary as I did. For example at one point the author explains what exponentiation is. I was able to skim through large sections of elementary discussions very quickly so the book did not take long to read. I found the final chapter on the limits of computability and the halting problem the most interesting. I would love to see a sequel that went into much more detail on some of these algorithms. I’d also like some insight into how they are implemented in large-scale systems. Its one thing to understand how indexing and pagerank work but how do you then use it to service millions or billions of requests every second? One important point that the author makes is that Computer Science is not equivalent, as many people believe, to programming. This is an important distinction that many overlook. Historically, computer science descends from mathematics and the study of algorithms and computability is very different from actual programming. You might think of computer scientists as architects and programmers as builders. A good architect should probably understand building practices well to inform his or her designs. Overall the book achieved the goals set out by the author and I think it would be a very interesting book for a high school student, college freshman or sophomore interested in computer science as a profession.
May 12, 2014
Enjoyed this very much. It is utterly enthralling, clearly written, and beautifully typeset. I think that, if people were exposed to this sort of technical clarity in concept early enough, we may have more interest in science and technology than we do in the U.S. currently (lack of interest does not seem to be much of a problem in parts of India, by contrast).
I am more familiar than I realized with the contents (at least in the first chapter), so there is not yet much "new" to me - but I've been making software for a long time (17 years) and I'm not the target audience for this book. Besides, the best thing to do in these cases is to use subject familiarity as an opportunity to focus on how the author manages to explain technical concepts so simply and beautifully. I am learning as much from the author's style as the content.
Exceptional book.
I am more familiar than I realized with the contents (at least in the first chapter), so there is not yet much "new" to me - but I've been making software for a long time (17 years) and I'm not the target audience for this book. Besides, the best thing to do in these cases is to use subject familiarity as an opportunity to focus on how the author manages to explain technical concepts so simply and beautifully. I am learning as much from the author's style as the content.
Exceptional book.
June 2, 2015
This book is actually not really targeted to computer scientists like me, since I knew 8 of the 9 algorithms described in the book (Internet searches and indices was the exception). However, it did remind me a bit of my college days. Instead, this book is targeted to people who aren't computer scientists and want to get a feel for what computer scientists think about and what they do. To that end, it's difficult to say how successful it is since I don't know how well it introduces the nine ideas to someone unfamiliar with them. My feeling is that it's a bit too much like a textbook for those who aren't familiar with computer science, and to informal to be useful to those who are. I'll pass it to my father and see what he thinks; if he gets a lot out of it then it's probably quite good. Maybe he'll even understand ME better ;)
August 10, 2021
This is a great general introduction to some algorithms that are used every day. As a computer Scientist I have been exposed to the content already, but I still highly appreciated the way it was explained and compressed into short introductions. It is often very difficult to communicate (maybe I should just stop the sentence here) technical content, but I think MacCormick succeeds very well. I always recommend good short books like this, and I wouldn't mind if he had included a few more chapters.
February 8, 2013
Review of John MacCormick, “9 Algorithms that Changed the Future,” Princeton University Press, 2012.
An algorithm is a well defined procedure for performing a task. A household example of an algorithm is a recipe — for example, the list of ingredients together with the sequence of instructions needed to bake a pie. In order for a computer to perform a task, it needs ingredients — the data — and instructions — the algorithm.
Author John MacCormick, currently Professor of Computer Science at Dickinson College, has chosen nine important tasks performed by computers and explained the algorithms that are used. In a chapter devoted to each, he explains:
• The development of search engines — how to find information on the internet.
• The PageRank process used by Google to produce highly relevant search results.
• Public-key cryptography, enabling secure transmission of secret messages — such as your credit card number — over open communication channels.
• Methods for detecting errors in data transmission and automatically correcting them.
• Several pattern recognition techniques, illustrated by classifying handwritten numbers, facial recognition, and decision trees.
• Data compression. Storing text, music, and images efficiently.
• Databases. Storing and retrieving information efficiently. Techniques for modifying databases reliably, even when computers crash while the modification is in progress.
• Digital signatures. How to be certain data is trustworthy.
• Deciding what is computable.
Even though the techniques that enable these algorithms are complex, Dr. MacCormick explains them in a clear and interesting manner using well constructed examples.
I highly recommend this book for a fascinating and easily accessible look at the core of computer science and its application to everyday lives.
An algorithm is a well defined procedure for performing a task. A household example of an algorithm is a recipe — for example, the list of ingredients together with the sequence of instructions needed to bake a pie. In order for a computer to perform a task, it needs ingredients — the data — and instructions — the algorithm.
Author John MacCormick, currently Professor of Computer Science at Dickinson College, has chosen nine important tasks performed by computers and explained the algorithms that are used. In a chapter devoted to each, he explains:
• The development of search engines — how to find information on the internet.
• The PageRank process used by Google to produce highly relevant search results.
• Public-key cryptography, enabling secure transmission of secret messages — such as your credit card number — over open communication channels.
• Methods for detecting errors in data transmission and automatically correcting them.
• Several pattern recognition techniques, illustrated by classifying handwritten numbers, facial recognition, and decision trees.
• Data compression. Storing text, music, and images efficiently.
• Databases. Storing and retrieving information efficiently. Techniques for modifying databases reliably, even when computers crash while the modification is in progress.
• Digital signatures. How to be certain data is trustworthy.
• Deciding what is computable.
Even though the techniques that enable these algorithms are complex, Dr. MacCormick explains them in a clear and interesting manner using well constructed examples.
I highly recommend this book for a fascinating and easily accessible look at the core of computer science and its application to everyday lives.
December 16, 2023
4.25 🌟// It was pretty interesting. I really enjoyed reading about public key cryptography and neural networks (antonia I finally get it). I do think some chapters in the book were unnecessary though - the chapter about data compression was super boring and not very innovative to learn about. Also, the book simplified concepts A LOT, which was nice if I was confused about something (and anybody who doesn’t do CS can understand very easily), but also very slow and boring for some topics.
July 26, 2022
An interesting look at computer language and generally how computers work. It does a good job of introducing quite a few concepts but the explanations are lacking and his metaphors are slightly misleading.
March 23, 2013
3 ragioni per leggerlo
Se pensando al termine “informatica” vi vengono in mente solo aggeggi che fanno bip bip bip o programmi misteriosi che hanno la tendenza a non funzionare proprio quando servono vi state perdendo tantissimo. Potreste scoprire che con qualche strumento in più anche l’informatica diventa affascinante «come un cielo stellato davanti agli occhi di un astronomo dilettante».
Il capitolo dedicato al riconoscimento di forme (pattern recognition) va al di là del puro fascino della comprensione di un’idea geniale, aprendo direttamente una finestra sul futuro dell’intelligenza artificiale.
«Il semplice fatto che un problema sia decidibile da un computer non significa che possiamo risolverlo nella pratica.» La risposta potrebbe – per esempio – richiedere milioni di anni. Cosa saranno in grado di fare in futuro le macchine e quali saranno (e perché) gli algoritmi a rimanere efficaci? Se volete capire se corriamo il rischio di doverci mettere a fare i filosofi per ingannare l’attesa mentre il computer elabora un 42, le conclusioni del libro saranno molto utili.
Se pensando al termine “informatica” vi vengono in mente solo aggeggi che fanno bip bip bip o programmi misteriosi che hanno la tendenza a non funzionare proprio quando servono vi state perdendo tantissimo. Potreste scoprire che con qualche strumento in più anche l’informatica diventa affascinante «come un cielo stellato davanti agli occhi di un astronomo dilettante».
Il capitolo dedicato al riconoscimento di forme (pattern recognition) va al di là del puro fascino della comprensione di un’idea geniale, aprendo direttamente una finestra sul futuro dell’intelligenza artificiale.
«Il semplice fatto che un problema sia decidibile da un computer non significa che possiamo risolverlo nella pratica.» La risposta potrebbe – per esempio – richiedere milioni di anni. Cosa saranno in grado di fare in futuro le macchine e quali saranno (e perché) gli algoritmi a rimanere efficaci? Se volete capire se corriamo il rischio di doverci mettere a fare i filosofi per ingannare l’attesa mentre il computer elabora un 42, le conclusioni del libro saranno molto utili.
August 28, 2021
The book contains a lot of introductory information with a non technical intensive approach .
Although in my opinion not all the chapters are equal I found (search engine , page ranking , public keys) chapters to be the most valuable it might be tho just my personal preference . Overall the less of an it guy you are the more recommended this book is .
Although in my opinion not all the chapters are equal I found (search engine , page ranking , public keys) chapters to be the most valuable it might be tho just my personal preference . Overall the less of an it guy you are the more recommended this book is .
January 17, 2014
Too simple, perhaps because I already knew something about the topics. I ended up a little bit annoyed by all the simple examples with colours and padlocks and gave it up. I would recommend it for someone who doesn't know anything about computer algorithms.
January 31, 2018
An accessible, clearly written, and interesting overview of the interesting ideas out there, without getting bogged down in the details of implementation. If you have a more tactical understanding of some of the algorithms described in this book - especially if you've ever had to do the challenging work of implementing any of these ideas in actual code - you may be tempted to write the book off as surface-level or gross oversimplification. But that's the point - any one of these topics could fill an entire library, but the author manages to describe each in about ~20 pages and give some intuition without losing a non-technical reader.
Granted, the book reads a bit like "Computers for Dummies" sometimes - i.e. on page 179, the author explains what a file extension is (lol). But overall the author does a great job of introducing just enough intuition for a given computer science construct that you'd know where to start looking if you wanted to dive deeper, and gives you the sense that you're skimming the surface of a very substantial and interesting iceberg.
A great intro to many diverse corners of computer science, and certainly a book I wish I had found earlier.
Granted, the book reads a bit like "Computers for Dummies" sometimes - i.e. on page 179, the author explains what a file extension is (lol). But overall the author does a great job of introducing just enough intuition for a given computer science construct that you'd know where to start looking if you wanted to dive deeper, and gives you the sense that you're skimming the surface of a very substantial and interesting iceberg.
A great intro to many diverse corners of computer science, and certainly a book I wish I had found earlier.
December 20, 2025
I think this book would be great for someone with little to no familiarity with computer science, but I personally found it to be too repetitive as someone already familiar with the general concepts and several of the algorithms it contained
November 24, 2019
Very good for starter. And best for making you to want more.
October 17, 2015
C'è solo una cosa che non mi è piaciuta di questo libro: gli esempi sono così semplificati che spesso diventa difficile riuscire a capire esattamente qual è la relazione con i sistemi reali. Usare la moltiplicazione anziché l'elevamento a potenza può lasciare perplessi, perché tutti sanno fare le divisioni e non si capisce perché invece il logaritmo discreto sarebbe così difficile da calcolare. Allo stesso modo l'insistenza sui "trucchi" per trovare mi sembra un tentativo di far pensare che l'informatica sia un coacervo di metodi ad hoc. Ma questo probabilmente è un mio problema: il libro non è certo stato scritto per chi come me è nel campo e ha anche una formazione matematica, ma per avvicinare il lettore comune ai concetti informatici. È molto rivelatrice la confessione alla fine del libro, dove McCormick ammette che la sua idea iniziale era di un testo diverso - diviso in due parti, una con gli algoritmi "facili" spiegati e l'altra con una semplice presentazione degli algoritmi "difficili" - ma poi si è accorto che tutti gli algoritmi interessanti erano anche "facili". La traduzione di Virginio B. Sala (nome che nella versione elettronica presa in prestito da MLOL non sono riuscito a trovare indicato, e ciò non è bello) è chiara e corretta.
February 6, 2021
It feels like something is missing in the explanations
In this book, MacCormick tries to do a hard task: explain some very important algorithms in a way anyone can understand. No technical background needed. The author selected nine algorithms by himself, using his own criteria of relevance. As expected, his list is controversial. Being a software engineer, with strong technical background, I consider some explanations provided by the author hard to follow. The author really tried to put the algorithms in simple terms. But, by doing that, some explanations became shallow, incomplete, or confusing. Maybe, my judgement about the book is biased by my technical knowledge. Anyway, if you want to understand a little bit about the algorithms selected by the author and you have no technical background, I think this book is your best choice qnd it is a worth reading.
In this book, MacCormick tries to do a hard task: explain some very important algorithms in a way anyone can understand. No technical background needed. The author selected nine algorithms by himself, using his own criteria of relevance. As expected, his list is controversial. Being a software engineer, with strong technical background, I consider some explanations provided by the author hard to follow. The author really tried to put the algorithms in simple terms. But, by doing that, some explanations became shallow, incomplete, or confusing. Maybe, my judgement about the book is biased by my technical knowledge. Anyway, if you want to understand a little bit about the algorithms selected by the author and you have no technical background, I think this book is your best choice qnd it is a worth reading.
August 25, 2013
Nine Algorithms That Changed the Future (2013) by John MacCormick is a well written good read that looks at exactly what the title suggests. The book covers indexing, pagerank, public key cryptography, error correcting codes, pattern recognition, data compression, database algorithms, digital signatures and also covers computability.
The chapters do involve thought and the book isn’t a completely light read. But it’s well worth it. Along with Patterns in The Stone this is one of the best books I’ve seen that explains computing concepts clearly to people who are not programmers.
The chapters do involve thought and the book isn’t a completely light read. But it’s well worth it. Along with Patterns in The Stone this is one of the best books I’ve seen that explains computing concepts clearly to people who are not programmers.
February 1, 2016
Discuss computer science beyond programming is a great idea. MacCormick even compiled an interesting set of algorithms together with easy to follow explanations. The computability example was fun but the whole book still needs some work on its presentation. I felt a bit annoyed by the constant use of “to keep it simple as possible”; the whole thing should unfold smoothly.
December 26, 2025
Read this book after completing my graduate course in Information Security. Great book on some of the most important algorithms in existence. Lucid analogies helped me understand how they work and why they’re used, though the section on determining computability got a bit convoluted. Overall great read I highly recommend.
November 10, 2013
Best explanation on RSA I've read. Even better than its source material (The Code Book by Simon Singh)
June 4, 2016
Simple and interesting for a casual read. Too trivial for a computer scientist or programmer
May 20, 2025
This book should be a solid 5-stars as it will light up middle and high school readers. Take, for example, the chapter on the question of how computers compress data. MacCormick uses incredibly accessible examples and prose to explain several strategies that might work when the goal is to take something that currently is communicated in (say) 300 characters and instead somehow communicate it in only 280. As he points out, one option is to give up a little information. But the coolest approaches allow you to keep all the details and yet still compress the message. MacCormick demonstrates the various techniques, and the ones he teaches are in fact still used today to compress audio and video. Moreover, he opens the door to even more powerful techniques, all without using complicated math or complicated coding concepts. Teachers in middle and high school can easily read this chapter, pull out the core examples, and have a wonderful lecture/discussion/project for a classroom to pursue. And, maybe best of all, you can do all of this without touching a computer. That is, the ideas in this book are explored through text and simple numeric examples, which means that a classroom exploration can happen that same way. There is no need to code these algorithms. You can understand them and then teach them on a more intuitive level. (Another wonderful chapter is the chapter on error correction, i.e. how computers can detect and then correct a corrupted bit of information buried in a long data stream.) Great book.
May 29, 2020
We tend to take for granted computer and internet technologies that enable us to surf the net, shop and bank online safely and reliably, and run software that does a whole host of tasks. We are so used to things working rather well that we forget - or never knew - what lies beneath in the hidden recesses of computer code.
Mr. MacCormick sets out to change our forgetting or not knowing, and he does a right good job of it. By giving us a brief history and an extended lay-person explanation of a number of algorithms used in the world of computers, he highlights not only the geniuses who developed the algorithms but gives us a good base upon which we can understand how they work - even if you aren't familiar with computers.
Therein lies the genius of this book: even if you don't know anything about computers or complex math you should come away with a pretty good understanding of these algorithms and how important they are in computing.
The only downside to this book is that sometimes the explanations get tedious. Not because they are hard to understand but because they sometimes are over-explained ad naseum and we lose the point or just become a little numb.
That said, this is a fascinating account of the history of and science behind some major computer technologies.
Mr. MacCormick sets out to change our forgetting or not knowing, and he does a right good job of it. By giving us a brief history and an extended lay-person explanation of a number of algorithms used in the world of computers, he highlights not only the geniuses who developed the algorithms but gives us a good base upon which we can understand how they work - even if you aren't familiar with computers.
Therein lies the genius of this book: even if you don't know anything about computers or complex math you should come away with a pretty good understanding of these algorithms and how important they are in computing.
The only downside to this book is that sometimes the explanations get tedious. Not because they are hard to understand but because they sometimes are over-explained ad naseum and we lose the point or just become a little numb.
That said, this is a fascinating account of the history of and science behind some major computer technologies.
August 22, 2017
I got this ebook in Chinese for some time already, but i hesitated to read it because it's about computer science. It turned out to be actually very interesting about how the search engine works.
With his very easy examples and explanations, i get to understand "public key cryptography", "pageRank", "hamming code", "two dimensional parity", "low density parity- check code", "nearest -neighbor classifier", " decision tree", "artificial neural network".
For how the zip files work, "same as earlier trick" (ex, Ab1c250 means A repeats 251 times: b= back, c= copy), "shorter-symbol trick ( e=8, t=9, these 2 most used alphabets.)"
I think algorithm is an absolute logical language, it can also help your brain to think more logically. I like it, but i guess i won't be able to dip too deep due to my limited computer knowledge.
With his very easy examples and explanations, i get to understand "public key cryptography", "pageRank", "hamming code", "two dimensional parity", "low density parity- check code", "nearest -neighbor classifier", " decision tree", "artificial neural network".
For how the zip files work, "same as earlier trick" (ex, Ab1c250 means A repeats 251 times: b= back, c= copy), "shorter-symbol trick ( e=8, t=9, these 2 most used alphabets.)"
I think algorithm is an absolute logical language, it can also help your brain to think more logically. I like it, but i guess i won't be able to dip too deep due to my limited computer knowledge.
October 25, 2018
Bir bilgisayar mühendisliği öğrencisi olarak, kitabı fazla basit anlatımlı buldum ama zaten kitabın amacı da bu. Herkesin anlayabileceği şekilde konuları ele almak ve özündeki işleyişi anlatmak. Kitap iyi, sürekleyici bence.
Özellikle sekizinci bölümde bazı imla ve yazım yanlışları var.
Kitapta saçma bulduğum bir olay var. Mesela 120. sayfadaki tabloya göre ya da resme göre diye bir ifade kullanıyor. 120. sayfada ya tablo/resim yok; ya da sözü edilen tablo/resim yok. Birkaç sayfa kaymış oluyor genelde ve bütünlüğü, okuma zevkini bozan bir durum bana göre. Umarım kitabın yeni baskılarında bu durum düzeltilir.
Eskiden Tübitak yayınlarından daha fazla kitap çıkardı ve daha fazla kitap olurdu ama eski kitapların yeni basımları yapılmıyor ve ekledikleri yeni kitaplar genelde çocuklar için oluyor. Umarım bu tarz kitaplar çıkmaya başlar.
İyi kitap, tavsiyedir.
Özellikle sekizinci bölümde bazı imla ve yazım yanlışları var.
Kitapta saçma bulduğum bir olay var. Mesela 120. sayfadaki tabloya göre ya da resme göre diye bir ifade kullanıyor. 120. sayfada ya tablo/resim yok; ya da sözü edilen tablo/resim yok. Birkaç sayfa kaymış oluyor genelde ve bütünlüğü, okuma zevkini bozan bir durum bana göre. Umarım kitabın yeni baskılarında bu durum düzeltilir.
Eskiden Tübitak yayınlarından daha fazla kitap çıkardı ve daha fazla kitap olurdu ama eski kitapların yeni basımları yapılmıyor ve ekledikleri yeni kitaplar genelde çocuklar için oluyor. Umarım bu tarz kitaplar çıkmaya başlar.
İyi kitap, tavsiyedir.
July 18, 2017
Big mistake: I should have bought a paper version of this book and not an electronic.
This is certainly not for everyone but I found it fascinating. I can't say that I understood it all despite being told by the author that I did not need to know the nitty-gritty of computer science. I think he was wrong. You certainly need to have a better knowledge than I had, to appreciate it some of the points he was making and these became more difficult as the book reached its conclusion. It would have been far better to have read a paper version as it is imperative to be able to look back at diagrams and charts. However, I am so glad that I read it as it did extend my knowledge or at least about 60% of it did.
This is certainly not for everyone but I found it fascinating. I can't say that I understood it all despite being told by the author that I did not need to know the nitty-gritty of computer science. I think he was wrong. You certainly need to have a better knowledge than I had, to appreciate it some of the points he was making and these became more difficult as the book reached its conclusion. It would have been far better to have read a paper version as it is imperative to be able to look back at diagrams and charts. However, I am so glad that I read it as it did extend my knowledge or at least about 60% of it did.
April 2, 2021
I think I expected a bit more of this book (or of this title). Still a good read, but not particularly mind-boggling. Something didn't click for me in the way the author explains the algorithms - maybe it's the diluting/simplification, maybe the lack of the Math/CS background when presenting them... In the attempt to make the topics accessible, they became confusing/boring/simplistic. Many people love this book, though, so maybe it's just me, or maybe it has an opposite effect if you DO happen to have a CS background. The algorithms themes covered are:
Search engine indexing
PageRank
Public-key cryptography
Forward error correction
Pattern recognition
Data compression
Database
Digital signature
Search engine indexing
PageRank
Public-key cryptography
Forward error correction
Pattern recognition
Data compression
Database
Digital signature
Displaying 1 - 30 of 162 reviews