workdog的专栏

  //#include //#include //#include #include //#include #define MAXSIZE 20 //排序表的最大容量typedef struct //定义排序表的结构{ int elemword[MAXSIZE]; //数据元素关键字 int count; //表中当前元素的个数}SqList;void InitialSqList(S

//#include //#include //#include #include //#include #define MAXSIZE 20 //排序表的最大容量typedef struct //定义排序表的结构{ int elemword[MAXSIZE]; //数据元素关键字 int count; //表中当前元素的个数}SqList;void InitialSqList(SqL

You are consulting for a game show in which n contestants are pitted against n gladiators in order to see which contestants are the best. The game show aims to rank the contestants in order of strengt

Alice has an array , and Bob has an array . All elements in A and B are distinct. Alice and Bob are interested in finding the median element of their combined arrays. That is, they want to determine w

  //#include //#include //#include #include //#include #define MAXSIZE 20 //排序表的最大容量typedef struct //定义排序表的结构{ int startword[MAXSIZE]; //数据元素关键字 int endword[MAXSIZE]; //结果数据段 int count; //表中当前元素

[code]/*-----------------------------------------------------------RB-Tree的插入和删除操作的实现算法参考资料:1) >2) >3) sgi-stl中stl_tree.h中的实现算法4) http://epaperpress.com/sortsearch/index.html5) http://www.ececs.uc.e

MD5算法详细介绍 大家知道MD5吗？我不多说了，玩密码首先要知道它了 MD5 叫信息－摘要算法，是一种密码的算法，它可以对任何文件产生一个唯一的MD5验证码，每个文件的MD5码就如同每个人的指纹一样，都是不同的，这样，一旦这个文件在传输过程中，其内容被损坏或者被修改的话，那么这个文件的MD5码就会发生变化，通过对文件MD5的验证，可以得知获得的文件是否完整 md5 的全称是message-dig