《挑战算法之路》目录页

这是一本关于算法的书籍,涵盖了排序、搜索、数据结构、动态规划、图论、线性代数等多个方面。通过实例讲解了如插入排序、快速排序、深度优先搜索、动态规划优化等算法,并介绍了线性代数中的矩阵运算和线性规划。此外,还涉及了图论、字符串匹配和博弈论等领域的知识。

摘要生成于 C知道 ,由 DeepSeek-R1 满血版支持, 前往体验 >

《挑战算法之路》的源代码可以从GitHub下载,网址链接: 点击打开链接
也可以从GoogleCode下载,网址链接: 点击打开链接


挑战算法之路

Way to Algorithm




西安交通大学计算机系 林荣彬


目录页

第2版声明 .......................................................................................................................................

第2版序言 ........................................................................................................................................

阅读方法 .........................................................................................................................................

通用头文件 general_head.h .............................................................................................................

1.排序 Sort ....................................................................................................................................

               (1)插入排序 insert_sort.cpp ...............................................................................................

               (2)冒泡排序 bubble_sort.cpp ...........................................................................................

               (3)快速排序 quick_sort.cpp ...............................................................................................

               (4)二分查找法 binary_search.cpp ......................................................................................

               (5)测试用例 test.cpp ..........................................................................................................

2.搜索 Search .........................................................................................................................

               (0)搜索头文件 search.h .....................................................................................................

               (1)暴力枚举 brute_force.cpp ..............................................................................................

               (2)深度优先搜索 depth_first_search.cpp ............................................................................

               (3)广度优先搜索 breadth_first_search.cpp ........................................................................

               (4)双向广度搜索 bidirection_breadth_search.cpp .............................................................

               (5)A*启发式搜索 a_heuristic_search.cpp ...........................................................................

               (6)高级搜索算法介绍 advanced_search_algorithm_introduction.cpp .................................

               (7)测试用例 test.cpp ..........................................................................................................

3.数据结构 Data Structure ................................................................................................................

               (0)数据结构头文件 data_structure.h .................................................................................

               (1)经典数据结构介绍 classic_data_structure_introduction.cpp ...........................................

               (2)哈希表 hash_table.cpp ...................................................................................................

               (3)线段树 segment_tree.cpp ...............................................................................................

               (4)树状数组 binary_index_tree.cpp .....................................................................................

               (5)并查集 disjoint_set.cpp ...................................................................................................

               (6)左偏树 leftist_tree.cpp ....................................................................................................

               (7)后缀树 suffix_tree.cpp ....................................................................................................

               (8)测试用例 test.cpp ............................................................................................................

4.动态规划 Dynamic Programming ....................................................................................................

              (1)动态规划介绍 dynamic_programming_introduction.cpp ...................................................

              (2)动态规划优化 dynamic_programming_optimization.cpp ....................................................

        4.1线性动态规划 Linear Dynamic ................................................................................................

              (1)最长公共子序列 longest_common_subsequence.cpp ......................................................

              (2)最长递增子序列 longest_increasing_subsequence.cpp ...................................................

              (3)最长递增子序列扩展 longest_increasing_subsequence_extension.cpp ...........................

              (4)双向子序列 bidirecti

评论 7
添加红包

请填写红包祝福语或标题

红包个数最小为10个

红包金额最低5元

当前余额3.43前往充值 >
需支付:10.00
成就一亿技术人!
领取后你会自动成为博主和红包主的粉丝 规则
hope_wisdom
发出的红包
实付
使用余额支付
点击重新获取
扫码支付
钱包余额 0

抵扣说明:

1.余额是钱包充值的虚拟货币,按照1:1的比例进行支付金额的抵扣。
2.余额无法直接购买下载,可以购买VIP、付费专栏及课程。

余额充值