Loading...

Grokking Algorithms

Aditya Bhargava

  • Bindwijze: Paperback
  • Taal: en
  • Categorie: Taal
  • ISBN: 9781617292231
An Illustrated Guide for Programmers and Other Curious People
Inhoud
Taal:en
Bindwijze:Paperback
Oorspronkelijke releasedatum:01 juni 2016
Aantal pagina's:256
Illustraties:Nee
Betrokkenen
Hoofdauteur:Aditya Bhargava
Tweede Auteur:Bhargava, Aditya Y
Tweede Auteur:Bhargava, Aditya Y
Overige kenmerken
Editie:Annotated ed
Extra groot lettertype:Nee
Product breedte:150 mm
Product hoogte:22 mm
Product lengte:210 mm
Studieboek:Nee
Verpakking breedte:184 mm
Verpakking hoogte:13 mm
Verpakking lengte:234 mm
Verpakkingsgewicht:466 g
Overige kenmerken
Editie:Annotated ed
Extra groot lettertype:Nee
Product breedte:150 mm
Product hoogte:22 mm
Product lengte:210 mm
Studieboek:Nee
Verpakking breedte:184 mm
Verpakking hoogte:13 mm
Verpakking lengte:234 mm
Verpakkingsgewicht:466 g

Samenvatting

Algorithms nothing more than step-by-step procedures for solving problems and most algorithms used by programmers have already been discovered, tested, and proven. Those wanting to take a hard pass on Knuth's brilliant but impenetrable theories, and the dense multi-page proofs found in most textbooks, will want to read Grokking Algorithms. This fully-illustrated and engaging guide makes it easy to learn how to use algorithms effectively.

Grokking Algorithms is a disarming take on a core computer science topic and shows readers how to apply common algorithms to practical problems faced in the day-to-day life of a programmer. It starts with problems like sorting and searching and builds up skills in thinking algorithmically. Then it tackles more complex concerns such as data compression or artificial intelligence. Whether writing business software, video games, mobile apps, or system utilities, readers will learn algorithmic techniques for solving problems that they thought were out of reach. By the end of this book, they will know some of the most widely applicable algorithms, as well as how and when to use them.