Line-by-line breakdowns of the code will teach you how to use algorithms and data structures like:

- The breadth-first search algorithm to find the optimal way to play a board game or find the best way to translate a book;

- Dijkstra's algorithm to determine how many mice can exit a maze or the number of fastest routes between two locations;

- The union-find data structure to answer questions about connections in a social network or determine who are friends or enemies;

- The heap data structure to determine the amount of money given away in a promotion;

- The hash-table data structure to determine whether snowflakes are unique or identify compound words in a dictionary.

NOTE: Each problem in this book is available on a programming-judge website. You'll find the site's URL and problem ID in the description. What's better than a free correctness check?

## Book Details | |

Publisher: | No Starch Press |

By: | Daniel Zingaro |

ISBN-13: | 9781718500808 |

ISBN-10: | 1718500807 |

Year: | 2020 |

Pages: | 408 |

Language: | English |

## Book Preview | |

Online | Algorithmic Thinking |

## Free Download | |

Chapter 1 | Algorithmic Thinking |

## Paper Book | |

Buy: | Algorithmic Thinking |

Reproduction of site books is authorized only for informative purposes and strictly for personal, private use.

**Only Direct Download**

IT eBooks Group**© 2011-2024**

IT eBooks Group