<?xml version="1.0" encoding="utf-8" ?><rss version="2.0"><channel><title><![CDATA[suilingxi的专栏]]></title><description><![CDATA[]]></description><link>https://blog.youkuaiyun.com/suilingxi</link><language>zh-cn</language><generator>https://blog.youkuaiyun.com/</generator><copyright><![CDATA[Copyright &copy; suilingxi]]></copyright><item><title><![CDATA[很好的python教程]]></title><link>https://blog.youkuaiyun.com/suilingxi/article/details/61620889</link><guid>https://blog.youkuaiyun.com/suilingxi/article/details/61620889</guid><author>suilingxi</author><pubDate>Sun, 12 Mar 2017 16:53:56 +0800</pubDate><description><![CDATA[http://www.kanbuchuan.com/page/1/archives/2280.html#comments]]></description><category></category></item><item><title><![CDATA[signal]]></title><link>https://blog.youkuaiyun.com/suilingxi/article/details/19337987</link><guid>https://blog.youkuaiyun.com/suilingxi/article/details/19337987</guid><author>suilingxi</author><pubDate>Mon, 17 Feb 2014 15:31:11 +0800</pubDate><description><![CDATA[a signal is an event generated by the UNIX and LINUX systems in response to some condition , upon reveipt of which a process may in turn take some action,.there are so many signals which is included i]]></description><category></category></item><item><title><![CDATA[thread]]></title><link>https://blog.youkuaiyun.com/suilingxi/article/details/19337847</link><guid>https://blog.youkuaiyun.com/suilingxi/article/details/19337847</guid><author>suilingxi</author><pubDate>Mon, 17 Feb 2014 15:29:01 +0800</pubDate><description><![CDATA[what is a thread? multiple strands of execution in a single program are called threads. a more precise definition is that a thread is a sequence of control within a process. compared with process , th]]></description><category></category></item><item><title><![CDATA[process]]></title><link>https://blog.youkuaiyun.com/suilingxi/article/details/19337701</link><guid>https://blog.youkuaiyun.com/suilingxi/article/details/19337701</guid><author>suilingxi</author><pubDate>Mon, 17 Feb 2014 15:26:42 +0800</pubDate><description><![CDATA[after the introdution about the fork() function ,  i do think that you have find that the result these two process print is so messy , how to make it neat , let do it now.

in  > there are three fun]]></description><category></category></item><item><title><![CDATA[segment fault]]></title><link>https://blog.youkuaiyun.com/suilingxi/article/details/19137913</link><guid>https://blog.youkuaiyun.com/suilingxi/article/details/19137913</guid><author>suilingxi</author><pubDate>Wed, 12 Feb 2014 23:55:18 +0800</pubDate><description><![CDATA[一 造成segment fault，产生core dump的可能原因

1.内存访问越界

 a) 由于使用错误的下标，导致数组访问越界

 b) 搜索字符串时，依靠字符串结束符来判断字符串是否结束，但是字符串没有正常的使用结束符

 c) 使用strcpy, strcat, sprintf, strcmp, strcasecmp等字符串操作函数，将目标字符串读/写爆。应该使用st]]></description><category></category></item><item><title><![CDATA[fork函数分析举例]]></title><link>https://blog.youkuaiyun.com/suilingxi/article/details/18951665</link><guid>https://blog.youkuaiyun.com/suilingxi/article/details/18951665</guid><author>suilingxi</author><pubDate>Thu, 06 Feb 2014 18:07:07 +0800</pubDate><description><![CDATA[as we all know the exec() family function can only take the executable file to create a new process which replace the original one even the PID is the same to the original one, in contrast the fork fu]]></description><category></category></item><item><title><![CDATA[execve系统调用分析]]></title><link>https://blog.youkuaiyun.com/suilingxi/article/details/18949597</link><guid>https://blog.youkuaiyun.com/suilingxi/article/details/18949597</guid><author>suilingxi</author><pubDate>Thu, 06 Feb 2014 14:54:06 +0800</pubDate><description><![CDATA[execve系统调用分析













来源: ChinaUnix博客 　日期： 2007.02.15 12:29　(共有条评论) 我要评论


 


