需要sql的支持

数据结构实现一个队列的操作，有插入删除等功能-queue

输入字符串以链表的形式存储，在链表中查找一个元素，删除一个元素-Enter string to the list in the form of storage, find an element in the list, delete an element

长整数的乘积求余及应用,能使得大整数的乘积变为小程序- The long integer product strives for-odd and the application, can cause the great integer the product to become the script

Qsort针对不同数据类型的用法，Qsort采用快排实现，比传统的sort更有效率-Qsort for the usage of different data types, Qsort exclusive use of quick implementation, more efficient than the traditional sort

关于大数据的Coursera课程的第二个任务。火星任务

利用简单优先法输出逆波兰式 将中缀式转化成逆波兰式-priority method using simple inverse Polish exports of Chinese-grade into reverse Polish

电梯模拟 的 Visual C++ 的代码-elevator simulation Visual C code

假设以如下说明的三元组 (F、C、L/R) 序列输入一棵二叉树的诸边(其中 F 表示双亲结点的标识，C 表示孩子结点标识，L/R 表示 C 为 F 的左孩子或右孩子)，且在输入的三元组序列中，C 是按层次顺序出现的。设结点的标识是字符类型。F=‘＾’时 C 为根结点标识，若 C 亦为‘＾’，则表示输入结束。试编写算法，由输入的三元组序列建立二叉树的二叉链表,并以中序序列输出。^AL ABL ACR BDL CEL CFR DGR FHL ^^L -Assuming the following description of the triple (F, C, L/R) sequence of a binary tree of all the input side (where F that identifies the parent node, C, said child node ID, L/R that C is F, left or right child child), and triples in the input sequence, C is the emergence of a hierarchical order. Node identity is established character types. F = " ^" C for the root identity when, if C is also a " ^" , then enter the end. Test preparation algorithm, the input sequence of triples binary build the binary tree list, and in order to sequence the output

哈希表设计是数据结构中重要的一个项目，该程序详尽说明了哈希表的建立等过程。-hash wishes it is an important project in the structure of the data that the form is designed, this procedure proves exhaustivly hash wishes such course as the setting-up of the form ,etc..

用C#实现的连接数据库,然后可以些SELECT语句来实现查询!-With C# Achieve connectivity database, and then can be more SELECT statements to query!