搜索资源列表
exer5
- 链表排序,数据结构的算法实现,利用链表的拆分,实现排序,从个位到百位,实现三次拆分
从数据文件records.txt中读取学生信息
- 从数据文件records.txt中读取学生信息,建立与源数据同序的学生链表并打印在屏幕上; 统计学生链表中身高达标人数(男女生的身高达标值由键盘输入),并打印结果; 对上述学生链表按学号进行排序,然后将一位学生的相关信息插入到已按学号排序的学生链表中后仍然保持学号的有序性,将结果链表打印在屏幕上; 对上述操作后的学生链表进行倒置,结果输出到数据文件result.txt中; 删除链表中身高为指定值的所有学生结点并打印; 将当前的学生链表拆分为男生链表和女生链表(没有
pointset
- 基于OPenCV的源码,用于分割而为点集,函数执行二次方程的算法,将集合拆分成一个或更多的等效类。-Based on the source OPenCV for partition and for the point set, function to implement the algorithm quadratic equation will be split into a set of equivalent or more categories.
backpack
- 0/1背包问题(附注释):不可拆分的0/1背包问题-0/1 knapsack problem (with Notes): non-split 0/1 knapsack problem
doc
- 关于整数拆分算法的文档 关于整数拆分算法的文档-Split algorithm on the integer integer split algorithm for documents on the document
list
- 数据结构链表程序:一元多项式加减乘和求导拆分逆置,用的是C语言 -Program list data structure: a polynomial multiplication and addition and subtraction reverse split derivation set, using the C language
Balance_tree
- c语言编写,平衡二叉树演示,可插入、删除树的结点、拆分一棵树、合并两棵树,自动进行平衡操作-balance_tree learning_system developed by c
LinkMergeAndSplit
- 1 单链表的合并与拆分 2 数据结构与算法 3 链表操作-1 Merging and splitting of a single linked list 2 Data Structures and Algorithms 3 linked list operations
Binary-tree
- 二叉树的顺序表示 通过该程序进行文字的分析进行拆分表示-Binary tree in the order said the split through the program text analysis
BTree
- B-树查找算法的测试,包括查找,拆分,替换,新建,删除等-Test of the B-tree search algorithms, including Find, split, replace, new, delete, etc.
backtracking-method-split-
- 采用回溯的方法拆分整数,效率相对较低,但是容易理解,使用栈实现,原创-Retrospective method split integer efficiency is relatively low, but it is easy to understand, use the stack to achieve, originality
Job
- 要求给出一种作业调度方案,使所给的n个作业在尽可能短的时间内由m台机器加工处理完成。约定,每个作业均可在任何一台机器上加工处理,但未完工前不允许中断处理。作业不能拆分成更小的子作业。-Required to give a scheduling program, so as to the n operations in the shortest possible time by the m-machine processing. Convention, each job can be proces
float_save
- 浮点数存储方法,此方法解决了浮点数不能使用强制转换数据类型,直接拆分存储的难题-Float storage, this method can not be used to solve the floating point data type cast directly split storage problems
01packageProblem
- 经典的0-1背包算法,采用动态规划法。n个重量不同,价值不等的物品,放入一个承重量固定的背包中,单个物品不能拆分,求最大价值的组合。- Classic 0-1 knapsack algorithm, using dynamic programming method. N weight is different, the value of items, into a fixed weight of the backpack, a single item can not be split,