上一页 1 ··· 5 6 7 8 9 10 11 12 13 ··· 21 下一页
摘要: How to stretch the life of your SSD storageJuly 18, 2013, 9:06 PM—Once a PC enthusiast's dream storage device, the solid-state drive (SSD) is quickly becoming commonplace in custom PC builds and retail desktops alike. After takinga detailed look at SSD technology, we're moving on to basic ca 阅读全文
posted @ 2013-07-20 15:04 net小伙 阅读(315) 评论(0) 推荐(0) 编辑
摘要: July 17, 2013, 6:29 AM—China's Internet populace grew to 591 million by the end of June, as more new users in the country relied on handsets to go online, according to a non-profit research group.The growth raises China's Internet penetration by two percentage points to 44 percent, the gover 阅读全文
posted @ 2013-07-18 18:17 net小伙 阅读(246) 评论(0) 推荐(0) 编辑
摘要: Microsoft addresses DevOps with InRelease technologyA Microsoft-branded version of InRelease will be available by year's end, the company promisedJuly 12, 2013, 7:24 PM—Microsoft has completed its purchase of InCycle's InRelease business unit,announced in June, and is now deploying the softw 阅读全文
posted @ 2013-07-15 18:40 net小伙 阅读(302) 评论(0) 推荐(0) 编辑
摘要: 排序二叉树即在构建二叉树的时候就对二叉树进行排序了,当中序遍历二叉树的时候即可得到一个有序的数列; 排序二叉树的规则就是: 若他的左子树不空,则左子树上所有结点的值均小于它的根结构的值; 若他的右子树不空,则右子树上所有结点的值均大于它的根结点的值; 它的左、右子树也分别为二叉排序树; 从二叉排序树的定义也可以知道,它前提是二叉树,然后它采用了递归的定义方法,再者,它的结点间满足一定得次序关系,左子树结点一定比其双亲结点小,右子树结点一定比其双亲结点打。 代码实现如下: 1 void Create_Sort_Tree(BiTree **t, int value) 2 { 3 ... 阅读全文
posted @ 2013-06-28 21:57 net小伙 阅读(2882) 评论(0) 推荐(0) 编辑
摘要: 二叉树的数据结构:1 typedef struct BiTree{2 char item;3 struct BiTree *lchild,*rchild;4 }BiTree; 构建一个二叉树: 为了能让每个结点确认是否有左右孩子,我们要对二叉树进行扩展,变成上图的样子。也就是,将二叉树的每个结点的空指针引出的一个虚节点,其值为一特定值,比如“1”。我们称这种处理后的二叉树为原二叉树的扩展二叉树。 有了扩展二叉树就可以进行二叉树的构建了,笔者选择的是先序构建二叉树: 1 void CreateBiTree(BiTree **T) 2 { 3 char ch; 4... 阅读全文
posted @ 2013-06-28 18:40 net小伙 阅读(1494) 评论(1) 推荐(1) 编辑
摘要: 头插法逆置单向链表 1 #include 2 #include 3 4 typedef struct node{ 5 int item; 6 struct node *next; 7 }node; 8 9 void list_show(node *);10 11 //创建一个长度为10的链表12 node *creat_node_list()13 {14 node *h,*p,*l;15 int n = 10;16 h = (node *)malloc(sizeof(node));17 h->item = 10;18 h->nex... 阅读全文
posted @ 2013-06-24 18:09 net小伙 阅读(448) 评论(0) 推荐(0) 编辑
摘要: ;Configuration of http[http]doamin=www.mysite.comport=8080cgihome=/cgi-bin;Configuration of db[database]server = mysqluser = mynamepassword = toopendatabase转换为: 1 2 3 www.mysite.com 4 8080 5 /cgi-bin 6 7 8 9 10 mysql11 myname12 toopendatabase13 1 #include 2 #include 3 #include 4 #include 5... 阅读全文
posted @ 2013-06-24 01:19 net小伙 阅读(2631) 评论(0) 推荐(0) 编辑
摘要: 编程读写一个文件test.txt,每隔1秒向文件中写入一行记录,类似于这样:1 2009-7-30 15:16:422 2009-7-30 15:16:43该程序应该无限循环,直到按Ctrl-C终止。下次再启动程序时在test.txt文件末尾追加记录,并且序号能够接续上次的序号,比如:1 2009-7-30 15:16:422 2009-7-30 15:16:433 2009-7-30 15:19:024 2009-7-30 15:19:035 2009-7-30 15:19:04 1 #include 2 #include 3 #include 4 #include 5 #inclu... 阅读全文
posted @ 2013-06-23 17:48 net小伙 阅读(1075) 评论(0) 推荐(0) 编辑
摘要: 下面的说明摘自于最新的Linux内核2.6.29,说明了strtok()这个函数已经不再使用,由速度更快的strsep()代替/** linux/lib/string.c** Copyright (C) 1991, 1992 Linus Torvalds*//** stupid library routines.. The optimized versions should generally be found* as inline code in ** These are buggy as well..** * Fri Jun 25 1999, Ingo Oeser * - Added st 阅读全文
posted @ 2013-06-22 17:21 net小伙 阅读(490) 评论(0) 推荐(0) 编辑
摘要: 写代码之前要先介绍一下可变参数的备用知识; C函数要在程序中用到以下这些宏: void va_start( va_list arg_ptr, prev_param ); type va_arg( va_list arg_ptr, type ); void va_end( va_list arg_pt 阅读全文
posted @ 2013-06-21 16:47 net小伙 阅读(340) 评论(0) 推荐(0) 编辑
上一页 1 ··· 5 6 7 8 9 10 11 12 13 ··· 21 下一页