Python Algorithm Design and Analysis

Name: Python Algorithm Design and Analysis
ISBN: 9787115529008

王硕 / 董文馨 / 张舒行 / Zhang Jie / 李秉伦Posts & Telecom Press · ChinaJun 2020

3.9

Word count: 162K words
Chapters: 202
ISBN: 9787115529008

Report an error Find this book

Summary

This book covers algorithm fundamentals, sorting algorithms, search algorithms, two pointers, hashing, depth-first search, breadth-first search, backtracking, dynamic programming, greedy algorithms, divide and conquer, union-find, shortest paths, number-theoretic algorithms, and more.

Editor's review

Python Algorithm Design and Analysis is an introductory yet practical guide to algorithms for Chinese readers, published by People's Posts and Telecommunications Press in 2020. Using Python as the medium, it systematically explains the core content of algorithm design and analysis, spanning from basic data structures to classic algorithms (such as sorting, searching, graph theory, and dynamic programming), and further to algorithm complexity analysis and real-world application cases. The author team consists of university teachers with backgrounds in computer science and education, ensuring a balance between academic rigor and pedagogical suitability.

From an editor's perspective, the book's greatest value lies in its clear logical structure and step-by-step instructional design. Rather than piling up complex code or theoretical proofs, it uses abundant diagrams, stepwise explanations, and everyday analogies to help readers intuitively grasp algorithmic ideas. For example, when explaining dynamic programming, the book not only provides Python implementations of classic problems but also analyzes the thought process of problem decomposition and state transition, which is crucial for cultivating computational thinking.

Compared with similar books, this volume places particular emphasis on the analysis component: each chapter includes discussions of algorithm efficiency and comparative experiments, guiding readers not only to implement algorithms but also to evaluate and choose among them. In addition, interspersed Extension Reading and Application Scenarios sections connect algorithms with frontier fields such as artificial intelligence and data analysis, enhancing the practical relevance of learning.

Overall, this is a textbook-style volume suitable for systematic study, especially for readers who wish to build a solid foundation in algorithms and solve practical problems with Python. Its depth and breadth are pitched at the undergraduate level; the language is plain and the examples are plentiful, but it may not suit readers seeking cutting-edge algorithms or purely theoretical research.

Who it's for

A good fit for

Undergraduate or graduate students in computer-related majors who want to systematically study algorithm design and analysis
Developers who already know basic Python syntax and want to improve their algorithmic skills and programming thinking
Job seekers preparing for algorithm competitions or technical interviews who need to consolidate classic algorithm knowledge
Self-learners interested in algorithms who want to understand computational logic through Python practice

Not a good fit for

Researchers seeking in-depth analysis of advanced or frontier algorithms (such as algorithms specialized for deep learning)
Emergency-oriented programmers who only need to quickly look up algorithm code snippets and do not need theoretical background

Reading tips

Read the chapters in order, focusing on understanding each chapter's principle diagrams and complexity analysis
Practice the complete code examples hands-on, and try modifying parameters or data to observe changes in algorithm behavior
Use the end-of-chapter exercises for self-assessment, especially problems involving algorithm optimization and comparison

About the publisher

Posts & Telecom Press China · Founded in 1953

Posts & Telecom Press is known for its strengths in science and technology, computing, and information and communications titles, and has extended its publishing into photography, art, software learning, and inspirational growth, giving it a fairly diverse range. Its catalog includes computing and communications works such as Refactoring and Patterns (Revised Edition) and Huawei Switch Learning Guide (Second Edition), alongside bilingual collector's editions such as The Little Prince (Chinese-English-French illustrated collector's edition), The Great Gatsby, and Three Days to See. Beijing Ten Years: 1980-1990 and Ghost Blade: WLOP Personal Illustration Collection reflect its presence in photography and art. Its authors include Antoine de Saint-Exupéry, Helen Keller, Joshua Kerievsky, Wang Da, Zhang Zhaozeng, and WLOP.

