- Main
- Computers - Programming
- Learning Algorithms: A Programmer's...
Learning Algorithms: A Programmer's Guide to Writing Better Code
George Heineman你有多喜欢这本书?
下载文件的质量如何?
下载该书,以评价其质量
下载文件的质量如何?
When it comes to writing efficient code, every software professional needs to have an effective working knowledge of algorithms. In this practical book, author George Heineman (Algorithms in a Nutshell) provides concise and informative descriptions of key algorithms that improve coding in multiple languages. Software developers, testers, and maintainers will discover how algorithms solve computational problems creatively.
Each chapter builds on earlier chapters through eye-catching visuals and a steady rollout of essential concepts, including an algorithm analysis to classify the performance of every algorithm presented in the book. At the end of each chapter, you’ll get to apply what you’ve learned to a novel challenge problem—simulating the experience you might find in a technical code interview.
With this book, you will:
• Examine fundamental algorithms central to computer science and software engineering
• Learn common strategies for efficient problem solving—such as divide and conquer, dynamic programming, and greedy approaches
• Analyze code to evaluate time complexity using big O notation
• Use existing Python libraries and data structures to solve problems using algorithms
• Understand the main steps of important algorithms
Each chapter builds on earlier chapters through eye-catching visuals and a steady rollout of essential concepts, including an algorithm analysis to classify the performance of every algorithm presented in the book. At the end of each chapter, you’ll get to apply what you’ve learned to a novel challenge problem—simulating the experience you might find in a technical code interview.
With this book, you will:
• Examine fundamental algorithms central to computer science and software engineering
• Learn common strategies for efficient problem solving—such as divide and conquer, dynamic programming, and greedy approaches
• Analyze code to evaluate time complexity using big O notation
• Use existing Python libraries and data structures to solve problems using algorithms
• Understand the main steps of important algorithms
年:
2021
出版:
1
出版社:
O'Reilly Media
语言:
english
页:
280
ISBN 10:
1492091065
ISBN 13:
9781492091066
文件:
PDF, 11.39 MB
您的标签:
IPFS:
CID , CID Blake2b
english, 2021
在1-5分钟内,文件将被发送到您的电子邮件。
该文件将通过电报信使发送给您。 您最多可能需要 1-5 分钟才能收到它。
注意:确保您已将您的帐户链接到 Z-Library Telegram 机器人。
该文件将发送到您的 Kindle 帐户。 您最多可能需要 1-5 分钟才能收到它。
请注意:您需要验证要发送到Kindle的每本书。检查您的邮箱中是否有来自亚马逊Kindle的验证电子邮件。
正在转换
转换为 失败