<?xml version="1.0" encoding="utf-8" ?><rss version="2.0"><channel><title><![CDATA[ktaurus的专栏]]></title><description><![CDATA[]]></description><link>https://blog.youkuaiyun.com/ktaurus</link><language>zh-cn</language><generator>https://blog.youkuaiyun.com/</generator><copyright><![CDATA[Copyright &copy; ktaurus]]></copyright><item><title><![CDATA[冒泡排序（BubbleSort）]]></title><link>https://blog.youkuaiyun.com/ktaurus/article/details/8811784</link><guid>https://blog.youkuaiyun.com/ktaurus/article/details/8811784</guid><author>ktaurus</author><pubDate>Tue, 16 Apr 2013 23:47:18 +0800</pubDate><description><![CDATA[冒泡排序（BubbleSort）的基本概念是：依次比较相邻的两个数，将小数放在前面，大数放在后面。即在第一趟：首先比较第1个和第2个数，将小数放前，大数放后。然后比较第2个数和第3个数，将小数放前，大数放后，如此继续，直至比较最后两个数，将小数放前，大数放后。至此第一趟结束，将最大的数放到了最后。在第二趟：仍从第一对数开始比较（因为可能由于第2个数和第3个数的交换，使得第1个数不再小于第2个数），]]></description><category></category></item><item><title><![CDATA[插入排序Insertion sort]]></title><link>https://blog.youkuaiyun.com/ktaurus/article/details/8806475</link><guid>https://blog.youkuaiyun.com/ktaurus/article/details/8806475</guid><author>ktaurus</author><pubDate>Mon, 15 Apr 2013 23:32:17 +0800</pubDate><description><![CDATA[有一个已经有序的数据序列，要求在这个已经排好的数据序列中插入一个数，但要求插入后此数据序列仍然有序，这个时候就要用到一种新的排序方法——插入排序法,插入排序的基本操作就是将一个数据插入到已经排好序的有序数据中，从而得到一个新的、个数加一的有序数据，算法适用于少量数据的排序，时间复杂度为O(n^2)。是稳定的排序方法。插入算法把要排序的数组分成两部分：第一部分包含了这个数组的所有元素，但将最后一个元]]></description><category></category></item><item><title><![CDATA[快速排序]]></title><link>https://blog.youkuaiyun.com/ktaurus/article/details/8705279</link><guid>https://blog.youkuaiyun.com/ktaurus/article/details/8705279</guid><author>ktaurus</author><pubDate>Fri, 22 Mar 2013 11:14:18 +0800</pubDate><description><![CDATA[//快速排序

#include 

int quick_sort(int *a, int low, int high);
void qksort(int *a,int low,int high);

int main(void)
{
	int i;
	int a[10] = {1,2,3,5,4,6,7,9,10,8};
	for (i = 0; i < 10;i++)
		printf("%5]]></description><category></category></item><item><title><![CDATA[文件读取输出学习]]></title><link>https://blog.youkuaiyun.com/ktaurus/article/details/7724460</link><guid>https://blog.youkuaiyun.com/ktaurus/article/details/7724460</guid><author>ktaurus</author><pubDate>Sat, 07 Jul 2012 13:52:28 +0800</pubDate><description><![CDATA[#include 
#include 
using namespace std;
#define N 1000
int main()
{
	char temp[N]={0};//初始化
	char temp2[N]={0};
	//输出数据到output.txt
	ofstream ofs;
	ofs.open("output.txt");
	cin.getline(temp,N,0);
	int]]></description><category></category></item><item><title><![CDATA[万年历]]></title><link>https://blog.youkuaiyun.com/ktaurus/article/details/7690941</link><guid>https://blog.youkuaiyun.com/ktaurus/article/details/7690941</guid><author>ktaurus</author><pubDate>Mon, 25 Jun 2012 20:11:01 +0800</pubDate><description><![CDATA[#include
#include
#include
#include 
#include "SolarCalendar.h"
#include "ConsoleColor.h"
#include "LunarCalendar.h"
using namespace std;

int everyMonth[]={0,31,28,31,30,31,30,31,31,30,31,30,31};

vo]]></description><category></category></item><item><title><![CDATA[回文判断]]></title><link>https://blog.youkuaiyun.com/ktaurus/article/details/7568751</link><guid>https://blog.youkuaiyun.com/ktaurus/article/details/7568751</guid><author>ktaurus</author><pubDate>Tue, 15 May 2012 14:47:41 +0800</pubDate><description><![CDATA[#include 
#include 
#include 
using namespace std;

int main()
{
	cout<<"请输入字符串："<<endl;
	string str;
	cin>>str;
	string::iterator it;
	string::reverse_iterator rit;
	for (it=str.begin(),rit=str.rbegi]]></description><category></category></item><item><title><![CDATA[迷宫]]></title><link>https://blog.youkuaiyun.com/ktaurus/article/details/7562512</link><guid>https://blog.youkuaiyun.com/ktaurus/article/details/7562512</guid><author>ktaurus</author><pubDate>Sun, 13 May 2012 16:50:02 +0800</pubDate><description><![CDATA[#ifndef _SQSTACK_H_
#define _SQSTACK_H_

//定义顺序栈类
template //声明一个类模板
class SqStack
{
public:                     //顺序栈类的各成员函数
	SqStack(int m = 100);     
	~SqStack(); 
   	void Clear();
	bool Empty()]]></description><category></category></item></channel></rss>