000			03351nam a2200313Ia 4500
001			3390
008			230305s2016 xx 000 0 und d
020			_a9781617292231
040			_cTBS
041			_aeng
043			_aen_UK
245		0	_aGrokking algorithms
260			_aShelter Island, NY _bManning Publications Co., _c2016
300			_axviii, 238 pages : illustrations ; 24 cm
500			_aan illustrated guide for programmers and other curious people
505			_aChapter 1. Introduction to Algorithms _rChapter 2. Selection Sort-- _rChapter 3. Recursion-- _rChapter 4. Quicksort-- _rChapter 5. Hash Tables-- _rChapter 6. Breadth-first Search-- _rChapter 7. Dijkstra's algorithm-- _rChapter 8. Greedy algorithms-- _rChapter 9. Dynamic programming-- _rChapter 10. K-nearest neighbors-- _rChapter 11. Where to go next-- _rAppendix. Answers to Exercises-- _rIndex--
520			_aGrokking Algorithms is a fully illustrated, friendly guide that teaches you how to apply common algorithms to the practical problems you face every day as a programmer. You'll start with sorting and searching and, as you build up your skills in thinking algorithmically, you'll tackle more complex concerns such as data compression and artificial intelligence. Each carefully presented example includes helpful diagrams and fully annotated code samples in Python. Learning about algorithms doesn't have to be boring! Get a sneak peek at the fun, illustrated, and friendly examples you'll find in Grokking Algorithms on Manning Publications' YouTube channel. An algorithm is nothing more than a step-by-step procedure for solving a problem. The algorithms you'll use most often as a programmer have already been discovered, tested, and proven. If you want to understand them but refuse to slog through dense multipage proofs, this is the book for you. This fully illustrated and engaging guide makes it easy to learn how to use the most important algorithms effectively in your own programs. Grokking Algorithms is a friendly take on this core computer science topic. In it, you'll learn how to apply common algorithms to the practical programming problems you face every day. You'll start with tasks like sorting and searching. As you build up your skills, you'll tackle more complex problems like data compression and artificial intelligence. Each carefully presented example includes helpful diagrams and fully annotated code samples in Python. By the end of this book, you will have mastered widely applicable algorithms as well as how and when to use them.
590			_bIncludes index. ; ; This fully-illustrated and engaging guide makes it easy to learn how to use algorithms effectively. The book 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.
630			_aQA MATHEMATICS _92046
650			_aComputer algorithms _913963
650			_aComputer programming _x Handbooks _913964
650			_a manuals _9187
650			_a
700			_aBhargava, Aditya Y. _eAutor
902			_a1651
905			_am
942			_a1 _2ddc
999			_c3225 _d3225