提供了编程的基础技术教程

zl程序教程

您现在的位置是：首页 >  后端

当前栏目

《算法设计与分析》专栏简介

算法 分析 设计 简介 专栏
2023-09-14 09:06:55 时间

前言

欢迎订阅《算法分析与设计》专栏！从零开始算法之路！

文章目录

绪论

1课前测1-输入练习https://want595.blog.csdn.net/article/details/130033711
2课前测2-丑数https://want595.blog.csdn.net/article/details/130033752
3课前测3-字符三角形https://want595.blog.csdn.net/article/details/130033778
4课前测4-奋勇争先https://want595.blog.csdn.net/article/details/130033832
5课前测5-超级密码https://want595.blog.csdn.net/article/details/130033877
6求根号nhttps://want595.blog.csdn.net/article/details/130033902
7数据结构exp1_2学生成绩排序https://want595.blog.csdn.net/article/details/130033978
8十进制到八进制的转换https://want595.blog.csdn.net/article/details/130034024
9数据结构exp1_1(选择排序）https://want595.blog.csdn.net/article/details/130034058

实验1-求最大公约数

1判断两个数是否互质https://want595.blog.csdn.net/article/details/130033588
2求最大公约数https://want595.blog.csdn.net/article/details/130033613
3最小公倍数https://want595.blog.csdn.net/article/details/130033650
4用埃拉托色尼筛选法，求出1到n中所包含的全部素数https://want595.blog.csdn.net/article/details/130033674

实验2-斐波那契数列

1用递归算法求解斐波那契数列https://want595.blog.csdn.net/article/details/130033304
2用迭代算法求解斐波那契数列https://want595.blog.csdn.net/article/details/130033343
3用数学公式算法求解斐波那契数列https://want595.blog.csdn.net/article/details/130033379
4超级楼梯https://want595.blog.csdn.net/article/details/130033404
5斐波那契数列https://want595.blog.csdn.net/article/details/130033462
6斐波那契数列应用https://want595.blog.csdn.net/article/details/130033512
7斐波那契数列应用2https://want595.blog.csdn.net/article/details/130033551

实验3-蛮力算法

1判断一个字符串是否是回文https://want595.blog.csdn.net/article/details/130024166
2字串判断https://want595.blog.csdn.net/article/details/130024170
3稳定排序https://want595.blog.csdn.net/article/details/130024182
4判断两个字符串是否匹配（1个通配符代表一个字符）https://want595.blog.csdn.net/article/details/130024197
5自然数的拆分问题 字典序https://want595.blog.csdn.net/article/details/130024211
6自然数的拆分问题CFhttps://want595.blog.csdn.net/article/details/130024223

实验4-简单深搜练习

1有重复全排列https://want595.blog.csdn.net/article/details/130033026
2字母有重复全排列https://want595.blog.csdn.net/article/details/130033109
3无重复全排列https://want595.blog.csdn.net/article/details/130033140
4从前M个字母中取N个的无重复排列https://want595.blog.csdn.net/article/details/130033179
5从前M个字母中任取N个的组合https://want595.blog.csdn.net/article/details/130033239
6N皇后问题 checkerhttps://want595.blog.csdn.net/article/details/130022562
7素数环PrimeRinghttps://want595.blog.csdn.net/article/details/130022595
8求全排列（1）https://want595.blog.csdn.net/article/details/130022642
9全排列1_dfshttps://want595.blog.csdn.net/article/details/130022673
10全排列https://want595.blog.csdn.net/article/details/130022699

实验5-回溯法

1N皇后https://want595.blog.csdn.net/article/details/130022130
2子集和https://want595.blog.csdn.net/article/details/130022265
3走迷宫https://want595.blog.csdn.net/article/details/130022432

实验6-深度优先搜索

1图的深度优先遍历https://want595.blog.csdn.net/article/details/130151102
2图的遍历及连通性https://want595.blog.csdn.net/article/details/130149210
3判断欧拉回路https://want595.blog.csdn.net/article/details/130151070
4欧拉回路问题https://want595.blog.csdn.net/article/details/130149615

实验7-广度优先搜索

1图的遍历——广度优先搜索https://want595.blog.csdn.net/article/details/130150829
2图的宽度优先遍历https://want595.blog.csdn.net/article/details/130150907
3bfshttps://want595.blog.csdn.net/article/details/130150878

实验8-减治技术

1确定比赛名次（拓扑排序）​https://want595.blog.csdn.net/article/details/130217676
2确定比赛名次（深搜拓扑排序）https://want595.blog.csdn.net/article/details/130217778
3插入排序https://want595.blog.csdn.net/article/details/130167866
4减一技术实现求a的n次幂https://want595.blog.csdn.net/article/details/130167732
5减半技术实现求a的n次幂https://want595.blog.csdn.net/article/details/130167767

实验9-分治技术

1求倒置数https://want595.blog.csdn.net/article/details/130219146
2逆序对(deseq)https://want595.blog.csdn.net/article/details/130219181
3利用分治算法求数组的最大元素和最小元素https://want595.blog.csdn.net/article/details/130219223
4寻找中位数（利用快速排序来寻找中位数）https://want595.blog.csdn.net/article/details/130219242
5分治方法求数组的和https://want595.blog.csdn.net/article/details/130219266
6合并排序https://want595.blog.csdn.net/article/details/130219328
7求二叉树的先序遍历https://want595.blog.csdn.net/article/details/130219393

实验10-变治技术

1霍纳法则（Horner’s rule）https://want595.blog.csdn.net/article/details/130235985
2采用自底向上的方法构造大根堆https://want595.blog.csdn.net/article/details/130236115
3堆排序https://want595.blog.csdn.net/article/details/130236217
4求a的n次幂https://want595.blog.csdn.net/article/details/130236336
5Horspool算法https://want595.blog.csdn.net/article/details/130236618
6统计个数https://want595.blog.csdn.net/article/details/130236535
7计数排序https://want595.blog.csdn.net/article/details/130236721

实验11-动态规划

1数塔dp -Ahttps://want595.blog.csdn.net/article/details/130218184
2关键路径https://want595.blog.csdn.net/article/details/130218097
30-1背包问题https://want595.blog.csdn.net/article/details/130217145
4找零问题1-最少硬币https://want595.blog.csdn.net/article/details/130219056
5骨牌铺方格https://want595.blog.csdn.net/article/details/130218299
6一只小蜜蜂…https://want595.blog.csdn.net/article/details/130218478
7Tiling_easy versionhttps://want595.blog.csdn.net/article/details/130218593
8最少拦截系统https://want595.blog.csdn.net/article/details/130217337
9湫湫系列故事——减肥记Ⅰhttps://want595.blog.csdn.net/article/details/130204605
10Bone Collectorhttps://want595.blog.csdn.net/article/details/130204918

相关文章