bag1

说明：  数据结构中的顺序表，是其中的一个重要组成部分(The order of the table data structure is an important component of which)

根据所选定的字符顺序，按照从大到小的规则，对字符进行插入排序，(Insert and sort characters)

数据结构相关代码，源码-数据结构算法解析(高一凡 )(Data structure-related code, source code- Data Structure Analysis algorithm (high one where))

说明：  c编写的链表连接函数，上课时学的，上传试试 (c write the list to connect function, class, learn, try uploading)

单链表是C经典数据结构算法和数据结构，希望这对大家学习有点用(Classic single-linked list data structure in C algorithms and data structures, which we hope to learn a little bit with)

采用Kruskal算法求最小生成树主要数据结构 edgeset GE 存放图中的所有边 int n,int e 存放图中的顶点数与边数 edgeset C 存放生成树中的边 vexlist gv 图中结点的顶点值 adjmatrix s 用来处理图中结点的查找与合并 int m1,m2 一条边上两顶点所属集合的序号 int k 最小生成树中的边数 int d //图中待扫描边元素的下标(For the Minimum Spanning Tree by Kruskal main data structures edgeset GE store all edges in the figure int n, int e store graph vertices and edges edgeset C storage spanning tree edges in the vexlist gv graph node vertex values ​ ​ adjmatrix s used to process graph node to find and merge int m1, m2 an edge belongs to the set number two vertices int k minimum spanning tree edges int d // figure to be Scan edge element subscript)

大学软件工程数据结构课程设计二叉树实验三种遍历方法(curriculum design,structure data)

猴子选大王是个重要问题猴子选大王是个重要问题猴子选大王是个重要问题(houzixuandawang)

数字根算法，用最简单的代码计算数字根。如果把一个大数的各位数字相加得到一个和，再把这个和的各位数字相加又得一个和，再继续作数字和，直到最后的数字和是个位数为止，这最后的数称为最初那个数的“数字根”。(Digital root algorithm, with the most simple code to calculate the digital root. If you figure in a large numbers is the sum of a, then this and you figure the sum is again a, and then continue for digital and until the final figure and the single digits, the last number called initially that the number of "digital root".)

数据结构与程序设计中的重点例子程序：八皇后问题(Data structure and procedures of the focus of the design example of the procedure: eight queen problem)