资源列表
Heapsort
- 堆排序的算法详解，以及程序的实现,算法时间复杂度o（logn），不错的排序算法-Heapsort
hanoi
- hanoi C语言编码 希望帮助有需要的人-hanoi C language code want to help people in need
MaxSum_ML
- 最大子段和实验之蛮力法，包括程序运行时间计算，C++表述-The largest sub-segment and experiments brute force method, including the run time calculation, C++ statements
VisualHanoi
- 动态显示汉诺塔的自动搬运过程，每个盘用不同颜色的矩形表示，有很好的教学用途。-Dynamic Display Tower of Hanoi' s automatic handling processes, each with different colored rectangular plate, said there is a good teaching purposes.
Ch2_Poly
- 这是用C语言实现的“一元多项式的加减乘算法”代码。-It is used C language implementation of " one dollar addition and subtraction by polynomial algorithm" code.
POJ1000-1010
- ACM 相关的，POJ 1000-1010的全部解答，程序十分完备 部分还有文字说明-ACM-related, POJ 1000-1010 all the answers, procedures, and there is still a very complete text descr iption
POJ1169-1179
- ACM POJ 1169-1179的全部代码 部分还有文字说明 十分详尽-ACM POJ 1169-1179 all the code and there is still a very detailed text descr iption
POJ2664-2681
- POJ 2664-2681的题目 中间有些没有 共10个题目的详尽解答-POJ 2664-2681 the subject of the middle of a total of 10 subjects who do not have a detailed answer
POJ1011-1020
- ACM POJ1011-1020 的全部详尽解答 部分含有文字说明-ACM POJ1011-1020 contains all the detailed answers to part of the text descr iption
POJ1021-1032
- POJ1021-1032 的详尽解答 程序实现 部分含有文字说明-POJ1021-1032 program to achieve some of the detailed answers containing the text descr iption
ID3
- 此编码是一个数据挖掘的决策树各种算法。以作为入门提示-this code is a decision tree data mining algorithms. As a portal to suggest-This code is a decision tree data mining of various algorithms. Getting Started as a prompt-this code is a decision tree data mining algorithms. As
Dynamic_Programming
- 本文介绍了动态规划的基本原理及其在企业经营决策中的运用方法-Dynamic Programming in the application of business decision-making