登录
首页 » Visual C++ » tongxunlu20

tongxunlu20

于 2012-05-28 发布 文件大小:4KB
0 276
下载积分: 1 下载次数: 3

代码说明:

  具有数据插入、修改、删除、显示、和查询功能的电话簿管理程序。 数据包括:人名、工作单位、电话号码、和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)

下载说明:请别用迅雷下载,失败请重下,重下不扣分!

发表评论

0 个回复

  • 03
    说明:  《妙趣横生的算法》第三部分原书附带代码程序,绝对属实(&quot Algorithm for fun,&quot the third part of the original program with the code, the absolute truth)
    2011-04-24 01:36:18下载
    积分:1
  • maze
    迷宫求解一般采用“穷举法”,逐一沿顺时针方向查找相邻块(一共四块-东(右)、南(下),西(左)、北(上))是否可通,即该相邻块既是通道块,且不在当前路径上。用一个栈来记录已走过的路径栈是限定仅在表尾(top)进行插入或删除操作的线性表。(Maze solving generally use the " exhaustive" one by one to find adjacent blocks in a clockwise direction (a total of four- East (right), South (down), West (left), North (on)) whether to pass, that the both channel blocks adjacent blocks, and not in the current path. Use a stack to record the path traversed stack is limited only in the tail (top) to insert or delete a linear form.)
    2013-12-13 17:55:45下载
    积分:1
  • data-structure-paper
    本资料为数据结构的相关试卷,可以帮助大家解决一下有关考试的问题(This information is relevant papers data structure that can help you solve the problems concerning the examination)
    2013-09-18 08:16:24下载
    积分:1
  • Graph
    采用邻接矩阵实现有向网的存储,建立有向网,并实现单源最短路径算法。(The realization of the use of adjacency matrix to the network storage, the establishment of the network, and to achieve single-source shortest path algorithm.)
    2007-12-25 16:55:03下载
    积分:1
  • BFS
    迷宫问题 队列求解 界面还不完善 可以自己添加(Maze problem solving interface queue is not perfect you can add your own)
    2013-12-26 22:08:58下载
    积分:1
  • FreeTree
    无环连通图G=(V, E)亦称为自由树T,其直径是树中所有顶点之间最短路径的最大值,设计一个算法求T的直径(Acyclic connected graph G = (V, E) is also known as free tree T, whose diameter is the tree of shortest paths between all vertices maximum design an algorithm for the diameter of T)
    2013-10-29 16:31:47下载
    积分:1
  • 2_24to2_28
    双向链表 清华大学 出版社 《数据结构 C++》 源代码实现(Tsinghua University Press doubly linked list <data structure, C++> source code)
    2011-02-05 22:08:53下载
    积分:1
  • the-shortest-path-of-chart
    求有向图的最短路劲,根据所给图的边长和顶点,建立有向图,以邻接表的方式存储,并编写程序求从有向图任一点出发的最短路径(according to the graph with sides and vertex, establish a directed graph, and write a program find the shortest path from one of the point of the chart )
    2020-07-16 11:28:50下载
    积分:1
  • tudebianli
    图的遍历问题 数据结构 C C++ 源码 课程设计 严蔚敏版的书(yrteryryer)
    2010-05-08 09:24:06下载
    积分:1
  • huffman_src22
    本代码提供一种非常简单且快速的哈夫曼编码方法。 (this code provide a very simple and rapid method of Huffman coding.)
    2007-06-15 16:02:25下载
    积分:1
  • 696516资源总数
  • 106914会员总数
  • 0今日下载