-
tongxunlu20
具有数据插入、修改、删除、显示、和查询功能的电话簿管理程序。
数据包括：人名、工作单位、电话号码、和E-mail地址。
可对记录中的姓名和电话号码进行修改。
可增加或删除记录。
可显示所有保存的记录。
可按人名或电话号码进行查询。
附加功能：
可修改单个记录的各项内容。
可重新建立电话簿。
可按人名或号码进行排序。
可统计名片数目及可再添加数目。
可插入单个名片并不破坏原有顺序(With the data to insert, modify, delete, display, and query functions of the phone book management program. The data include: the names, work units, phone number, and E-mail address. Can be modified to record the name and phone number. Increase or delete records. You can display all the records kept. According to the names or telephone number for queries. Additional features: you can modify the content of a single record. Can re-establish a Phonebook. According to the names or numbers to be sorted. Statistical card number and add the number. Insert a single card does not destroy the original order)
- 2012-05-28 12:48:27下载
- 积分：1
-
44
说明： 给定程序中，函数fun的功能是：将a所指3×5矩阵中第k列的元素左移到第0列，第k列以后的每列元素依次左移，原来左边的各列依次绕道右边。
例如，有以下矩阵：
1 2 3 4 5
1 2 3 4 5
1 2 3 4 5
若k结果为2，程序执行结果为：
3 4 5 1 2
3 4 5 1 2
3 4 5 1 2
请在程序的下划线处填入正确的内容并把下划线删除，使程序得出正确的结果。
注意：源文件存放在考生文件夹下的BLANK1.C中
不得增行或删行，也不得更改程序的结构！
(A given program, function fun feature is: a 3 × 5 matrix referred to in the first k elements of the left column to move Section 0, the k elements of each column after column followed by the left, the original columns in the left turn Bypass on the right. For example, the following matrix: 123,451,234,512,345 If k is 2, the program execution results: 345,123,451,234,512 in the program underscore the right content at the fill and to remove the underscore, so that the program reach the right result. Note: The source files in the folder of BLANK1.C candidates are not allowed by the line or delete line, nor change the structure of the program!)
- 2011-08-11 07:53:10下载
- 积分：1
-
0908030206xin
一、 地理数据文件应用
对由点、线、面构成的地理数据文件进行打开、读取、关闭操作。
要求：
1、在C++环境下，通过程序设计实现文本格式数据文件的操作；
2、在打开数据文件后，生成点、线、面三个链表，分别用于记录三种类型的数据。
3、数据文件结构说明
(Geographic data file applications by point, line, surface consisting of geographic data file open, read, and close operations. Requirements: in C++ environment, through the program design text format data file operations 2, open the data file, generate points, lines, surfaces three linked list, respectively, for the record three types of data. 3, a data file structure)
- 2012-09-14 20:33:26下载
- 积分：1
-
delete
数据结构 实验练习 删除相同的节点 希望会对大家有所帮助(Data structures lab exercises to remove the same node want to be helpful to everyone)
- 2012-11-14 12:59:15下载
- 积分：1
-
library
纯C语言编程的模拟现有图书馆的借阅、续借、归还；图书入库、出库；查询、排序等功能，实现电子图书馆的智慧综合管理。其中查询功能里面嵌套精确查询，排序功能有六种，界面可变色，里面已经附带50多本图书信息包括图书摘要等详细信息。里面还附带详细设计报告和解说PPt。(Pure C language programming simulation existing library borrow, renew, return book storage, a library queries, sorting and other functions, to achieve integrated management of electronic library wisdom. Precisely where the query function inside a nested query, sort function has six, the interface can change color, which has included more than 50 books including books summary information and other details. Which also included detailed design reports and commentary PPt.)
- 2020-10-30 14:59:57下载
- 积分：1
-
binarytree
二叉树的操作，涉及到三种顺序的遍历，树的凹入表示法，转化为一维数组储存，节点的计数，以及中序线索化。(Binary operation, involving three kinds of the order of traversal, tree concave representation into a one-dimensional array of storage, the node count, as well as in the threaded sequence.)
- 2011-05-24 20:31:13下载
- 积分：1
-
Work3.5
上海交通大学数据结构课程的课后作业系列3.5：仅供参考，最好还是自己去写(Shanghai Jiaotong University data structure course homework Series 3.5: for reference, it is best to write their own)
- 2013-12-27 21:00:03下载
- 积分：1
-
luowenfeng
建立试题库文件，随机产生n个题目；
题目涉及加减乘除，带括弧的混合运算；
利用栈求解表达式的值；
随时可以退出；
保留历史分数，能回顾历史，给出与历史分数比较后的评价(
The establishment of test database file, the subject of n randomly generated topics related to addition, subtraction, mixed operations with parentheses use the value of the expression stack solution ready to quit to preserve the historical scores, can look back at history, and history gives the comparison of scores Evaluation
保留历史分数，能回顾历史，给出与历史分数比较后的评价)
- 2020-12-29 23:09:01下载
- 积分：1
-
joseph
用链表解决约瑟夫问题。
约瑟夫环是一个数学的应用问题：已知n个人（以编号1，2，3...n分别表示）围坐在一张圆桌周围。从编号为k的人开始报数，数到m的那个人出列；他的下一个人又从1开始报数，数到m的那个人又出列；依此规律重复下去，直到圆桌周围的人全部出列。
其中包括一个实验报告，介绍了编程思路和输出结果截图。(List to resolve Joseph. Josephus is the application of a mathematical problem: Given n individuals (numbered 1, 2, 3, ... n, respectively) sitting around a round table around. From number k people began to count off the number to m the man out of the line his next person and from a number off, the man was out of the line number to m so regularly repeated down until roundtable around of the people all of the columns. Including a lab report describes the programming ideas and output screenshots.)
- 2012-08-27 22:37:52下载
- 积分：1
-
Kruskal
采用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)
- 2011-05-17 10:22:56下载
- 积分：1
