Entertaining algorithms: What are the stories of famous heroes teach us. Ervig M.
Did you always believe that an algorithm is something from the world of untidy hackers, illuminated by screens in the dark rooms clogged with computers? What is something “not from this world”, for an ordinary person, which is beyond understanding? You are unforgivably mistaken. This is probably one of the greatest misconceptions of our time - especially incomprehensible in the light of the fact that humanity has long and thoroughly familiar with algorithms. After reading the book, you will see this. The book uses an unusual approach to the presentation of algorithms - using literary works and films. Have you ever thought that Genzel and Gretel, returning home on a chain of pebbles, use a simple algorithm with linear work time? That Sherlock Holmes, investigating the next business, is dealing with data structures - a list of suspects, a pedigree tree, a queue with the priorities of the heirs of the victim? What Indiana Jones has repeatedly had to deal with sorting and search? What the events in the film "Surrok Day" are essentially a cycle, and in the film "Back to the Future" - a recursion? Here is a book on the basics of computer science and algorithms - but a book in which such literary works and films are used to illustrate certain concepts, which makes the already fascinating theme of computer science, algorithms and calculations even more interesting and fascinating. < /p>
| Characteristics | |
| A country | Russia |
| Age | From 12 years old |
| Author | Erwig Martin |
| Editor | Krasikov I.V.V. |
| Number of pages | 352 |
| The theme of the encyclopedia | Story |
| The year of publishing | 2019 |
| Translator | Bernstein I. |
| Type of cover | Soft binding |
There are no reviews for this product.