-
Strassen-code
思塞恩算法
常用算法之一
算法导论提及(strassen algorithm which can run correctly)
- 2014-11-28 14:33:16下载
- 积分:1
-
RBtree
使用C++/C语言实现的红黑树,对于数据结构的学习有所帮助。(Use red-black tree C++/C language for learning data structures helpful.)
- 2014-05-16 16:09:57下载
- 积分:1
-
huffman_src22
本代码提供一种非常简单且快速的哈夫曼编码方法。
(this code provide a very simple and rapid method of Huffman coding.)
- 2007-06-15 16:02:25下载
- 积分:1
-
sorting
该文件描述了排序算法的实验指导报告,通过本实验,你可以了解插入排序、选择排序、希尔排序、堆排序、冒泡、双向冒泡、快速排序、归并排序、递归的归并排序、基数排序等多种排序方法的实验(The document describes the experimental guidance of the sorting algorithm, through this experiment, you can learn about the insertion sort, selection sort, shell sort, heap sort, bubble, two-way bubble, quick sort, merge sort, merge sort recursive basesorting a variety of sorting methods experiment
)
- 2012-06-08 11:28:55下载
- 积分:1
-
migong
输入迷宫行列数,1代表墙0代表路,之后系统生成路径(Enter the maze ranks number 1 represents 0 for Wall Road, after the system-generated path)
- 2016-05-14 20:16:00下载
- 积分:1
-
main5
编写一个将二叉树的所有叶子结点从左向右链接成单链表的算法(Write a binary tree leaf nodes from left to right links into a single linked list algorithm)
- 2012-10-07 23:52:44下载
- 积分:1
-
Work3.5
上海交通大学数据结构课程的课后作业系列3.5:仅供参考,最好还是自己去写(Shanghai Jiaotong University data structure course homework Series 3.5: for reference, it is best to write their own)
- 2013-12-27 21:00:03下载
- 积分:1
-
xiererfenchazhao
希尔排序c++数据结构算法
二分查找的递归算法(希尔排序c++数据结构算法
二分查找的递归算法
)
- 2010-12-10 18:32:52下载
- 积分:1
-
12
说明: 哈希表,用c++语言编写,可操作运行,结果正确(Hash table, using c++ language, operational run, the results are correct)
- 2011-05-06 14:42:14下载
- 积分:1
-
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