<?xml version="1.0" encoding="utf-8" ?><rss version="2.0"><channel><title><![CDATA[Shenrunchen的博客]]></title><description><![CDATA[]]></description><link>https://blog.youkuaiyun.com/Shenrunchen</link><language>zh-cn</language><generator>https://blog.youkuaiyun.com/</generator><copyright><![CDATA[Copyright &copy; Shenrunchen]]></copyright><item><title><![CDATA[选择类排序]]></title><link>https://blog.youkuaiyun.com/Shenrunchen/article/details/128506161</link><guid>https://blog.youkuaiyun.com/Shenrunchen/article/details/128506161</guid><author>Shenrunchen</author><pubDate>Sat, 31 Dec 2022 15:59:32 +0800</pubDate><description><![CDATA[简单选择排序
建立大根堆
将元素k为根的子树进行调整
堆排序]]></description><category></category></item><item><title><![CDATA[插入类排序]]></title><link>https://blog.youkuaiyun.com/Shenrunchen/article/details/128458016</link><guid>https://blog.youkuaiyun.com/Shenrunchen/article/details/128458016</guid><author>Shenrunchen</author><pubDate>Tue, 27 Dec 2022 16:31:49 +0800</pubDate><description><![CDATA[直接插入排序
折半插入排序
希尔排序]]></description><category></category></item><item><title><![CDATA[实现二叉查找树进行数据查找]]></title><link>https://blog.youkuaiyun.com/Shenrunchen/article/details/128433859</link><guid>https://blog.youkuaiyun.com/Shenrunchen/article/details/128433859</guid><author>Shenrunchen</author><pubDate>Sun, 25 Dec 2022 11:04:42 +0800</pubDate><description><![CDATA[查找算法：实现二叉查找树进行数据查找]]></description><category></category></item><item><title><![CDATA[实现图的遍历]]></title><link>https://blog.youkuaiyun.com/Shenrunchen/article/details/128155102</link><guid>https://blog.youkuaiyun.com/Shenrunchen/article/details/128155102</guid><author>Shenrunchen</author><pubDate>Fri, 02 Dec 2022 21:40:47 +0800</pubDate><description><![CDATA[实现图的深度优先遍历算法
实现图的广度优先遍历算法]]></description><category></category></item><item><title><![CDATA[树和二叉树]]></title><link>https://blog.youkuaiyun.com/Shenrunchen/article/details/127981291</link><guid>https://blog.youkuaiyun.com/Shenrunchen/article/details/127981291</guid><author>Shenrunchen</author><pubDate>Tue, 22 Nov 2022 13:44:17 +0800</pubDate><description><![CDATA[(1)掌握二叉树的基本操作，实现二叉树的链式存储结构;
(2)掌握二叉树的前序、中序、后序遍历的算法;
(3)掌握二叉树的复原方法
]]></description><category></category></item><item><title><![CDATA[栈和队列的实现]]></title><link>https://blog.youkuaiyun.com/Shenrunchen/article/details/127569031</link><guid>https://blog.youkuaiyun.com/Shenrunchen/article/details/127569031</guid><author>Shenrunchen</author><pubDate>Fri, 28 Oct 2022 12:01:51 +0800</pubDate><description><![CDATA[(1)掌握栈的顺序表示和实现
(2)掌握栈的链式表示和实现
(3)掌握队列的链式表示和实现
]]></description><category></category></item><item><title><![CDATA[线性表的顺序存储]]></title><link>https://blog.youkuaiyun.com/Shenrunchen/article/details/127317609</link><guid>https://blog.youkuaiyun.com/Shenrunchen/article/details/127317609</guid><author>Shenrunchen</author><pubDate>Fri, 14 Oct 2022 11:44:41 +0800</pubDate><description><![CDATA[应用c语言编写一个线性表操作测试程序。程序中用户可以选择插入数据元素，查找数据元素，删除数据元素，及显示数据元素。程序启动后，于屏幕上显示如下功能菜单。]]></description><category></category></item><item><title><![CDATA[递归--汉诺塔]]></title><link>https://blog.youkuaiyun.com/Shenrunchen/article/details/126518189</link><guid>https://blog.youkuaiyun.com/Shenrunchen/article/details/126518189</guid><author>Shenrunchen</author><pubDate>Thu, 25 Aug 2022 09:42:59 +0800</pubDate><description><![CDATA[编写汉诺塔程序，加入打印递归过程，观察递归运算的机里。即递归进入的时候，打印这是第几层，从递归退出时，打印递归深度。]]></description><category></category></item><item><title><![CDATA[递归--回溯法--N皇后问题]]></title><link>https://blog.youkuaiyun.com/Shenrunchen/article/details/126506620</link><guid>https://blog.youkuaiyun.com/Shenrunchen/article/details/126506620</guid><author>Shenrunchen</author><pubDate>Wed, 24 Aug 2022 16:00:10 +0800</pubDate><description><![CDATA[完成8皇后问题，若棋盘为5X5或9X9结果如何]]></description><category></category></item><item><title><![CDATA[完全背包问题--找零钱]]></title><link>https://blog.youkuaiyun.com/Shenrunchen/article/details/126486962</link><guid>https://blog.youkuaiyun.com/Shenrunchen/article/details/126486962</guid><author>Shenrunchen</author><pubDate>Tue, 23 Aug 2022 16:00:16 +0800</pubDate><description><![CDATA[找零钱
题目:已知一些不同面值的钞票与一个金额，求如何用最少数量的钞票组成该金额，
如果任意数量的已知面值都无法组成该金额，返回-1。]]></description><category></category></item><item><title><![CDATA[C++打印n位数之和为m的数]]></title><link>https://blog.youkuaiyun.com/Shenrunchen/article/details/126479935</link><guid>https://blog.youkuaiyun.com/Shenrunchen/article/details/126479935</guid><author>Shenrunchen</author><pubDate>Tue, 23 Aug 2022 10:37:30 +0800</pubDate><description><![CDATA[输入m,n,打印所有的n位数，其各位之和为m.]]></description><category></category></item><item><title><![CDATA[C++埃拉托斯特筛子求质数算法]]></title><link>https://blog.youkuaiyun.com/Shenrunchen/article/details/126479232</link><guid>https://blog.youkuaiyun.com/Shenrunchen/article/details/126479232</guid><author>Shenrunchen</author><pubDate>Tue, 23 Aug 2022 10:11:26 +0800</pubDate><description><![CDATA[埃拉托斯特筛子求质数算法：

