<?xml version="1.0" encoding="utf-8" ?><rss version="2.0"><channel><title><![CDATA[知行合一]]></title><description><![CDATA[]]></description><link>https://blog.youkuaiyun.com/Praker</link><language>zh-cn</language><generator>https://blog.youkuaiyun.com/</generator><copyright><![CDATA[Copyright &copy; Praker]]></copyright><item><title><![CDATA[八皇后]]></title><link>https://blog.youkuaiyun.com/Praker/article/details/50424764</link><guid>https://blog.youkuaiyun.com/Praker/article/details/50424764</guid><author>Praker</author><pubDate>Tue, 29 Dec 2015 11:37:06 +0800</pubDate><description><![CDATA[转载：http://zhedahht.blog.163.com/blog/static/2541117420114331616329


   解决这个问题通常需要用递归，而递归对编程能力的要求比较高。因此有不少面试官青睐这个题目，用来考察应聘者的分析复杂问题的能力以及编程的能力。
   由于八个皇后的任意两个不能处在同一行，那么肯定是每一个皇后占据一行。于是我们可以定义一个数组colum]]></description><category></category></item><item><title><![CDATA[二叉搜索树BST]]></title><link>https://blog.youkuaiyun.com/Praker/article/details/50413785</link><guid>https://blog.youkuaiyun.com/Praker/article/details/50413785</guid><author>Praker</author><pubDate>Sun, 27 Dec 2015 22:46:15 +0800</pubDate><description><![CDATA[在二叉搜索树b中查找x的过程为：
1.若b是空树，则搜索失败，否则：
2.若x等于b的根结点的数据域之值，则查找成功；否则
3.若x小于b的根结点的数据域之值，则搜索左子树：否则
4.查找右子树
// 指针parent指向pRoot的父节点，其初始调用值为NULL
// 若查找成功，指针pTarget指向目标节点，函数返回true
// 否则指针pTarget指向查找路径上访问的最后一个]]></description><category></category></item><item><title><![CDATA[指向指针的指针和指针的引用]]></title><link>https://blog.youkuaiyun.com/Praker/article/details/50407896</link><guid>https://blog.youkuaiyun.com/Praker/article/details/50407896</guid><author>Praker</author><pubDate>Sat, 26 Dec 2015 11:58:49 +0800</pubDate><description><![CDATA[当我们把一个指针作为一个参数传递给函数时，其实是把指针的copy传递给了函数，也可以说传递指针是指针的值传递。
如果我们在函数内部修改指针，修改的只是指针的copy而不是指针本身。代码验证如下：
#include

using namespace std;

int num1 = 1;

void func(int* p)
{
	p = &num1;
	cout << p << endl;]]></description><category></category></item><item><title><![CDATA[归并排序]]></title><link>https://blog.youkuaiyun.com/Praker/article/details/50203489</link><guid>https://blog.youkuaiyun.com/Praker/article/details/50203489</guid><author>Praker</author><pubDate>Wed, 23 Dec 2015 10:44:22 +0800</pubDate><description><![CDATA[先递归分解序列，再合并有序数列
#include 
#include 
#include 

using namespace std;

#define random(x) (rand()%x)

void merge_array(int nums[], int first, int mid, int last, int temp[])
{
	int index1 = first, index2]]></description><category></category></item><item><title><![CDATA[堆排序]]></title><link>https://blog.youkuaiyun.com/Praker/article/details/50199667</link><guid>https://blog.youkuaiyun.com/Praker/article/details/50199667</guid><author>Praker</author><pubDate>Sun, 06 Dec 2015 23:15:15 +0800</pubDate><description><![CDATA[#include 
#include 
#include 

using namespace std;

#define random(x) (rand()%x)

void heap_adjust(vector& nums, int index, int length)
{
	for(int i = 2 * index; i <= length; i *= 2)
	{
		int temp =]]></description><category></category></item><item><title><![CDATA[快速排序]]></title><link>https://blog.youkuaiyun.com/Praker/article/details/50196527</link><guid>https://blog.youkuaiyun.com/Praker/article/details/50196527</guid><author>Praker</author><pubDate>Sun, 06 Dec 2015 17:30:19 +0800</pubDate><description><![CDATA[2015.11.30 面试创云传奇
#include 
#include 
#include 

using namespace std;

#define random(x) (rand()%x)

void quick_sort(vector& vec, int left, int right)
{
	if(left < right)
	{
		int pivot = vec[left];
]]></description><category></category></item><item><title><![CDATA[单链表快速排序]]></title><link>https://blog.youkuaiyun.com/Praker/article/details/50082579</link><guid>https://blog.youkuaiyun.com/Praker/article/details/50082579</guid><author>Praker</author><pubDate>Sat, 28 Nov 2015 11:26:20 +0800</pubDate><description><![CDATA[2015.11.27  面试一点资讯 ，面试官是很nice的校友师兄，无奈基本功太差，跪了！
#include 

using namespace std;

#define random(x) (rand()%x)

struct ListNode
{
	int value;
	ListNode* next;
};

void create_list(ListNode* head)
{
	Li]]></description><category></category></item><item><title><![CDATA[UVaOJ 127]]></title><link>https://blog.youkuaiyun.com/Praker/article/details/39449453</link><guid>https://blog.youkuaiyun.com/Praker/article/details/39449453</guid><author>Praker</author><pubDate>Sun, 21 Sep 2014 10:20:49 +0800</pubDate><description><![CDATA[`Accordian'' Patience 






