简单介绍了一种数据结构的构建及其使用情况

利用三元组完成距阵的基本运算,包括加法,减法,乘法.数据结构实习题目-using ternary Group completed the basic matrix operations, including addition, subtraction, multiplication. Internship topic data structure

数据结构实验六  统计若干个大型英文txt文件（如英文小说）中所有单词出现的次数，并输出出现次数最多的前10个单词及其出现次数。假设单词字符定义为大小写字母、数字和下划线，其他字符均看作单词分隔符。 要求： （1）自行设计合适的数据结构及相关算法； （2）程序运行结束时将txt文件名以及统计结果写入磁盘； （3）每次程序启动时（除了首次运行）将上次的结果读入内存、显示； （4）能根据用户选择实现重新初始化、查找某单词出现次数、追加统计、退出等功能。

常用结构源码 希望大家好好看看 很有帮助 -Common structure of source code I hope everyone a good look at helpful

数据结构课程设计,表达式求值.大家看看,如果功能不好再找我修改-Data structure design, the expression is evaluated. Let us take a look, if not find my modified function

编写一程序，统计学生的成绩信息（保存在文件Score.dat中）。 要求： 1. 能按总分，数学成绩，英语成绩，计算机成绩分别排序 2. 能分别统计数学，英语，计算机中不及格人数 3. 能按学号查找学生，并显示该学生信息。 注 1. 从文件中读入数据以及功能菜单显示已在文件ReadData.c 和Menu.c中给出； 2. 代码的总体结构已在文件Score.c中给出，并定义了一些函数头，但有关函数体代码和一些主程序处理代码要求学生填写，也可以修改函数头； 编译score.c即可 -prepared a procedure, the results of the students statistical information (stored in the document Score.dat). Requirements : 1. According to score, the math and English results, the computer results were 2 ranking. Statistics were able to mathematics, English, Computer failure number three. can search by school, students, and that the student information. Note 1. Read from the file into the data and functions of the menu showed the documentary and Menu.c ReadData.c given; 2. The overall code structure has been the Score.c given, and the definition of some of the first function, However, the body function code and address some main program code requiring students to complete, can also modify function first; compiler can s

无向图的最小生成树程序，还不错哦~供大家分享，有文字说明-Undirected graph of the minimum spanning tree procedure, but also good for your sharing ~ Oh, there are text

java编的银行家算法-java series of the banker"s algorithm

这是一个不错的数据库管理程序-This is a good database management procedures

最好用的数据库管理助手，帮助大家方便管理和使用数据库-The best use of database management assistant to help facilitate the management and use of U.S. data

每一个参加排列的数据对应二叉树的一个结点，且任一结点如果有左（右）子树，则左（右）子树各结点的数据必须小（大）于该结点的数据。中序遍历排序二叉树即得排序结果。-Order to participate in each of the data corresponding to a binary tree node, and any one node if there is left (right) subtree, then the left (right) subtree of the data node must be small (large) in the node data. Order traversal of binary tree that is the result of a sort.