C-yu-yan---pai-xu-

数组的定义与使用，数组的运算，字符串的输入与输出，冒泡排序(list and array)

JTDS驱动，好用的sql server驱动程序哦-sdfsofjesfjsljflsjfdsljfslfjsljflsjflsjfljdslfs

多种排序方法的c实现和查找。入门看看还可以-various methods of sorting and searching c achieve. Portal can also see

键盘任意输入一组字母或数字生成无序数组，对数组按ASCII顺序进行排序（排序要求至少用两种排序算法），再从键盘输入一个值进行二分查找，返回查找成功或者失败的信息(Keyboard input and a group of letters, or any number of arrays, and generate disordered array sort order according to the ASCII at least two requirements (sort of), sorting algorithms from the keyboard input a value dichotomy, returns to find success or failure of the information)

是数据结构中的基数排序算法，挺不错的，谢谢大家-Data structure is a sorting algorithm in the base, very good, thank you

一个简单的minisql，能实现sql语句的基本功能，创建、查询和删除，创建索引等-a simple minisql, sql statement to achieve the basic functions to create, search and delete, create indexing

ssd5 exercise 4 ssd5 exercise 4 ss d5 exercise 4 -ssd5 exercise 4 ssd5 exercise 4 ssd5 exercise 4 ssd5 exercise 4

学生档案管理系统，是delphi初学者的操作例子,很全面!-Student records management system is the operation of beginner delphi example, very comprehensive!

简单数据库管理系统-simple database management system

c++链式队列的实现头文件如下： typedef int Item; typedef struct node * PNode; typedef struct node {  Item data;  PNode next; }Node; typedef struct {  PNode front;  PNode rear;  int size; }Queue; /*构造一个空队列*/ Queue *InitQueue(); /*销毁一个队列*/ void DestroyQueue(Queue *pqueue); /*清空一个队列*/ void ClearQueue(Queue *pqueue); /*判断队列是否为空*/ int IsEmpty(Queue *pqueue); /*返回队列大小*/ int GetSize(Queue *pqueue); /*返回队头元素*/ PNode GetFront(Queue *pqueue,Item *pitem); /*返回队尾元素*/ PNode GetRear(Queue *pqueue,Item *pitem); /*将新元素入队*/ PNode EnQueue(Queue *pqueue,Item item); /*队头元素出队*/ PNode DeQueue(Queue *pqueue,Item *pitem); /*遍历队列并对各数据项调用visit函数*/ void QueueTraverse(Queue *pqueue,void (*visit)());