数据结构之图的基本操作

Differential evolution: A simple and efficient heuristic for global optimization over continuous spaces. This code implements a basic multi-objective optimization algorithm based on Diferential Evolution (DE) algorithm. When one objective is optimized, the standard DE runs; if two or more objectives are optimized, the greedy selection step in DE algorithm is performed using a dominance relation.

简单DES加密算法C语言代码实现，可以简单的实现但有点问题哪里错了不知道请大家帮忙看看，自己写的可能不太完整，水平有限请多多包涵。

卷积和逆卷积的快速算法-the quick algorithm of convolution and reconvolution

运筹学中牛顿法和黄金分割法一位搜索的算法C++实现，我大二时自己写的作业程序。-tacticians were Newton and the Golden Section of a search algorithm C realized, I write his sophomore year at the operating procedures.

可逆嵌入式零树小波编码代码，主要是小波变换时使用的可逆变换。-reversible EZW coding code, wavelet transform is mainly used for the reversible transformation.

一个简单好用的B+树算法实现- A simple easy to use B tree algorithm realizes

A Kalman filter is a stochastic , recursive estimator , which estimates the state of a system based on the knowledge of the system input, the measurement of the system output, and a model of the relation between input and output.

应用背景不要nowdon不nowdon不nowdon不nowdon不nowdon不nowdon不nowdon不nowdon不nowdon不nowdon不nowdon不nowdon不nowdon不nowdon不nowdon不nowdon不nowdon不nowdon不nowdon不nowdon不nowdon不nowdo关键技术不要nowdon不nowdon不nowdon不nowdon不nowdon不nowdon不nowdon不nowdon不nowdon不nowdon不nowdon不nowdon不nowdon不nowdon不nowdon不nowdon不nowdon不nowdon不nowdon不nowdon不nowdon不nowdo

largreance插值 迭代法 迭代改善法-largreance interpolation Iterative Improvement Act

poj2528 代码。关于北大acm的题解，关于线段树的算法。这是一道经典的线段树的题目，另外加上离散化的方法。由于题目中最大10000000，直接线段树无疑会大大超出内存限制，所以要对其离散化，基本做法是：先对所以端点坐标进行排序，用相应序号代替端点坐标构造线段树进行计算。