a)创建一长度为N的数组，将所有元素置为1

b)从数组下标2开始，每次找到一个值为1的元素时，在数组的剩余部分循环，并将下标1的元素置为0，即对于数组下标2，数组中所有2以上且是2的倍数的元素均被置为0（2，4，6，8，10等）对于下标3，数组中所有3以上，且是3的倍数的元素置为0（3，6，9，12等）

当该过程结束后，数组中还是1的元素，即素数。]]></description><category></category></item><item><title><![CDATA[C++查找直角三角形]]></title><link>https://blog.youkuaiyun.com/Shenrunchen/article/details/126478705</link><guid>https://blog.youkuaiyun.com/Shenrunchen/article/details/126478705</guid><author>Shenrunchen</author><pubDate>Tue, 23 Aug 2022 09:51:32 +0800</pubDate><description><![CDATA[输入若干整数，找出所有可以实现直角三角形的组合]]></description><category></category></item><item><title><![CDATA[快速排序算法]]></title><link>https://blog.youkuaiyun.com/Shenrunchen/article/details/126460783</link><guid>https://blog.youkuaiyun.com/Shenrunchen/article/details/126460783</guid><author>Shenrunchen</author><pubDate>Mon, 22 Aug 2022 10:20:02 +0800</pubDate><description><![CDATA[快速排序算法]]></description><category></category></item><item><title><![CDATA[C++进制转化]]></title><link>https://blog.youkuaiyun.com/Shenrunchen/article/details/126460603</link><guid>https://blog.youkuaiyun.com/Shenrunchen/article/details/126460603</guid><author>Shenrunchen</author><pubDate>Mon, 22 Aug 2022 10:12:44 +0800</pubDate><description><![CDATA[输入一个整数和进制数，以该进制打印该数]]></description><category></category></item><item><title><![CDATA[C++ Vigenere加密算法]]></title><link>https://blog.youkuaiyun.com/Shenrunchen/article/details/126447383</link><guid>https://blog.youkuaiyun.com/Shenrunchen/article/details/126447383</guid><author>Shenrunchen</author><pubDate>Sun, 21 Aug 2022 09:25:38 +0800</pubDate><description><![CDATA[单一字母替换密码很容易通过字母频率分析而破解。而一种被称为Vigenere的密码克服了这一缺点，其方法是对于待加密信息中不同位置上的字母应用不同的字母加密对应关系。]]></description><category></category></item><item><title><![CDATA[C++计算职工工资]]></title><link>https://blog.youkuaiyun.com/Shenrunchen/article/details/126440540</link><guid>https://blog.youkuaiyun.com/Shenrunchen/article/details/126440540</guid><author>Shenrunchen</author><pubDate>Sat, 20 Aug 2022 15:38:03 +0800</pubDate><description><![CDATA[给定N个职员的信息，包括姓名、基本工资、浮动工资和支出，要求编写程序顺序输出每位职员的姓名和实发工资（实发工资=基本工资+浮动工资-支出）。]]></description><category></category></item><item><title><![CDATA[C++时钟指针]]></title><link>https://blog.youkuaiyun.com/Shenrunchen/article/details/126440260</link><guid>https://blog.youkuaiyun.com/Shenrunchen/article/details/126440260</guid><author>Shenrunchen</author><pubDate>Sat, 20 Aug 2022 15:19:17 +0800</pubDate><description><![CDATA[【问题描述】普通时钟都有时针和分针，在任意时刻时针和分针都有一个夹角，并且假设时针和分针都是连续移动的。现已知当前的时刻，试求出该时刻时针和分针的夹角A（0&le;A&le;180）。]]></description><category></category></item><item><title><![CDATA[C++画图数方块]]></title><link>https://blog.youkuaiyun.com/Shenrunchen/article/details/126408425</link><guid>https://blog.youkuaiyun.com/Shenrunchen/article/details/126408425</guid><author>Shenrunchen</author><pubDate>Thu, 18 Aug 2022 16:22:49 +0800</pubDate><description><![CDATA[　在一个定义了直角坐标系的纸上，画一个(x1,y1)到(x2,y2)的矩形指将横坐标范围从x1到x2，纵坐标范围从y1到y2之间的区域涂上颜色。]]></description><category></category></item><item><title><![CDATA[C++年内天数]]></title><link>https://blog.youkuaiyun.com/Shenrunchen/article/details/126009480</link><guid>https://blog.youkuaiyun.com/Shenrunchen/article/details/126009480</guid><author>Shenrunchen</author><pubDate>Wed, 27 Jul 2022 10:33:13 +0800</pubDate><description><![CDATA[C++年内天数：题目描述

输入任意日期，输出它是年内第几天。]]></description><category></category></item></channel></rss>