-
ti-idf算法,实现对英文文档的检索,把多篇文档中的词(英文单词),按照权值从小到大进行排列...
ti-idf算法,实现对英文文档的检索,把多篇文档中的词(英文单词),按照权值从小到大进行排列-ti-idf algorithm, the realization of the English document retrieval, to document more than words (English words), in accordance with the right values to be ranked from small to large
- 2022-07-08 03:08:07下载
- 积分:1
-
WTL字体类示范代码
WTL字体类示范代码-WTL font type model code
- 2022-01-26 04:18:40下载
- 积分:1
-
this document mainly to explain the establishment of a binary tree building proc...
此文件主要说明了二叉树的建立建立过程,用户看后可提出意见!-this document mainly to explain the establishment of a binary tree building process, users can read comments!
- 2023-07-15 13:40:03下载
- 积分:1
-
大学生论文关于OPNET的研究资料,可供参考
大学生论文关于OPNET的研究资料,可供参考-something about OPNET
- 2022-06-17 05:55:28下载
- 积分:1
-
C builer document on the realization of the operation, there are classic example...
用C++ builer 实现的关于文件操作经典实例
里面有所有工程需要的源代码-C builer document on the realization of the operation, there are classic examples of all the projects need the source code
- 2022-02-22 00:22:40下载
- 积分:1
-
(1)分别采用结构体数组和链表存储学生信息(包括学号、姓名、各科成绩)
(2)通过键盘输入各学生的多门课程的成绩,建立相应的文件input.dat。
(...
(1)分别采用结构体数组和链表存储学生信息(包括学号、姓名、各科成绩)
(2)通过键盘输入各学生的多门课程的成绩,建立相应的文件input.dat。
(3)按各科总成绩排序,并生成相应的文件输出。
(4)计算每人的平均成绩,按平均成绩排序,并生成文件。
(5)按学号、姓名查找学生记录。
-(1), respectively, and an array of linked list structures storing student information (including Student ID, names, subjects achievements) (2) through the keyboard input of all students in the multi-course results, the establishment of a corresponding document input.dat. (3) The total score of subjects sort, and generate the corresponding output file. (4) Calculate the average per capita results, sorted by grade point average, and generate the file. (5) by Student ID, name search for student records.
- 2022-04-18 05:35:30下载
- 积分:1
-
最佳适应算法是动态内存分区分配算法的一种。所谓“最佳”是指每次为作业分配内存时,总是把能满足要求、又是最小的空闲分区分配给作业,避免“大材小用”。为了加速寻找,...
最佳适应算法是动态内存分区分配算法的一种。所谓“最佳”是指每次为作业分配内存时,总是把能满足要求、又是最小的空闲分区分配给作业,避免“大材小用”。为了加速寻找,该算法要求将所有的空闲分区按其内容以从小到大的顺序形成一空闲分区链。这样,第一次找到的能满足要求的空闲区,必然是最佳的。-best adaptation algorithm is a dynamic memory allocation through an algorithm. The so-called "best" means the operation of each memory allocation, always meet requirements, and also the smallest area allocated to idle operations, to avoid "a waste of talent." To speed up the search, the algorithm requires that all leisure district according to content from small to large order of the formation of a regional chain idle. So, the first found to meet the requirements of the free zone will be the best.
- 2022-05-21 23:44:10下载
- 积分:1
-
A simple game. And computer simulation of the operator to guess the stone scisso...
一个简单的小游戏。模拟操作者和电脑猜石头剪子布。-A simple game. And computer simulation of the operator to guess the stone scissors cloth.
- 2023-03-12 09:00:04下载
- 积分:1
-
DSP开发练习的极好的范例程序(经典例子程序)
DSP开发练习的极好的范例程序(经典例子程序)-practice and the development of DSP an excellent example (classical examples of procedures)
- 2023-01-03 20:25:02下载
- 积分:1
-
对于图象处理,参数设置是一个非常重要的环节.这个代码可以借鉴一下...
对于图象处理,参数设置是一个非常重要的环节.这个代码可以借鉴一下-For image processing, parameter setting is a very important link. This code can learn from you
- 2022-02-02 14:45:10下载
- 积分:1