-
在安装多个打印机的系统中,如果没有指定打印机,打印内容将被自动输出到默认打印机.本程序指定打印机设置为默认window打印机....
在安装多个打印机的系统中,如果没有指定打印机,打印内容将被自动输出到默认打印机.本程序指定打印机设置为默认window打印机.-printers installed in the system, if not specified printers, print content will be automatically output to the default printer. The procedures specified printer settings to the default window printers.
- 2023-04-03 04:25:03下载
- 积分:1
-
decimal number and the number of binary interchangeable programming exercises
十进制数与二进制数的互相转换 编程练习-decimal number and the number of binary interchangeable programming exercises
- 2023-07-10 15:35:02下载
- 积分:1
-
一个功能强大的堆栈,使用非常灵活,你
一个功能强大的栈,用法很灵活,你会发现很有趣- A function formidable stack, the usage is very flexible, you
can discover very interesting
- 2022-02-14 16:18:33下载
- 积分:1
-
一个压缩算法, 名字叫PPMD,压缩率比较高, 同时, 可以自行修改并编译,请各位研究算法的同僚一同研究....
一个压缩算法, 名字叫PPMD,压缩率比较高, 同时, 可以自行修改并编译,请各位研究算法的同僚一同研究.-a compression algorithm, named PPMD, higher compression ratio, and can make its own decisions and build, please algorithm research colleagues to study together.
- 2022-06-17 22:22:38下载
- 积分:1
-
在对本程序的快速排序和归并排序这两种算法的正确与否进行验证时,用手动输入的数据,本程序基本上完成了对输入数据进行的快速排序和归并排序!...
在对本程序的快速排序和归并排序这两种算法的正确与否进行验证时,用手动输入的数据,本程序基本上完成了对输入数据进行的快速排序和归并排序!-in the process of the rapid sequencing and merging the two sorting algorithms are correct for the test, with the manual input of data, the procedure is basically completed the data entry for the rapid sequencing and merging order!
- 2022-07-04 07:47:33下载
- 积分:1
-
一个用VC开发得公交车线路查询系统!
一个用VC开发得公交车线路查询系统!-a VC development in the bus line query system!
- 2022-06-30 13:19:08下载
- 积分: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
-
二叉树的基本操作
二叉树的基本操作-binary tree as the basic operation
- 2022-11-13 19:10:03下载
- 积分:1
-
物资管理系统设计仅供参考
物资管理系统设计仅供参考-material management system design is for reference only
- 2022-02-05 21:52:14下载
- 积分:1
-
C语言数据结构课件及复习题和一些技术的讲解
C语言数据结构课件及复习题和一些技术的讲解-C language data structures courseware and review questions and a number of technologies on
- 2023-08-07 22:05:06下载
- 积分:1