Jump to content

Aremu B Introduction to Algorithms and Data Structures 2 2023 [PDF]-[En]


Recommended Posts


9qc0ifs2c2zq.jpg




Introduction to Algorithms and Data Structures 1 | 50 | Bolakale Aremu | 2016 | ‎ Manning; First Edition | ‎ 978-1617292231

Summary

Grokking 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.

Continue your journey into the world of algorithms with Algorithms in Motion , a practical, hands-on video course available exclusively at Manning.com (www.manning.com/livevideo/algorithms-in-motion).

Purchase of the print book includes a free eBook in PDF, Kindle, and ePub formats from Manning Publications.

About the Technology

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.

About the Book

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.

What's Inside

Covers search, sort, and graph algorithms
Over 400 pictures with detailed walkthroughs
Performance trade-offs between algorithms
Python-based code samples

About the Reader

This easy-to-read, picture-heavy introduction is suitable for self-taught programmers, engineers, or anyone who wants to brush up on algorithms.

About the Author

Aditya Bhargava is a Software Engineer with a dual background in Computer Science and Fine Arts. He blogs on programming at
https://adit.io.
.

Table of Contents

Introduction to algorithms
Selection sort
Recursion
Quicksort
Hash tables
Breadth-first search
Dijkstra's algorithm
Greedy algorithms
Dynamic programming
K-nearest neighbors.

Files:
Aremu B. Introduction to Algorithms & Data Structures 2. 2023.pdf (1.52 MB)

Aremu B. Introduction to Algorithms and Data Structures 1. 2023.pdf (1.7 MB)

NitroFlare Link(s)
https://nitroflare.com/view/8EDB9F4E81F18BC/Aremu_B._Introduction_to_Algorithms_and_Data_Structures_2._2023.rar

RapidGator Link(s)
https://rapidgator.net/file/9c8e962652d6f06ff160a4432415cb5d/Aremu_B._Introduction_to_Algorithms_and_Data_Structures_2._2023.rar


Link to comment
Share on other sites

Create an account or sign in to comment

You need to be a member in order to leave a comment

Create an account

Sign up for a new account in our community. It's easy!

Register a new account

Sign in

Already have an account? Sign in here.

Sign In Now
×
×
  • Create New...