Monkeys-and-peach

USACO中的American heritage，用C++编写，运用了树的遍历知识(the American heritage of USACO, with C++ prepared, using a tree traversal knowledge)

数据结构里面的KMP算法的可视化演示程序 MFC实现(Visualization of data structures inside the KMP algorithm demo program MFC implementation)

循环链表的应用 循环链表的应用 很方便的实现(cycle Chain cyclic chain of convenience Implementation)

数据结构中KMP算法c语言实现，vc6.0环境(KMP algorithm in c language data structure, vc6.0 environment)

插入排序与合并排序的算法比较，比较两种算法的优劣(Comparison of insertion sort and merge)

通过冒泡排序法和选择排序法实现对若干数字的排序。(To achieve the order of several numbers)

数据结构基础内容，两栈共享空间，参考《大话数据结构》(Structural basis of data content, two stacks shared space, refer to Westward data structure )

多段图、遍历、排序。用C语言解决多段图中的成本问题，得出最佳优化方案。(More paragraphs figure, traverse, ranking. C language solve more paragraphs in the chart the cost, obtains the best optimization scheme. )

实现链表的一些操作，方便进行遍历，查找等程序(Operation, convenient linked list traversal, the search procedure)

数据结构 堆栈 实现了以下功能： cout<<"----------------主菜单---------------"<<endl <<"* 1.建立 *"<<endl <<"* 2.输出 *"<<endl <<"* 3.判断栈是否为空 *"<<endl <<"* 4.栈的长度 *"<<endl <<"* 5.输出栈顶元素 *"<<endl <<"* 6.进栈 *"<<endl <<"* 7.出栈 *"<<endl <<"* 8.遍历 *"<<endl <<"* 9.数制转换 *"<<endl <<"* 10.清空 *"<<endl <<"* 11.销毁 *"<<endl <<"* 12.退出 *"<<endl <<"--------------------------------------"<<endl<<endl (data structure stack)