快速排序算法的C++

最小生成树算法，将节点 构成的图转换为最小生成树。可用于计算某个节点到另外一些节点的最短距离 

用元素分配法求解0-1整数规划问题，比匈牙利法简单且易实现，该算法已通过实例验证-elemental distribution method 0-1 integer programming problems than Hungary and France is simple to implement, The algorithm has been verified by examples

艾斯方案 mostra 科摩 usar um teclado 3 x 4 com pic e 科摩 configurar Kbdinit，e também mostra 奥科科摩 usar estrutura de programação 切换案例段 criação de um 帕菜单 interativo 应用 o usuário 普德 escolher o 提珀德苏

这个是我的毕业设计做的我觉得对大家还是有写用的，所以我给打击看看希望大家也给点意见。-this is my graduation design so I think people are still used to write, So, I hope to see you blow also points.

这是有关的计算法路径规则的公理，是道径规则的公理，没有进一步看表面较，因为基本是GE的出场算法，可以设计为出口径最短的路网上，但深度相当西雅图更多即将多大时代，地中海俱乐部这样做GE发挥算法的消费提供较多的电视值得追逐后，威胁来源，由于因为Club Med的投入到西雅图的每个位置都FA行后追为FA和产品健康出最短的路径。

这是一个超长整数加法.转载.-This is a long integers. Reprinted.

一些C编程语言经典编程题目，希望对大家有用。#include int main(void) { unsigned int i = 0x12345678; char*pc =(char*)&i; printf("0x%x ", *pc); double *pd = (double*)&i; printf("%f ", *pd); printf("sizeof pc = %d sizeof pd = %d ", sizeof(pc), sizeof(pd)); return 0; }

fir滤波器代码,实现基本的FIR滤波器-fir filter code, the realization of the basic FIR filter

概念格挖掘关联规则的论文及源代码，程序附在论文的最后，请注意查看，绝对有效 -concept lattice Mining Association Rules papers and source code, procedures attached to the final paper, to look and totally effective

C++ 各种排序算法演示(插入、希尔、冒泡、快速等)。