搜索资源列表
Cpp1
- 以（F,C,L/R）三元组序列表示一颗二叉树（其中F表示该结点的父结点，C表示结点的值,L/R表示与父结点的关系），并由该序列创建链表结构的二叉树T-In (F, C, L/R) three tuple sequence represents a two fork tree (where F represents the parent node of the node, C represents the value of the node, L/R represents the relation
sort
- 基数排序 基数排序（radix sort）属于“分配式排序”（distribution sort），又称“桶子法”（bucket sort）或bin sort，顾名思义，它是透过键值的部份资讯，将要排序的元素分配至某些“桶”中，藉以达到排序的作用，基数排序法是属于稳定性的排序，其时间复杂度为O (nlog(r)m)，其中r为所采取的基数，而m为堆数，在某些时候，基数排序法的效率高于其它的稳定性排序法。 快速排序 快速排序由C. A. R. Hoare在1962年提出。它的基本思想是
rpart
- rapart函数是R语言中关于建立决策树的函数，利用这个函数源码，我们可以进行决策树分类算法的使用。-rpart is the code which we can use it to create decision tree.
Binary-Trees-(ABB)
- In computer science, a binary tree is a tree data structure in which each node has at most two children, which are referred to as the left child and the right child. A recursive definition using just set theory notions is that a (non-empty) binary tr
TreeforR
- 自己使用R，语言编写的决策树实现算法，比较容易理解，大家可以-Using the R language to achieve the decision tree algorithm implementation, easier to understand
决策树代码
- 基础决策树算法适合初学者第一次尝试r编程(simple decision tree)
PATA1053
- 给定一个带有根R的非空树，并赋给每个树节点TI的权重WI。从R到L的路径的重量被定义为从R到任何叶节点L的路径上所有节点的权重之和。(Given a non-empty tree with root R, and with weight Wi assigned to each tree node Ti. The weight of a path from R to L is defined to be the sum of the weights of all the nodes along t
鸢尾花用ID3算法
- 建立决策树模型基于R软件，利用DI3算法，利用鸢尾花数据(Establish a decision tree)
assignment
- 基于R语言的利率二叉树构建，再次基础上进行期权的有效定价(The lattice tree in R language)
seg_tree
- segment tree 的简要实现，主要是面对与搜索的数据结构(Let us consider the following problem to understand Segment Trees. We have an array arr[0 . . . n-1]. We should be able to 1 Find the sum of elements from index l to r where 0 <= l <= r <= n-1 2 Change