-
2.1将n个人围成一圈，m为未进入游戏前的先行码，用来淘汰第一个出 局的人，然后依次给出淘汰者的密码，根据输入的密码来确定下一个淘汰是哪一个，并依次输出被淘汰的...
2.1将n个人围成一圈，m为未进入游戏前的先行码，用来淘汰第一个出 局的人，然后依次给出淘汰者的密码，根据输入的密码来确定下一个淘汰是哪一个，并依次输出被淘汰的人对应的号码。 2.2用单向循环链表实现操作。-2.1 n personal cordons m not yet entered the game before the first yards out for the first out, then eliminated were given the password, the password to determine under which a one-out, and turn out the output of the corresponding number. 2.2 List circle with a one-way operation to achieve.
- 2022-01-26 01:24:55下载
- 积分：1
-
B＋树实现源码，JAVA语言，数据库索引技术
B＋树实现源码，JAVA语言，数据库索引技术-B+ Tree source, Java language, database indexing technology
- 2022-10-19 16:40:03下载
- 积分：1
-
A used c++ Realize the minimum spanning tree of the source code, and they hope t...
一个用c++实现的最小生成树的源代码，希望对大家有所帮助哈-A used c++ Realize the minimum spanning tree of the source code, and they hope to help everyone Kazakhstan
- 2023-07-08 02:10:03下载
- 积分：1
-
自己做的 借书管理系统
自己做的 借书管理系统-own library management system
- 2022-04-12 10:10:51下载
- 积分：1
-
磁盘文件最优存储问题，设磁盘上有n 个文件f1, f1,fn，每个文件占磁盘上1 个磁道。这n 个文件的检索概率分别是p1, p2, , pn...
磁盘文件最优存储问题，设磁盘上有n 个文件f1, f1,fn，每个文件占磁盘上1 个磁道。这n 个文件的检索概率分别是p1, p2, , pn-document optimal disk storage, disk based on documents n f1, f1, fn. each file on disk for a cylinder. N This document retrieval probability were p1, p2, and pn
- 2022-07-17 15:47:34下载
- 积分：1
-
用VB+access数据库设计的学生公寓管理信息系统.有一定实用参考价值!...
用VB+access数据库设计的学生公寓管理信息系统.有一定实用参考价值!-VB access database design student apartment management information systems. Have practical value!
- 2022-09-07 23:55:03下载
- 积分：1
-
dsa
这里包含有数据结构中所有的的算法和代码，非常适合学习数据结构的人，有栈，队，链表，图等等经典算法，非常适用(It contains all of the data structure algorithms and code,which is very suitable for starte learning data structures, such as stack, team, list, graph and so on ,it is very useful)
- 2011-12-31 11:27:40下载
- 积分：1
-
passenger flight booking system, can achieve a booking, inquiries, etc. Refund
旅客航班预订系统，可以实现预订、查询、退票等功能
- 2022-02-03 09:57:48下载
- 积分：1
-
清华大学类数据结构实现的乙
清华大学数据结构课上实现的B+树，设计一个4阶B+树，包括： (1) 叶子的每个记录应该包括4字节（long）关键码值和60字节的数据字段(存储文件名等，可以自定)，设每个叶子可以存储5条记录，而内部节点应该是关键码值/指针对。此外，每个节点还应该有指向同层下一个节点的指针、本节点存储的关键码数等； (2) 此4阶B+树应该支持插入、删除以及根据给定关键码值进行精确检索与关键码范围检索； (3) 显示（打印）此4阶B+树的生长(含删除节点)过程实例；-Tsinghua University class data structure to achieve the B-tree, the design of a B-tree four bands, including : (a) the leaves of each record should include 4-byte (long) key code value and 60 gigabytes of data fields (document storage, etc., can be set), set up each leaf store five records, and internal nodes is the key code value/means against. In addition, each node should have the same point under a layer of the target node, the node storage key code number; (2) The B-tree four bands should support the insertion, deletion and with the given key code value accurate retrieval and key codes scope retrieval; (3) Display (Print ) This four bands B-tree growth (including the deletion of nodes) process examples;
- 2022-01-21 19:44:41下载
- 积分：1
-
检查堆栈值的 C 语言源码
检查堆栈值的 C 语言源码-inspection stack value of C language source code
- 2023-07-30 00:55:03下载
- 积分：1