版权信息
内容提要
前言
第1章算法初步
1.1 什么是算法
1.1.1 算法的定义
1.1.2 算法与程序的区别
1.2 时间复杂度
1.2.1 运行时间和程序复杂程度的关系
1.2.2 时间复杂度是渐进的
1.2.3 简单程序的时间复杂度分析
1.2.4 时间复杂度的意义
1.3 空间复杂度
1.4 算法的应用
1.5 Python算法的优势
1.6 小结
1.7 习题
第2章排序算法
2.1 初级排序算法
2.1.1 插入排序
2.1.2 选择排序
2.1.3 冒泡排序
2.2 高级排序算法
2.2.1 归并排序
2.2.2 快速排序
2.2.3 希尔排序
2.2.4 堆排序
2.2.5 桶排序
2.3 小结
2.4 习题
第3章查找
3.1 顺序查找
3.2 二分查找
3.3 树
3.4 二叉树
3.4.1 二叉树的性质
3.4.2 满二叉树
3.4.3 完全二叉树
3.4.4 创建二叉树
3.4.5 遍历二叉树
3.5 二叉搜索树
3.5.1 二叉搜索树基础
3.5.2 二叉搜索树的操作
3.6 平衡二叉树
3.6.1 二叉搜索树的效率
3.6.2 AVL树
3.7 小结
3.8 习题
第4章双指针问题
4.1 单链表
4.1.1 建立单链表
4.1.2 遍历单链表
4.1.3 插入单链表
4.1.4 删除单链表第n个数
4.2 双指针的应用
4.2.1 数组合并
4.2.2 删除单链表倒数第n个数
4.3 小结
4.4 习题
第5章哈希算法
5.1 哈希算法的原理
5.2 哈希函数
5.2.1 除法哈希算法
5.2.2 乘法哈希算法
5.2.3 平方取中法
5.2.4 随机数哈希算法
5.3 解决冲突
5.3.1 开放定址法
5.3.2 链地址法
5.4 哈希算法的应用
5.4.1 两个数的和问题
5.4.2 团体赛问题
5.4.3 猜数字游戏
5.5 小结
5.6 习题
第6章深度优先搜索算法
6.1 搜索
6.2 图上的深度优先搜索
6.2.1 无向图
6.2.2 图的术语
6.2.3 图上的搜索
6.2.4 经典例题讲解（最大的油田）
6.3 二叉树上的深度优先搜索
6.3.1 二叉树相关术语
6.3.2 二叉树上的搜索
6.3.3 经典例题讲解（员工派对）
6.3.4 经典例题讲解（城市危机）
6.4 小结
6.5 习题
第7章广度优先搜索算法
7.1 依旧是图的搜索
7.2 队列中的存储方式
7.3 经典例题讲解
7.3.1 艰难旅行
7.3.2 混乱地铁
7.3.3 温室大棚
7.4 小结
7.5 习题
第8章回溯算法
8.1 回溯算法原理
8.2 回溯算法的应用
8.2.1 N皇后
8.2.2 数独
8.2.3 排列组合
8.2.4 两个扩展问题
8.3 小结
8.4 习题
第9章动态规划
9.1 动态规划介绍
9.2 矿工问题
9.2.1 问题描述
9.2.2 问题分析
9.2.3 参考实现
9.3 爬楼梯问题
9.3.1 问题描述
9.3.2 问题分析
9.3.3 参考实现
9.4 背包问题
9.4.1 问题描述
9.4.2 问题分析
9.4.3 问题实例
9.4.4 参考实现
9.5 最长递增子序列问题
9.5.1 问题描述
9.5.2 改进算法
9.5.3 参考实现
9.6 小结
9.7 习题
第10章贪心算法
10.1 贪心算法介绍
10.2 硬币找零问题
10.2.1 问题描述
10.2.2 问题实例
10.2.3 参考实现
10.3 活动安排问题
10.3.1 问题描述
10.3.2 参考实现
10.4 哈夫曼编码
10.4.1 问题描述
10.4.2 哈夫曼树
10.4.3 贪心选择性质
10.4.4 最优子结构性质
10.4.5 参考实现
10.5 小结
10.6 习题
第11章分治算法
11.1 分治算法原理
11.2 分治算法应用
11.2.1 二分查找
11.2.2 二维数组的查找
11.2.3 快速凸包算法
11.2.4 快速傅氏变换
11.3 小结
11.4 习题
第12章并查集
12.1 并查集介绍
12.1.1 并查集的构造方法
12.1.2 并查集的应用
12.1.3 并查集3种基本操作的Python实现
12.2 朋友圈
12.2.1 问题描述
12.2.2 问题分析
12.2.3 代码
12.3 图的子元素
12.3.1 问题描述
12.3.2 问题分析
12.3.3 代码
12.4 小结
12.5 习题
第13章最短路径算法
13.1 戴克斯特拉算法
13.1.1 算法介绍
13.1.2 算法证明
13.1.3 算法代码
13.2 贝尔曼-福特算法
13.2.1 算法介绍
13.2.2 算法证明
13.2.3 算法代码
13.3 弗洛伊德算法
13.3.1 算法介绍
13.3.2 算法代码
13.4 A*搜索算法
13.4.1 算法介绍
13.4.2 算法证明
13.4.3 算法代码
13.5 小结
13.6 习题
第14章数论算法
14.1 欧几里得算法
14.1.1 算法分析与证明
14.1.2 算法代码
14.1.3 算法应用
14.2 中国余数定理
14.2.1 算法介绍
14.2.2 算法证明
14.2.3 算法代码
14.3 素性检验算法
14.3.1 费马素性检验
14.3.2 米勒-拉宾素性检验
14.3.3 算法代码
14.4 小结
14.5 习题

