没有合适的资源?快使用搜索试试~ 我知道了~
资源推荐
资源详情
资源评论
ACM 程序设计常用算法与数据结构参考
ACM 程序设计常用算法与 数据
结构参考
Tomsdinary
编辑整理 Tomsdinary 151/1
ACM 程序设计常用算法与数据结构参考
目录
前言.....................................................................................................................................................6
排序算法.............................................................................................................................................8
插入排序.....................................................................................................................................8
选择排序.....................................................................................................................................9
冒泡排序...................................................................................................................................10
希尔排序...................................................................................................................................12
随机化快速排序.......................................................................................................................14
归并排序...................................................................................................................................17
堆排序.......................................................................................................................................19
大整数处理.......................................................................................................................................21
包含头文件.......................................................................................................................21
定义...........................................................................................................................................22
实现...........................................................................................................................................24
流输出...............................................................................................................................24
流输入...............................................................................................................................24
赋值...................................................................................................................................24
转换函数...........................................................................................................................25
规范化符号化...................................................................................................................26
带符号乘法.......................................................................................................................27
无符号取模.......................................................................................................................27
整数乘法...........................................................................................................................28
整数加法...........................................................................................................................30
带符号加法.......................................................................................................................32
浮点乘法...........................................................................................................................33
浮点加法...........................................................................................................................35
带符号减法.......................................................................................................................36
整数减法...........................................................................................................................37
浮点减法...........................................................................................................................40
带符号比较.......................................................................................................................42
无符号比较.......................................................................................................................42
无符号乘方.......................................................................................................................43
带符号乘方.......................................................................................................................44
使用方法...........................................................................................................................44
高级数据结构...................................................................................................................................45
普通二叉搜素树.......................................................................................................................45
包含头文件.......................................................................................................................45
定义...........................................................................................................................................45
实现...........................................................................................................................................48
删树...................................................................................................................................51
插入元素到树...................................................................................................................51
复制树...............................................................................................................................54
编辑整理 Tomsdinary 151/2
ACM 程序设计常用算法与数据结构参考
求树的高度.......................................................................................................................57
求叶子的个数...................................................................................................................58
删除元素...........................................................................................................................58
使用方法...........................................................................................................................60
基本线段树模式.......................................................................................................................61
基本并查集模式.......................................................................................................................63
散列实现的一种方式参考.......................................................................................................65
定义与实现.......................................................................................................................65
使用方法...........................................................................................................................73
堆...............................................................................................................................................74
包含头文件.......................................................................................................................74
定义与实现.......................................................................................................................74
使用方法...........................................................................................................................77
图相关算法.......................................................................................................................................77
图的深度优先和广度优先算法举例.......................................................................................77
无向图最小生成树的 Kruskal 算法举例................................................................................80
无向图最小生成树的 Prim 算法举例.....................................................................................82
有向图的单源最短路径 Dijkstra 算法举例............................................................................84
有向图的多源最短路径 Floyd 算法举例................................................................................85
拓扑排序举例...........................................................................................................................87
AOE 网的算法举例..................................................................................................................90
求图的一个中心算法举例.......................................................................................................94
求图的 P 个中心算法举例.......................................................................................................97
SPFA 算法举例.......................................................................................................................101
割顶和块的算法举例.............................................................................................................104
计算几何算法.................................................................................................................................106
向量模.....................................................................................................................................107
向量点积.................................................................................................................................107
向量叉积.................................................................................................................................107
左右判断.................................................................................................................................108
相交判断.................................................................................................................................108
正规相交交点.........................................................................................................................108
判断多边形凸.........................................................................................................................109
任意多变形面积.....................................................................................................................109
凸包问题的快包实现举例.....................................................................................................110
STL 算法参考.................................................................................................................................115
accumulate()....................................................................................................................115
adjacent_difference().......................................................................................................115
adjacent_find().................................................................................................................116
binary_search()................................................................................................................116
copy()...............................................................................................................................116
copy_backward().............................................................................................................117
count()..............................................................................................................................117
count_if().........................................................................................................................118
编辑整理 Tomsdinary 151/3
ACM 程序设计常用算法与数据结构参考
equal()..............................................................................................................................118
equal_range()...................................................................................................................118
fill()..................................................................................................................................119
fill_n()..............................................................................................................................119
find()................................................................................................................................119
find_if()...........................................................................................................................120
find_end()........................................................................................................................120
find_first_of()..................................................................................................................120
for_each()........................................................................................................................121
generate().........................................................................................................................121
generate_n().....................................................................................................................121
includes().........................................................................................................................122
inner_product()................................................................................................................122
inplace_merge()...............................................................................................................123
iter_swap().......................................................................................................................123
lexicographical_compare()..............................................................................................123
lower_bound().................................................................................................................124
max()...............................................................................................................................125
max_element().................................................................................................................125
min()................................................................................................................................125
min_element().................................................................................................................126
merge()............................................................................................................................126
mismatch().......................................................................................................................126
next_permutation()..........................................................................................................127
nnth_element()................................................................................................................127
partial_sort()....................................................................................................................128
partial_sort_copy()..........................................................................................................128
partial_sum()...................................................................................................................129
prev_permutation()..........................................................................................................129
random_shuffle().............................................................................................................130
remove()..........................................................................................................................130
remove_copy()................................................................................................................131
remove_if()......................................................................................................................131
remove_copy_if()............................................................................................................131
replace()...........................................................................................................................131
replace_copy().................................................................................................................132
replace_if()......................................................................................................................132
replace_copy_if()............................................................................................................132
reverse()...........................................................................................................................133
reverse_copy().................................................................................................................133
rotate().............................................................................................................................133
rotate_copy()...................................................................................................................133
search()............................................................................................................................134
search_n()........................................................................................................................134
编辑整理 Tomsdinary 151/4
ACM 程序设计常用算法与数据结构参考
set_difference()................................................................................................................134
set_intersection().............................................................................................................135
set_symmetric_difference()............................................................................................136
set_union().......................................................................................................................136
sort()................................................................................................................................137
stable_partition().............................................................................................................137
stable_sort().....................................................................................................................137
swap()..............................................................................................................................138
swap_range()...................................................................................................................138
transform().......................................................................................................................138
unique()...........................................................................................................................139
unique_copy().................................................................................................................139
upper_bound().................................................................................................................140
make_heap()....................................................................................................................140
pop_heap().......................................................................................................................141
push_heap().....................................................................................................................141
sort_heap().......................................................................................................................141
字符串处理.....................................................................................................................................142
KMP 算法举例.......................................................................................................................142
C++语言可用头文件......................................................................................................................144
<algorithm>.....................................................................................................................144
<bitset>............................................................................................................................144
<complex>.......................................................................................................................144
<deque>...........................................................................................................................144
<exception>.....................................................................................................................144
<fstream>........................................................................................................................144
<functional>....................................................................................................................145
<iomanip>.......................................................................................................................145
<ios>................................................................................................................................145
<iosfwd>.........................................................................................................................145
<iostream>.......................................................................................................................145
<iso646.h>.......................................................................................................................145
<istream>.........................................................................................................................145
<iterator>.........................................................................................................................146
<limits>...........................................................................................................................146
<list>................................................................................................................................146
<locale>...........................................................................................................................146
<map>..............................................................................................................................146
<memory>.......................................................................................................................146
<new>..............................................................................................................................147
<numeric>.......................................................................................................................147
<ostream>........................................................................................................................147
<queue>...........................................................................................................................147
<set>................................................................................................................................147
编辑整理 Tomsdinary 151/5
剩余63页未读,继续阅读
资源评论
Akagi201
- 粉丝: 10
- 资源: 12
上传资源 快速赚钱
- 我的内容管理 展开
- 我的资源 快来上传第一个资源
- 我的收益 登录查看自己的收益
- 我的积分 登录查看自己的积分
- 我的C币 登录后查看C币余额
- 我的收藏
- 我的下载
- 下载帮助
最新资源
- 一款极简的截图工具(支持 Win,Mac,Linux)
- 基于SpringBoot + SSM实现的HIS医院信息管理系统
- 基于Springboot+mybatisplus+Layui+mysql制作的图书管理系统
- sql-lap注入靶场
- 803916326552715醒图v9.7.0解锁会员版.apk
- 使用SpringBoot2.x 简单实现Java高并发之秒杀系统
- 基于python+opencv实现的手指静脉识别源码+数据集+项目说明毕业设计.zip
- Android AIDL基础-利用AIDL实现客户端向服务端传递Listener接口
- Android AIDL基础-利用AIDL实现客户端向服务端传递基本类型
- GHKQ-12.ass
资源上传下载、课程学习等过程中有任何疑问或建议,欢迎提出宝贵意见哦~我们会及时处理!
点击此处反馈
安全验证
文档复制为VIP权益,开通VIP直接复制
信息提交成功