Java写的部分数据结构源码

vfp报表转换到word,绝对是现在最适用的程序之一-Probe statements to the word change is absolutely the most one of the applicable procedures

利用链表的结构，定义了航班信息链和乘客资料链，通过对链表的初始化、插入、删除等操作实现航线及乘客资料的录入、修改、办理退订票等功能。

关于三层架构的内容参考，三层架构的大致结构内容-With regard to the contents of the reference three-tier architecture

气泡排序，一个简单的排序10个数字，按从大到小排列-Bubble sort to sort a simple 10 figures, according to smallest order

发送短信模块源代码！PCON &= 0x7F; //波特率不倍速 SCON = 0x50; //8位数据,可变波特率 AUXR &= 0xBF; //定时器1时钟为Fosc/12,即12T AUXR &= 0xFE; //串口1选择定时器1为波特率发生器 TMOD &= 0x0F; //清除定时器1模式位 TMOD |= 0x20; //设定定时器1为8位自动重装方式 TL1 = 0xFD;  //设定定时初值 TH1 = 0xFD;  //设定定时器重装值 ET1 = 0;    //禁止定时器1中断 TR1 = 1;    //启动定时器1   ES=1;  //开串口中断

SKiplist是一种概率应用于平衡树的替换数据结构。-Skip list is a probabilistic alternative to balanced trees that provide much of the simplicity of unbalanced trees , togethere with good worst-case expected performance.

利用MD5函数产生随机的无碰撞的像素选择策略-The use of MD5 function produces a random collision-free pixel selection strategy

计算大数阶乘，可以在1秒内计算出10000以上的整数阶乘-calculated factorial majority, in a calculated within seconds above 10,000 integer factorial

数据结构的实验报告-structure of the experimental data report

A*算法只要求产生问题的全部状态空间的部分结点及关系,就可以求解问题了,搜索效率较高。当然由于A*算法中没有回溯，因此某些情况下可能会找不到正确的解过程。 -A* algorithm only requires a problem all part of the state space and the relationship between nodes, we can solve the problem, the search more efficient. Of course, as a result of A* algorithm is not retroactive, so some cases may be unable to find the correct solution of the process.