Skip to main content

Bad Choices - Ali Almossawi ***

At the heart of this little book is a really good concept trying to get out - for me it's what you might call a successful failure. What it's trying to do is great, and being creative about doing so is also great - but creativity goes hand in hand with frequent failure, and I'm afraid there are just too many problems here for me to love this book the way I should.

Let's get the negatives out of the way so we can focus on what's good. It's a very short but expensive book - the 144 small pages have a lot of illustration that conveys very little information. What's left is a text that I comfortably read on an hour-long train ride, yet it's being sold at near £15. The illustrations are genuinely almost all doing nothing at all except adding padding. And though Ali Almossawi's writing style is friendly and laid back, it tends to the condescending. Worst of all, the book doesn't do what it says on the tin.

The subtitle is 'how algorithms can help you think smarter and live happier', implying that this book is going to show you how to make use of algorithms to improve your life. It won't. Almost all the examples it uses (in the form of little stories that try far too hard to be quirky) are totally useless in reality. About the only practically useful one is about sorting books on a shelf (though there is better guidance on that elsewhere - see below). And yet. There is something in this book.

What it really does, if you allow it, is to open up the secrets of what's going on inside a computer - specifically in some of the algorithms used to sort and search, to do lookups with hash tables, to have linked lists that enable you to add items to the middle of an ordered set with a minimum of effort and more. There is definitely a beauty, almost a poetry to this stuff, and Almossawi is usually very good at describing it.

So, it's really not going to do what the cover claims. It won't help you with practical, every day choices and problem solving. If you want a book on practical uses of algorithms in real life, look instead at Algorithms to Live By. And those stories, I'm afraid, for me mostly got in the way rather than made the material more approachable. (Almossawi imagines the reader, when asked 'What's a binary search?' thinking 'Ah, freedom, William Wallace, Eppy Toam*, shirts on a rack.' No, we really won't do that.) But for all that there's a lovely little book on a key aspect of how computers do their jobs lurking in here. I just wish there was more content, and it wasn't so obscured by fluff.

* Yes, his characters really do have names like this.

Hardback:  
Kindle:  
Review by Brian Clegg

Comments

Popular posts from this blog

Astrophysics for People in a Hurry – Neil deGrasse Tyson *****

When I reviewed James Binney’s Astrophysics: A Very Short Introduction earlier this year, I observed that the very word ‘astrophysics’ in a book’s title is liable to deter many readers from buying it. As a former astrophysicist myself, I’ve never really understood why it’s considered such a scary word, but that’s the way it is. So I was pleasantly surprised to learn, from Wikipedia, that this new book by Neil deGrasse Tyson ‘topped The New York Times non-fiction bestseller list for four weeks in the middle of 2017’.

Like James Binney, Tyson is a professional astrophysicist with a string of research papers to his name – but he’s also one of America’s top science popularisers, and that’s the hat he’s wearing in this book. While Binney addresses an already-physics-literate audience, Tyson sets his sights on a much wider readership. It’s actually very brave – and honest – of him to give physics such prominent billing; the book could easily have been given a more reader-friendly title such …

Once upon and Algorithm - Martin Erwig ***

I've been itching to start reading this book for some time, as the premise was so intriguing - to inform the reader about computer science and algorithms using stories as analogies to understand the process.

This is exactly what Martin Erwig does, starting (as the cover suggests) with Hansel and Gretel, and then bringing in Sherlock Holmes (and particularly The Hound of the Baskervilles), Indiana Jones, the song 'Over the Rainbow' (more on that in a moment), Groundhog Day, Back to the Future and Harry Potter.

The idea is to show how some aspect of the story - in the case of Hansel and Gretel, laying a trail of stones/breadcrumbs, then attempting to follow them home - can be seen as a kind of algorithm or computation and gradually adding in computing standards, such as searching, queues and lists, loops, recursion and more.

This really would have been a brilliant book if Erwig had got himself a co-author who knew how to write for the public, but sadly the style is mostly heavy…

Cosmology for the Curious - Delia Perlov and Alex Vilenkin ***

In the recently published The Little Book of Black Holes we saw what I thought was pretty much impossible - a good, next level, general audience science title, spanning the gap between a typical popular science book and an introductory textbook, but very much in the style of popular science. Cosmology for the Curious does something similar, but coming from the other direction. This is an introductory textbook, intended for first year physics students, with familiar textbook features like questions to answer at the end of each chapter. Yet by incorporating some history and context, plus taking a more relaxed style in the writing, it's certainly more approachable than a typical textbook.

The first main section, The Big Bang and the Observable Universe not only covers basic big bang cosmology but fills in the basics of special and general relativity, Hubble's law, dark matter, dark energy and more. We then move onto the more speculative (this is cosmology, after all) aspects, brin…