Description: 印鉴鉴定系统的算法代码，使用的时候直接在需要的地方插入该算法代码就可以了-Seal Identification System algorithm code, the use of the direct needs of the local insertion algorithm code on the Platform: |
Size: 4409 |
Author:丁玉红 |
Hits:
Description: 此代码用来求解建立点的凸闭包多边形，采用凸闭包插入算法建立Delaunay三角网可以用到或参考。-this code to solve the establishment point of closure convex polygon, using convex closure insertion algorithm to establish Delaunay triangulation can be used as reference. Platform: |
Size: 2913 |
Author:hlzhangrui |
Hits:
Description: 创建一棵二叉排序树，并采用中序遍历和层次遍历法输出其顶点序列，主要实验内容如下：
1. 定义二叉排序树的结构BiTree；
2. 编制二叉排序树的插入算法：void Insert_SortTree (BiTree ST, ElemType x)；
3. 编制中序遍历函数；
4. 在main()函数中完成二叉排序树的建立，以及中序遍历的输出。（二叉排序树的各个元素从键盘输入，并利用Insert_SortTree()函数进行插入建立）；
5. 编制层次遍历函数，并在main()函数中完成层次遍历的输出。层次遍历法要利用“队列”来实现；为此需要定义一个队列结构（可以采用链队列，也可以采用循环顺序队列），并实现相关的队列函数。
-create a binary sort tree, and used the preorder and output levels traversal sequence its peak, the main contents are as follows : 1. Sort definition of two fork BiTree tree structure; 2. Ranking compiled binary tree insertion algorithm : void Insert_SortTree (BiTree ST ElemType x); 3. establishment preorder function; 4. in the main () function to complete binary tree in order to establish, and the Central preorder output. (2 forks ranking tree various elements from the keyboard input, and the use of Insert_SortTree () function to insert the establishment); 5. Traversing the preparation level functions, and the main () function to complete traverse the output level. Level traversal to using "queue" to achieve; This requires definition of a cohort structure (Queue chain can be use Platform: |
Size: 15247 |
Author:段苛苛 |
Hits:
Description: 数组排序算法,这个程序的头文件中包含四种排序方法：泡沫排序法（bubble），插入排序法（insertion），快速排序法（quick）和选择排序法（selection）。头文件中还使用了模板技术，以便可以同时实现几种类型的排序算法--Array sorting algorithm, its head files include four sorting methods:bubble sorting method (bubble), insertion sorting method(insertion), quickly sorting method (quick) and selection sorting method (selection). In head files has also used the template technology to realize several kinds of sorting algorithms at the same time. Platform: |
Size: 454656 |
Author:站长 |
Hits:
Description: 分别实现直接插入排序、冒泡排序、简单选择排序、希尔排序、快速排序、堆排序，并随机生成30个数，比较各算法的时、空性能和稳定性。-respectively direct insertion sort, bubble sort, simple choice, in order of ranking Hill, the quick sort, heap sort, and Random Number Generation 30, a comparison algorithm, the performance and stability of the air. Platform: |
Size: 342016 |
Author:李景良 |
Hits:
Description: implementation of insertion sort algorithm and its computational cost. it is testing on arrays of lenghts differents Platform: |
Size: 1024 |
Author:Joan Talles |
Hits:
Description: 算法设计的实验报告
包括Bottom-Up Merge Sorting算法、插入排序算法Heaps的创建堆、堆排序算法、按秩合并算法以及带路径压缩算法、实现查找第K小元素算法、实现快速排序算法、实现平面内最接近点对算法、实现最长公共子序列算法、实现矩阵链相乘算法、实现0/1背包问题算法、实现Dijistra’s算法、Prim算法、Kruskal算法、文件压缩算法-Experimental Algorithm Design Report including Bottom-Up Merge Sorting Algorithm, Insertion Sort algorithm creation Heaps Heap, Heap Sort algorithm, according to rank and merge algorithm with path compression algorithm to find the first small element K algorithm, the realization of quick sort algorithm, the realization of planar within the nearest point on the algorithm to achieve the longest common sub-sequence algorithm, the realization of matrix-chain multiplication algorithm, the realization of 0/1 knapsack problem algorithm Dijistra s algorithm, Prim algorithm, Kruskal algorithm, file compression algorithm Platform: |
Size: 28672 |
Author:苏宁 |
Hits:
Description: Insertion sort is a simple sorting algorithm: a comparison sort in which the sorted array (or list) is built one entry at a time. It is much less efficient on large lists than more advanced algorithms such as quicksort, heapsort, or merge sort Platform: |
Size: 1024 |
Author:irisrd |
Hits:
Description: 顺序表的插入算法，将x插入到顺序表中，且不改变顺序表原来的顺序-Insertion algorithm sequence table, the x is inserted into the sequence table, the table does not change the order of the original order Platform: |
Size: 886784 |
Author:张三 |
Hits:
Search - insertion algorithm