非参数估计

数值处理算法源代码-numerical algorithm source code

1．简介 本程序是用C语言编的一个基于命令行的文件合并分割器。主要用于分割和合并文件，可以按大小分或者按个数等分。支持分割和合并的批处理。其中命令行以及批处理语句有一定的规则，需要用户学习后才能熟练使用。 2．功能  能够实现多个文件的合并功能  能够实现同一目录下的所有文件或所有具有相同属性(同后缀)的文件，按照文件名的顺序合并  能够实现对于一个文件的分割功能，可以按照两种要求进行分割：第一，按照用户给出的分割个数；第二，按照用户给出的每个文件大小  支持文件合并与分割功能的批处理-1. Introduction This procedure is used C language based on a series of the command line in the paper division for the merger. Mainly for segmentation and merger documents, in accordance with the size of sub-sub or by number. Support split and merger of the batch. These command line and batch statements to certain rules, requiring the user to learn the use of skilled before. 2. Function# 61548 can be achieved by merging multiple files functional# 61,548 to achieve the same directory of all documents or all of the same attributes (with extensions) of the document, according to documents from the merger order to achieve# 61,548 for a separate function of the document, according to two separate requirements : First, the

霍夫曼编解码算法-Huffman decoding algorithms

Matlab实现的CFD算法-Matlab CFD algorithms

马踏棋盘，在一个8*8的棋盘上，在任意位置上置起点，马都能“日字”的步法走完整个棋盘。此程序运用了数据结构的栈、队列、链的结构-Horse riding board, in an 8* 8 chessboard, set the starting point in any position, horses can be " day word" footwork has completed the entire board. This program used the data structure of the stack, queue, the chain structure

radix排序法-Radix sorting method

学习算法分析时必须掌握的算法。01背包，经典无需多言。我以前的作业。-Learning algorithm analysis must master algorithm. 01 backpack, classic Needless to say. My previous job.

Exceptional C++ shows by example how to go about solid software engineering. Along with a lot of other material, this book includes expanded versions of the first 30 issues of the popular Internet C++ feature Guru of the Week (or, in its short form, GotW), a series of self-contained C++ engineering problems and solutions that illustrate specific design and coding techniques.

二分查找又称折半查找，优点是比较次数少，查找速度快，平均性能好；其缺点是要求待查表为有序表，且插入删除困难。因此，折半查找方法适用于不经常变动而查找频繁的有序列表。首先，假设表中元素是按升序排列，将表中间位置记录的关键字与查找关键字比较，如果两者相等，则查找成功；否则利用中间位置记录将表分成前、后两个子表，如果中间位置记录的关键字大于查找关键字，则进一步查找前一子表，否则进一步查找后一子表。重复以上过程，直到找到满足条件的记录，使查找成功，或直到子表不存在为止，此时查找不成功。