-
maopao_youhua
冒泡优化：
如果一个序列是int n[]={1,2,3,4,5,6,7,8,9} , 用正常的冒泡排序需要排8次才行，优化之后1次就好，也就是说序列越接近于正常序列，改进之后的冒泡排序的次数就越少，这样会给一个冒泡排序算法带了很大的效率。
思想：添加一个boolean变量用来判断冒泡是否是已经排好了顺序，如果boolean的值为false，说明是已经排好了，如果boolean的值true，说明没有排好，继续排。(If a sequence is int n [] = {, 1,2,3,4,5,6,7,8,9} need to row 8 times the job after optimization times like normal bubble sort, but alsomeans that the sequence is more close to the normal sequence, improved bubble sort, the less the number, which would give a bubble sort algorithm with a great deal of efficiency.
Idea: add a boolean variable used to determine the bubble whether it is already lined up the order, if the boolean is false, indicating already lined up, if the boolean value of true, did not line up, continue to row.)
- 2012-04-18 00:33:45下载
- 积分：1
-
Birch
这是birch C语言的源代码。里面有详细的代码注释方便学习birch算法(birch c)
- 2012-05-08 09:00:44下载
- 积分：1
-
yuesehuhuan
就是一个简单的约瑟夫环实现程序。主要就是在痛过程序实现栈的实现。(Joseph is a simple procedure to achieve ring. The main program is in pain over the realization of the realization of the stack.)
- 2007-11-22 11:35:10下载
- 积分：1
-
Lecture7
数据结构中插入排序，堆栈排序等的用法还有希尔排序(Data structure insertion sort, stack, sort, etc. use well sorted Hill)
- 2011-07-27 15:31:31下载
- 积分：1
-
jiajianfa
长整数四则运算,利用双向循环链表实现长整数的存储，每个结点含一个整形变量。
(Long integer arithmetic, the use of two-way circular linked list to achieve long integer storage, each node contains an integer variable.)
- 2014-05-29 14:41:51下载
- 积分：1
-
tongxunlu20
具有数据插入、修改、删除、显示、和查询功能的电话簿管理程序。
数据包括：人名、工作单位、电话号码、和E-mail地址。
可对记录中的姓名和电话号码进行修改。
可增加或删除记录。
可显示所有保存的记录。
可按人名或电话号码进行查询。
附加功能：
可修改单个记录的各项内容。
可重新建立电话簿。
可按人名或号码进行排序。
可统计名片数目及可再添加数目。
可插入单个名片并不破坏原有顺序(With the data to insert, modify, delete, display, and query functions of the phone book management program. The data include: the names, work units, phone number, and E-mail address. Can be modified to record the name and phone number. Increase or delete records. You can display all the records kept. According to the names or telephone number for queries. Additional features: you can modify the content of a single record. Can re-establish a Phonebook. According to the names or numbers to be sorted. Statistical card number and add the number. Insert a single card does not destroy the original order)
- 2012-05-28 12:48:27下载
- 积分：1
-
约瑟夫环的循环链表实现
约瑟夫环的循环链表实现，这个程序比较完整，有需要做试验的请速速下载。(Josephus cycle Chain achieved, the procedure is complete, the pilot needs to be done urgently requested to download.)
- 2005-07-03 19:38:38下载
- 积分：1
-
BinaryTree
数据结构使用三叉链表表示的二叉树的基本操作(Data structures using the binary tree expressed in the trigeminal lists the basic operation of)
- 2010-06-26 10:51:43下载
- 积分：1
-
shujujiegoukechengshiji
数据结构课程设计时，所需的封面及任务书版面，希望对大家有点用！(Curriculum design data structure, the necessary task of the book cover and layout, in the hope that we are a bit used!)
- 2008-06-16 18:38:51下载
- 积分：1
-
Eight-Digital
说明： 八数码 对任意数字序列重新排序 高级散列函数 MFC基础编程(Eight Digital
Reorder the sequence of any number
Senior hash function
MFC based programming)
- 2011-04-11 16:31:59下载
- 积分：1
