dsa

本程序实现了二叉排序树的建立以及查找,插入和删除的功能.-realized by the two forks of trees to establish order and search, insert and delete functions.

堆排序 稳定的排序 复杂度为N（logN ） 也是一种快速的排序-HEAPSORT stable sort complexity is N (logN) is a fast sorting

数据结构考试的样题，对考试很有帮助。里面是BMP文件。-Data structure sample exam questions on the exam very helpful. Inside is a BMP file.

单链表的插入。数据结构中的算法小程序。初学者很适用。(Single-linked list insertion. Data structure of algorithm applet. Beginners are applicable.)

约瑟夫问题有原始的约瑟夫和发展了的约瑟夫两种。 原始的约瑟夫的描述： 古代某法官要判决N个犯人的死刑，他有一条荒唐的法律，将犯人站成一个圆圈，从第S个人开始数起，每数到第D个犯人，就拉出来处决，然后再数D个，数到的人再处决―――直到剩下的最后一个可赦免。 发展的约瑟夫的描述： 古代某法官要判决N个犯人的死刑，但这N个人每人持有一个密码，他有一条荒唐的法律，将犯人站成一个圆圈，法官先给出一个密码M，从第S个人开始数起，每数到第M个犯人，就拉出来处决，再根据这个人所持有的密码F，然后再数F个，数到的人再处决，以此类推―――直到剩下的最后一个可赦免。-Joseph problems have original development of the Joseph and Joseph two. The original Joseph Description : Ancient a judge to sentence N inmates of the death penalty, he is a ridiculous law, prisoners station into a circle, from S began a few individuals, every few months to D prisoners, pull out executions, then D, the number of people to be re-executed--- until the last one left to be pardoned. The development of the Joseph Description : Ancient a judge to sentence N inmates of the death penalty, but each individual N holders a password, he is a ridiculous law, prisoners station into a circle, the judges first gave a password M, S individuals from the beginning of several, each of the first few inmates M , pull hi

利用C语言,链表，实现的一个入栈出栈的小例子(A small example of the C language, which pushed and poped the stack by linked lists.)

sql的语言手册下一部分-sql language under part Manual

C++ Builder程序员学习数据结构 第1章源码-Builder C programmers to learn data structure source Chapter 1

餐厅点菜系统，软件工程实习的例子，对理解软件工程的流程很有帮助-Restaurant a la carte system, examples of software engineering practice of software engineering to understand the process very helpful

这个类，使数据库编程变的更简单-this category, the database programming change simpler