You are to simulate the playing of games of ``Accordian'' patience, the rules for which are as follows:

Deal cards one by one in a row from left to right, not ov]]></description><category></category></item><item><title><![CDATA[算法：C语言实现第三章第一节学习笔记]]></title><link>https://blog.youkuaiyun.com/Praker/article/details/38760181</link><guid>https://blog.youkuaiyun.com/Praker/article/details/38760181</guid><author>Praker</author><pubDate>Fri, 22 Aug 2014 18:06:31 +0800</pubDate><description><![CDATA[3.1]]></description><category></category></item><item><title><![CDATA[C程序设计语言(K&R)第七章学习笔记]]></title><link>https://blog.youkuaiyun.com/Praker/article/details/38562823</link><guid>https://blog.youkuaiyun.com/Praker/article/details/38562823</guid><author>Praker</author><pubDate>Thu, 14 Aug 2014 19:55:04 +0800</pubDate><description><![CDATA[7.1
     符号常量EOF、]]></description><category></category></item><item><title><![CDATA[C程序设计语言(K&R)第六章学习笔记]]></title><link>https://blog.youkuaiyun.com/Praker/article/details/38423781</link><guid>https://blog.youkuaiyun.com/Praker/article/details/38423781</guid><author>Praker</author><pubDate>Thu, 07 Aug 2014 19:12:17 +0800</pubDate><description><![CDATA[6.1
结构]]></description><category></category></item><item><title><![CDATA[C程序设计语言(K&R)第五章学习笔记]]></title><link>https://blog.youkuaiyun.com/Praker/article/details/38348345</link><guid>https://blog.youkuaiyun.com/Praker/article/details/38348345</guid><author>Praker</author><pubDate>Sat, 02 Aug 2014 15:01:21 +0800</pubDate><description><![CDATA[5.1
    一元运算fu]]></description><category></category></item><item><title><![CDATA[C程序设计语言(K&R)第四章学习笔记]]></title><link>https://blog.youkuaiyun.com/Praker/article/details/38341859</link><guid>https://blog.youkuaiyun.com/Praker/article/details/38341859</guid><author>Praker</author><pubDate>Fri, 01 Aug 2014 20:40:52 +0800</pubDate><description><![CDATA[#include 
#include 

#define MAXLINE 100

/* rudimentary calculator */
int main()
{
	double sum, atof(char []);
	char line[MAXLINE];
	int getline(char line[], int max);

	sum = 0;
	while (getline(line]]></description><category></category></item><item><title><![CDATA[C程序设计语言(K&R)第三章学习笔记]]></title><link>https://blog.youkuaiyun.com/Praker/article/details/38322523</link><guid>https://blog.youkuaiyun.com/Praker/article/details/38322523</guid><author>Praker</author><pubDate>Thu, 31 Jul 2014 19:49:08 +0800</pubDate><description><![CDATA[3.5]]></description><category></category></item><item><title><![CDATA[C程序设计语言(K&R)第二章学习笔记]]></title><link>https://blog.youkuaiyun.com/Praker/article/details/38306345</link><guid>https://blog.youkuaiyun.com/Praker/article/details/38306345</guid><author>Praker</author><pubDate>Wed, 30 Jul 2014 20:39:35 +0800</pubDate><description><![CDATA[char s[];]]></description><category></category></item><item><title><![CDATA[C++中.h和.cpp的关系]]></title><link>https://blog.youkuaiyun.com/Praker/article/details/38231757</link><guid>https://blog.youkuaiyun.com/Praker/article/details/38231757</guid><author>Praker</author><pubDate>Tue, 29 Jul 2014 09:24:09 +0800</pubDate><description><![CDATA[C++中，一般把类的定义放到tou]]></description><category></category></item><item><title><![CDATA[C程序设计语言(K&R)第一章学习笔记]]></title><link>https://blog.youkuaiyun.com/Praker/article/details/38236665</link><guid>https://blog.youkuaiyun.com/Praker/article/details/38236665</guid><author>Praker</author><pubDate>Mon, 28 Jul 2014 20:48:30 +0800</pubDate><description><![CDATA[#include 

/*print Fahrenheit-Celsius table for fahr=0,20,...,300;floating-point version*/
int main()
{
	float fahr,celsius;
	float lower,upper,step;

	lower = 0;              /*lower limit of tempera]]></description><category></category></item><item><title><![CDATA[容器]]></title><link>https://blog.youkuaiyun.com/Praker/article/details/38171991</link><guid>https://blog.youkuaiyun.com/Praker/article/details/38171991</guid><author>Praker</author><pubDate>Mon, 28 Jul 2014 15:59:22 +0800</pubDate><description><![CDATA[容器是用来存储和组织]]></description><category></category></item><item><title><![CDATA[typedef]]></title><link>https://blog.youkuaiyun.com/Praker/article/details/38120849</link><guid>https://blog.youkuaiyun.com/Praker/article/details/38120849</guid><author>Praker</author><pubDate>Sun, 27 Jul 2014 11:05:11 +0800</pubDate><description><![CDATA[用typedef声明一个新的类型名来代替已有的类型名
type]]></description><category></category></item><item><title><![CDATA[类模板]]></title><link>https://blog.youkuaiyun.com/Praker/article/details/38109129</link><guid>https://blog.youkuaiyun.com/Praker/article/details/38109129</guid><author>Praker</author><pubDate>Sat, 26 Jul 2014 09:55:22 +0800</pubDate><description><![CDATA[template]]></description><category></category></item></channel></rss>