Linux提供了execl、execlp、execle、execv、execvp和execve等六个用以执行一个可执行文件的函数（统称为exec函数，其间的差异在于对命令行参数和环境变量参数的传]]></description><category></category></item><item><title><![CDATA[linux 服务器监控工具]]></title><link>https://blog.youkuaiyun.com/suilingxi/article/details/18902191</link><guid>https://blog.youkuaiyun.com/suilingxi/article/details/18902191</guid><author>suilingxi</author><pubDate>Sun, 02 Feb 2014 21:24:57 +0800</pubDate><description><![CDATA[下面是我想呈现给你的4个强大的监控工具。

htop – 交互式进程查看器

你可能知道在机器上查看实时进程的标准工具top。如果不知道，请运行$ top看看，运行$ man top阅读帮助手册。

htop是top的扩展版本，有更丰富的概貌（例如全命令、可视化、图形用户界面gui和用户界面ui），有鼠标点击交互（译者注：看下面的截图，指的是最上面的列标题如CPU%、MEM%等可以通过]]></description><category></category></item><item><title><![CDATA[begin linux programming]]></title><link>https://blog.youkuaiyun.com/suilingxi/article/details/18893957</link><guid>https://blog.youkuaiyun.com/suilingxi/article/details/18893957</guid><author>suilingxi</author><pubDate>Sat, 01 Feb 2014 13:35:48 +0800</pubDate><description><![CDATA[Recently,i begin to learn programming in linux , so i choose the book with the name of > as my first book of exploiting programming under linux . here , i will list some of the basic operations under]]></description><category></category></item><item><title><![CDATA[基于链表实现队列]]></title><link>https://blog.youkuaiyun.com/suilingxi/article/details/18860071</link><guid>https://blog.youkuaiyun.com/suilingxi/article/details/18860071</guid><author>suilingxi</author><pubDate>Wed, 29 Jan 2014 08:21:08 +0800</pubDate><description><![CDATA[#ifndef LINK_QUEUE_H
#define LINK_QUEUE_H

struct linkqueue{
	struct linkqueue * next;
	int content;
};

struct linkqueue * pop();
void push(struct linkqueue * p);
void display();
void init(int * arra]]></description><category></category></item><item><title><![CDATA[基于链表实现堆栈]]></title><link>https://blog.youkuaiyun.com/suilingxi/article/details/18848885</link><guid>https://blog.youkuaiyun.com/suilingxi/article/details/18848885</guid><author>suilingxi</author><pubDate>Tue, 28 Jan 2014 22:09:13 +0800</pubDate><description><![CDATA[#ifndef LINK_STACK_H
#define LINK_STACK_H

struct linkstack{
	struct linkstack * next;
	int content;
};
void display();
void push(struct linkstack * node);
struct linkstack * pop();
void init(int * ar]]></description><category></category></item><item><title><![CDATA[排序二叉树的构造与遍历]]></title><link>https://blog.youkuaiyun.com/suilingxi/article/details/18840679</link><guid>https://blog.youkuaiyun.com/suilingxi/article/details/18840679</guid><author>suilingxi</author><pubDate>Tue, 28 Jan 2014 12:07:25 +0800</pubDate><description><![CDATA[#ifndef SORT_BINARY_TREE_H
#define SORT_BINARY_TREE_H

struct sbt{
struct sbt * left;
struct sbt * right;
int content;
};

struct sbt * init(int * p ,int n);
struct sbt * compare(struct sbt * root , s]]></description><category></category></item><item><title><![CDATA[完全二叉树的构造与遍历]]></title><link>https://blog.youkuaiyun.com/suilingxi/article/details/18818547</link><guid>https://blog.youkuaiyun.com/suilingxi/article/details/18818547</guid><author>suilingxi</author><pubDate>Mon, 27 Jan 2014 19:02:45 +0800</pubDate><description><![CDATA[#ifndef BinaryTree_H_
#define BinaryTree_H_

struct binarytree {
	struct binarytree * left;
	struct binarytree * right;
	char content;
};