FAQ

How much Python background does this book require?

You need to know basic Python syntax, data types, functions, and object-oriented programming concepts. The algorithm implementation code is clear, but the book assumes readers already have basic programming ability.

How does this book compare with classic textbooks such as Introduction to Algorithms?

This book focuses more on explanation through Python implementations and practical cases; mathematical proofs and theoretical depth are relatively simplified, making it suitable as introductory or application-oriented learning material rather than a purely theoretical textbook.

Can the code in the book be used directly in real projects?

The code is mainly for teaching demonstrations and reflects the core logic of the algorithms. In real projects, it may need to be optimized for specific scenarios, or more mature libraries may be used (such as Python's built-in sorting functions).

Comments

Find this book

This site is an index: you start “Search all sources” in your browser, and the entries it lists all point to third-party sites; please judge their availability yourself.

About the author

王硕 Author

Public information about Wang Shuo is limited, and no clear record of his identity or career is available. Judging from the eight works held in the library, however, his writing and editorial interests span several fields. In world history, The Age of Sail Changed the World examines how maritime activity shaped the course of human civilization. His technical works include Python Algorithm Design and Analysis, Rapid Development with PyQt5, Rapid Development and Practice with PySide 6 and PyQt 6, and Embedded Android Development, all aimed at software learning and programming design with an emphasis on practical development methods. In addition, The People Who Influenced Chinese Cuisine: Da Dong concerns a figure in gastronomy, while Writing as the Vehicle of the Way, Virtue at the Li Gate: A Commemorative Volume on Li Wenmin's Fifty Years of Peking Opera Teaching and Life relates to film, television and traditional opera, and Instant Deal falls under management. Overall, his works combine knowledge popularization with hands-on guidance, showing a diverse range of subjects and a pragmatic orientation.

董文馨 Author

Public information about Dong Wenxin is currently limited, and she is known only as the author of Python Algorithm Design and Analysis. Judging from this work, she focuses on an introductory and instructional approach that combines algorithms with a programming language, choosing Python as the medium for explaining algorithm design and analysis. The subject falls under software learning and is generally intended for readers who need to understand basic algorithmic ideas and wish to implement them with Python. Her writing style cannot be corroborated by a large body of work, but it can be inferred that the content emphasizes turning abstract algorithmic concepts into readable, practical learning material, helping readers build an understanding of algorithmic complexity, design strategies, and analysis methods within a programming context. Because only one work by her is held in the collection, verifiable information about her educational background, professional experience, and overall body of writing is unavailable; this introduction is therefore limited to the existing bibliographic facts and may be supplemented if more information becomes available.

张舒行 Author

Zhang Shuxing is an author about whom limited public information is available; only one work by this author is currently included in the database. According to the accessible information, the writing focuses on the field of software learning, and the representative work is Python Algorithm Design and Analysis. The book is aimed at programming learners and presents content related to algorithm design and analysis using the Python language, making it a common type of introductory and intermediate computer learning material. Because the author's nationality, dates of birth and death, English name, and educational background have not been confirmed, no further introduction to the author's life and experience can be provided. Based on the existing work, Zhang Shuxing's writing tends toward technical practice and knowledge explanation, and is suitable for readers who wish to use Python to understand the fundamentals and implementation approaches of algorithms. Overall, the current discussion of this author centers on the subject matter and learning purpose of the work rather than on personal credentials.

Zhang Jie Author · China · 1937–2022

Zhang Jie (1937–2022) was a contemporary Chinese woman writer. Born in Fushun, Liaoning, she graduated from Renmin University of China in 1960. She joined the China Writers Association in 1979 and served as a professional writer with the Beijing Writers Association. Her representative works include Leaden Wings and The Wordless, which won the second and sixth Mao Dun Literature Prizes respectively, as well as Love Must Not Be Forgotten and Emerald. The library holds 18 of her works, covering categories such as foreign literature, software learning, biography, computer studies, politics, and inspirational growth, including literary writing, technical tutorials, and biographies. Zhang Jie died of illness in the United States on January 21, 2022.

李秉伦 Author

Li Binglun: publicly available information is limited, and he is currently known only as the author of Python Algorithm Design and Analysis, a single work listed on this site under software learning. Judging by its subject, the book works with the Python language and combines algorithmic principles with programming practice, making it a technical title aimed at programming learners and newcomers to software development. Writing of this kind generally emphasizes clear explanation of concepts and workable examples, so that readers can grasp algorithmic thinking while implementing it in Python. The author's educational background, professional experience, and research direction are not publicly disclosed, so a fuller account of his writing trajectory is not possible; based on the available information, Li Binglun's authorial profile centers on this one work, whose content leans toward connecting foundational algorithms with hands-on programming and may serve readers who wish to approach algorithm design through Python.