-
8_queen
8_queen问题的一个自创的算法，还不错！(8_queen)
- 2009-10-21 11:49:24下载
- 积分：1
-
EightQueens
数据结构与程序设计中的重点例子程序：八皇后问题(Data structure and procedures of the focus of the design example of the procedure: eight queen problem)
- 2009-06-29 14:52:11下载
- 积分：1
-
sort
数据结构中数据的排序示例,包括堆排序、快速排序等(Data structure to sort the data sample, including the heap sort, quick sort, etc.)
- 2008-06-14 20:52:24下载
- 积分：1
-
list-and-array
数组的定义与使用，数组的运算，字符串的输入与输出，冒泡排序(list and array)
- 2013-10-17 11:32:30下载
- 积分：1
-
Kruskal
克鲁斯卡尔算法思想.cpp
int seekedge(EDGE * (&a), int n)
void bubble(EDGE * (&a), int size)
void searchandjoin(EDGE * (&a1), int k) // a1是图边集头指针，a2是最小生成树边集的头指针，k为所要删的边
void storepicture(EDGE * (&a), int n, VERTEX *b, int m) (Thinking of Kruskal algorithm. Cpp int seekedge (EDGE* (& a), int n) void bubble (EDGE* (& a), int size) void searchandjoin (EDGE* (& a1), int k) // a1 edge set is the first pointer map, a2 is the minimum spanning tree of the first indicators margination, k for the edges to be deleted void storepicture (EDGE* (& a), int n, VERTEX* b, int m) )
- 2009-06-27 01:43:39下载
- 积分：1
-
ECSBL
说明： 该程序实现二叉树的遍历功能，能够打印出二叉树的节点(The program realization of the binary tree traversal function, is capable of printing out the binary tree node)
- 2008-11-13 15:50:49下载
- 积分：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
-
a
说明： 进程死锁.资源分配图的绘制 建立所需数据结构；
使用题目21存成的资源分配图的文件作为输入；
编写资源分配图化简算法；
每化简一步，在屏幕上显示化简的当前结果；
最后给出结论，是否死锁，如思索给出死锁的进程及资源；
(Process deadlock. Resource allocation mapping establish the required data structures Use title 21 deposit into resource allocation graph file as input writing resource allocation map simplification algorithm Each simplification step, on-screen display simplification of the current result Finally, the conclusion of a deadlock, deadlock is given as thinking processes and resources )
- 2013-07-04 19:50:58下载
- 积分：1
-
太阳能电池参数计算器 升级版
太阳能电池参数计算，可以快速方便计算电流，电压，填充因子等参数(Solar cell parameter calculation)
- 2017-11-23 21:30:46下载
- 积分：1
-
BinaryTree
c++数据结构中的二分查找树，是比较基本的数据查找结构，查找效率比较高(c++ data structure in the binary search tree, is a more basic data to find the structure to find more efficient)
- 2009-10-31 20:04:38下载
- 积分：1
