-
migong
输入迷宫行列数,1代表墙0代表路,之后系统生成路径(Enter the maze ranks number 1 represents 0 for Wall Road, after the system-generated path)
- 2016-05-14 20:16:00下载
- 积分:1
-
Josephus
实现约瑟夫问题的4种算法,并有计时功能进行效率测试(4 algorithms to resolve Josephus Problem with timing counter for testing efficiency)
- 2012-12-20 12:36:46下载
- 积分:1
-
zhebanchazhao
这半查找法 是一种快速查找算法 查找效率比较高 容易实现 理想的查找算法(This search method is a fast and find more efficient algorithms to find easy to implement the ideal search algorithm)
- 2012-05-04 00:03:29下载
- 积分: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
-
structure-array-code
根据队列搜索算法的基本思想,现设计了一个简单的结构体数组如下定义代码所示。此结构体数组具备控制结点搜索和存储结点信息和路径的功能,可以较好的实现TDN的最小时间路径搜索。(Search algorithm based on the basic idea of the queue is now designed a simple structure array as defined code. This structure array with the control node and storage node information search and path functions, you can achieve better TDN minimum time path search.)
- 2013-10-09 14:35:43下载
- 积分:1
-
Four-bracket-operator
数据结构中,运用链表实现四则括号运算等,运行在VC控制台上。(Data structure, the use of chain operations to achieve four brackets, etc., running in the VC console.)
- 2011-12-12 10:51:31下载
- 积分:1
-
we
说明: 简单的链表实现
链表可以初步了解(A simple list can be linked to achieve a preliminary understanding)
- 2008-12-10 17:08:15下载
- 积分:1
-
哈夫曼树解码和编码
哈夫曼树,基本的数据结构,用来编码和解码、用数组作为存储结构实现,
- 2023-04-13 11:00:11下载
- 积分: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
-
optional-project-blackjact
经典数据结构作业,黑杰克游戏。要求程序可以连续打10次,每场比赛的赢家,赢得一个点(两点一倍)。在结束的10场比赛为你和电脑打印出的总奖金。(Write a program that simulates a simplified version of the game "BlackJack". A deck of cards numbered 2 to 10, jacks, queens, kings, and aces is used, where jacks, queens and kings are counted as 10s, and aces are either 1 or 11 at your choice. )
- 2012-12-08 11:46:33下载
- 积分:1