Location:
Search - sort st
Search list
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: 文件搜索系统 智能排序
可以按文件内容或文件名搜索，并且可以按文件名，修改日期... ...排序
当初学校java实训的项目 那时侯不知道有LinkedList竟然自己花了3天时间自己写了的LinkList
有什么问题请和我联系
QQ:281284015
Email:ibm_chen@163.com
-document search system for smart scheduling according to the contents of the documents or file name search, as well as by file name Update ... ... Sort java Training schools in the first place then the item Hou do not know LinkedLi st has spent his three days of himself wrote a LinkList any question, please contact me and QQ : 281284015 Email : ibm_chen@163.com
Platform: |
Size: 20084 |
Author: chenmin |
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: 15360 |
Author: 段苛苛 |
Hits:
Description: 文件搜索系统 智能排序
可以按文件内容或文件名搜索，并且可以按文件名，修改日期... ...排序
当初学校java实训的项目 那时侯不知道有LinkedList竟然自己花了3天时间自己写了的LinkList
有什么问题请和我联系
QQ:281284015
Email:ibm_chen@163.com
-document search system for smart scheduling according to the contents of the documents or file name search, as well as by file name Update ... ... Sort java Training schools in the first place then the item Hou do not know LinkedLi st has spent his three days of himself wrote a LinkList any question, please contact me and QQ : 281284015 Email : ibm_chen@163.com
Platform: |
Size: 19456 |
Author: chenmin |
Hits:
Description: STL sort（）函数使用详细介绍
包含ＳＴＬ算法介绍文档-STL sort () function using the STL algorithm contains a detailed introduction introduction document
Platform: |
Size: 2571264 |
Author: 朱明悦 |
Hits:
Description: 这个双重循环完成按字母顺序排序的工作。在外层循环中把字符数组cs[i]中的国名字符串拷贝到数组st中，并把下标i赋予P。进入内层循环后，把st与cs[i]以后的各字符串作比较，若有比st小者则把该字符串拷贝到st中，并把其下标赋予p。内循环完成后如p不等于i说明有比cs[i]更小的字符串出现，因此交换cs[i]和st的内容。至此已确定了数组cs的第i号元素的排序值。然后输出该字符串。在外循环全部完成之后即完成全部排序和输出。-The double circle in alphabetical order to complete the work order. In the outer circle of the character array cs [i] in the name of the string copied to the array of st, and the subscript i given P. After entering the inner circle, the st and cs [i] after the string to compare, if slightly smaller than st copy of the string to the st, and given its subscript p. After the completion of internal circulation, such as p does not mean that i stated that there were more than cs [i] string appear smaller, so the exchange of cs [i] and the content of st. This has identified cs array element i of the first sort value. And then output the string. Outer circle that is completed after the completion of all the sorting and output.
Platform: |
Size: 3072 |
Author: lili |
Hits:
Description: The selection sort improves on the bubble sort by making only one exchange for every pass through the list. In order to do this, a selection sort looks for the largest value as it makes a pass and, after completing the pass, places it in the proper location. As with a bubble sort, after the first pass, the largest item is in the correct place. After the second pass, the next largest is in place. This process continues and requires n− 1 passes to sort n items, since the final item must be in place after the (n− 1) st pass.
Platform: |
Size: 17408 |
Author: waqas |
Hits: