ID3算法源程序。使用的方法是编写一个*.dat文件保存样本数据，还有一个*.tag文件保存属性列名，且最后一个属性是标号属性。运行是输入id3 文件名。输出格式是一个二叉判定树。-ID3 algorithm source. The method used was to prepare a document preservation *. dat sample data, a document preservation *. tag attributes listed, and the fina

Heapsort 1.A heap is a binary tree satisfying the followingconditions: -This tree is completely balanced. -If the height of this binary tree is h, then leaves can be at level h or level h-1. -All leaves at level h are as far to the left as po

基于ID3理论的二叉树决策树算法的C++实现-Implemented decision tree algorithm, based on the the ID3 theory of binary tree C++