Data Structures and Algorithms in Python.pdf下载

weixin_39820780 2020-07-05 09:01:07

这是一本基于python的数据结构与算法教程（英文版），python入门中级读物。
相关下载链接：//download.csdn.net/download/weixin_44673658/11286683?utm_source=bbsseo

...全文

106 回复打赏收藏转发到动态举报

写回复

用AI写文章

切换为时间正序

请发表友善的回复…

发表回复

英文原版书名：Data Structures and Algorithms Using Python 作者：Rance D. Necaise Department of Computer Science College of William and Mary

Python Data Structures and Algorithms by Benjamin Baka English | 30 May 2017 | ASIN: B01IF7NLM8 | 310 Pages | AZW3 | 6.63 MB Key Features A step by step guide, which will provide you with a thorough discussion on the analysis and design of fundamental Python data structures. Get a better understanding of advanced Python concepts such as big-o notation, dynamic programming, and functional data structures. Explore illustrations to present data structures and algorithms, as well as their analysis, in a clear, visual manner. Book Description Data structures allow you to organize data in a particular way efficiently. They are critical to any problem, provide a complete solution, and act like reusable code. In this book, you will learn the essential Python data structures and the most common algorithms. With this easy-to-read book, you will be able to understand the power of linked lists, double linked lists, and circular linked lists. You will be able to create complex data structures such as graphs, stacks and queues. We will explore the application of binary searches and binary search trees. You will learn the common techniques and structures used in tasks such as preprocessing, modeling, and transforming data. We will also discuss how to organize your code in a manageable, consistent, and extendable way. The book will explore in detail sorting algorithms such as bubble sort, selection sort, insertion sort, and merge sort. By the end of the book, you will learn how to build components that are easy to understand, debug, and use in different applications. What you will learn Gain a solid understanding of Python data structures. Build sophisticated data applications. Understand the common programming patterns and algorithms used in Python data science. Write efficient robust code. About the Author Benjamin Baka works as a software developer and has over 10 years, experience in programming. He is a graduate of Kwame Nkrumah University of Science and Technology and a member of the Linux Accra User Group. Notable in his language toolset are C, C++, Java, Python, and Ruby. He has a huge interest in algorithms and finds them a good intellectual exercise. He is a technology strategist and software engineer at mPedigree Network, weaving together a dizzying array of technologies in combating counterfeiting activities, empowering consumers in Ghana, Nigeria, and Kenya to name a few. In his spare time, he enjoys playing the bass guitar and listening to silence. You can find him on his blog. Table of Contents Python objects, types and expressions Python data types and structures Principles of data structure design Lists and pointer structures Stacks and Queues Trees Hashing and symbol tables Graphs and other algorithms Searching Sorting Selction Algorithms Design Ttechniques and Sstrategies Implementations, applications and tools

《数据结构实战完全手册》主讲：丁宋涛数据结构是程序设计的必修知识，它是程序设计的基本功，并且在企业... 德国）和科学出版社联合出版对应英文版《Data Structures and Algorithms Analysis – New Perspectives》

This book is based upon the book Data Structures and Algorithms in Java by Goodrich and Tamassia, and the related Data Structures and Algorithms in C++ by Goodrich, Tamassia, and Mount. However, this book is not simply a translation of those other books to Python. In adapting the material for this book, we have significantly redesigned the organization and content of the book as follows: • The code base has been entirely redesigned to take advantage of the features of Python, such as use of generators for iterating elements of a collection. • Many algorithms that were presented as pseudo-code in the Java and C++ versions are directly presented as complete Python code. • In general, ADTs are defined to have consistent interface with Python’s built- in data types and those in Python’s collections module. • Chapter 5 provides an in-depth exploration of the dynamic array-based un- derpinnings of Python’s built-in list, tuple, and str classes. New Appendix A serves as an additional reference regarding the functionality of the str class. • Over 450 illustrations have been created or revised. • New and revised exercises bring the overall total number to 750.

Problem Solving in Data Structures and Algorithms Using Python 英文无水印pdf epub转pdf版本 pdf所有页面使用FoxitReader和PDF-XChangeViewer测试都可以打开

下载资源悬赏专区

12,887

社区成员

12,439,831

社区内容

发帖

与我相关

我的任务

其他技术论坛（原bbs）

社区管理员

加入社区

近7日
近30日
至今

加载中

查看更多榜单

社区公告

暂无公告

试试用AI创作助手写篇文章吧

+ 用AI写文章