int length(char * array);
struct binarytree * init(char * p ,]]></description><category></category></item><item><title><![CDATA[josephus problem]]></title><link>https://blog.youkuaiyun.com/suilingxi/article/details/18809407</link><guid>https://blog.youkuaiyun.com/suilingxi/article/details/18809407</guid><author>suilingxi</author><pubDate>Mon, 27 Jan 2014 09:49:57 +0800</pubDate><description><![CDATA[#include 
#include 
struct node {
	int num;
	struct node * next;
};

int main(){
	int N;
	int M;
	printf("please enter the nubmer of N:\n");
	scanf("%d",&N);
	printf("please enter the nubmer of M:\n")]]></description><category></category></item><item><title><![CDATA[字符串字面值]]></title><link>https://blog.youkuaiyun.com/suilingxi/article/details/18713039</link><guid>https://blog.youkuaiyun.com/suilingxi/article/details/18713039</guid><author>suilingxi</author><pubDate>Thu, 23 Jan 2014 19:57:16 +0800</pubDate><description><![CDATA[一、字符串字面值
字符串字面值是一串常量字符，字符串字面值常量用双引号括起来的零个或多个字符表示，为兼容C语言，C++中所有的字符串字面值都由编译器自动在末尾添加一个空字符。
字符串没有变量名字，自身表示自身

"Hello World!" //simple string literal
"" //empty string literal
"\nCC\toptions\tfile.[cC]]]></description><category></category></item><item><title><![CDATA[快速排序]]></title><link>https://blog.youkuaiyun.com/suilingxi/article/details/18311149</link><guid>https://blog.youkuaiyun.com/suilingxi/article/details/18311149</guid><author>suilingxi</author><pubDate>Wed, 15 Jan 2014 15:02:15 +0800</pubDate><description><![CDATA[#include 

/*
 *speed sort
 *author @ suilingxi
 *2014-1-15
*/

void speed_sort(int * array , int high ,int low){

	/* record the position of the array we want to sort */
	int i=low;
	int j=high;
	int]]></description><category></category></item><item><title><![CDATA[冒泡排序算法]]></title><link>https://blog.youkuaiyun.com/suilingxi/article/details/18190481</link><guid>https://blog.youkuaiyun.com/suilingxi/article/details/18190481</guid><author>suilingxi</author><pubDate>Sun, 12 Jan 2014 21:06:18 +0800</pubDate><description><![CDATA[]]></description><category></category></item><item><title><![CDATA[折半插入排序算法]]></title><link>https://blog.youkuaiyun.com/suilingxi/article/details/18187489</link><guid>https://blog.youkuaiyun.com/suilingxi/article/details/18187489</guid><author>suilingxi</author><pubDate>Sun, 12 Jan 2014 18:46:25 +0800</pubDate><description><![CDATA[#include 

/*
 *binary insert sort algorithm
 *author @ suilingxi
 *2014-1-11
*/
int  binary_insert_sort(int * array , int low , int high , int mdm){
	
	while(low<=high){
		if(mdm<*(array+(high+low)/2]]></description><category></category></item><item><title><![CDATA[直接插入排序算法]]></title><link>https://blog.youkuaiyun.com/suilingxi/article/details/18179779</link><guid>https://blog.youkuaiyun.com/suilingxi/article/details/18179779</guid><author>suilingxi</author><pubDate>Sun, 12 Jan 2014 10:46:56 +0800</pubDate><description><![CDATA[]]></description><category></category></item><item><title><![CDATA[rsync 的核心算法]]></title><link>https://blog.youkuaiyun.com/suilingxi/article/details/18037787</link><guid>https://blog.youkuaiyun.com/suilingxi/article/details/18037787</guid><author>suilingxi</author><pubDate>Thu, 09 Jan 2014 12:39:03 +0800</pubDate><description><![CDATA[rsync是unix/linux下同步文件的一个高效算法，它能同步更新两处计算机的文件与目录，并适当利用查找文件中的不同块以减少数据传输。rsync中一项与其他大部分类似程序或协定中所未见的重要特性是镜像是只对有变更的部分进行传送。rsync可拷贝／显示目录属性，以及拷贝文件，并可选择性的压缩以及递归拷贝。rsync利用由Andrew
 Tridgell发明的算法。这里不介绍其使用方法，只介绍其]]></description><category></category></item></channel></rss>