-
ADO
ado-xmlcaozuo
- 2023-04-18 14:55:03下载
- 积分:1
-
哈夫曼树的c++实现
实验说明
实验所用英文文本为 /HaffmanfT 下的a.txt文件,原文为:
South Korea’s top court ruled on Thursday that Japan’s Mitsubishi Heavy Industries Ltd must compensate 28 South Koreans for their forced labor during World War Two, a ruling that drew an immediate rebuke from Tokyo.
The decision echoed the Supreme Court’s landmark verdict last month that ruled in favor of South Koreans seeking compensation from Japan’s Nippon Steel & Sumitomo Metal Corp. for their wartime forced labor.
The court upheld a 2013 appeals court decision that Mitsubishi must pay 80 million won ($71,000) to each of the 23 plaintiffs in compensation.
In a separate
- 2023-04-18 18:05:04下载
- 积分:1
-
"data structure" and parsing algorithm
《数据结构》算法实现与解析-"data structure" and parsing algorithm
- 2022-01-22 01:02:48下载
- 积分:1
-
n, n after realizing the problem solving, and can export most Solution
n后问题,实现n后问题的求解,并且可以输出最有解-n, n after realizing the problem solving, and can export most Solution
- 2022-01-22 13:28:52下载
- 积分:1
-
数据结构二叉树的实现
数据结构二叉树的实现-binary tree data structure to achieve
- 2023-03-28 08:35:04下载
- 积分:1
-
odbc教程真的很不错
odbc教程真的很不错-odbc Guide is really quite
- 2023-04-03 22:40:03下载
- 积分:1
-
教育考试管理系统,可用于学习数据库的编写
教育考试管理系统,可用于学习数据库的编写-Test management system, the database can be used to study the preparation of
- 2022-06-02 03:45:13下载
- 积分:1
-
1. 利用尾插法建立一个双向链表,并遍历双向链表。
2. 实现双向链表中删除一个指定元素。
3. 在非递减有序双向链表中实现插入元素e仍有序算法。...
1. 利用尾插法建立一个双向链表,并遍历双向链表。
2. 实现双向链表中删除一个指定元素。
3. 在非递减有序双向链表中实现插入元素e仍有序算法。
4. 判断双向链表中元素是否对称,若对称返回1,否则返回0。
5. 设元素为正整型,实现算法所有奇数排列在偶数之前。
6. 在主函数中设计一个简单的菜单调试上述算法。
-table
- 2022-03-09 20:18:40下载
- 积分:1
-
achieved using the binary tree traversal sequence which read and storage, will b...
用c实现的二叉树的中序遍历的读取与存储,能体现出向左倒的二叉树的打印界面,界面简单。-achieved using the binary tree traversal sequence which read and storage, will be shown left one of the binary tree Print interface that simple.
- 2023-05-12 02:45:03下载
- 积分:1
-
Merging Sort: The array is divided into a small array, in an orderly manner thro...
归并排序:将数组划分为小数组,通过局部的有序合并,解决问题
算法平均时间复杂度: O(nlogn)
-Merging Sort: The array is divided into a small array, in an orderly manner through the partial merger, the average time algorithm to solve the problem complexity: O (nlogn)
- 2022-01-21 06:13:35下载
- 积分:1