三种常见自适应算法

快速排序是一种分而治之算法。快速排序将大表分成两个更小的子列表：低和高的元素的元素。快速排序可以递归的子列表排序。步骤：选择一个

计算一维积分的连分式法的c语言实现-calculated an integral dimension of the law even fractional c Language

一个可以存放任何数据类型的链表类-a store any data type objectlist

西电内部用的高精度库,原是保密的!!!我奉献了出来-Western Electric high-precision internal library, was kept secret!!! I dedicate out

浮点转换器，可以对十进制定点数、浮点BCD码和二进制浮点操作数之间进行相互转换。-float converters, and can set the decimal points. BCD floating-point and binary floating-point operation between several mutual conversion.

#include #include #include #include #include using namespace std; int main (int argc, char* argv[]) { cout

采用c++编写,上机运行通过的N皇后实现代码,绝对可用-used to prepare, on the plane running through the realization of the code N Queen"s absolutely available!

用于盲均衡的改进的常十字模算法,比常十字模算法具有更好的性能-For blind equalization improvement of regular cross-mode algorithm, than the regular cross-mode algorithm has better performance

VS-C# 2010下运行。其中混合高斯算法有些问题，其余两种可以实现。

acm常用的函数 大全，，，，用得到的-acm