学生信息管理系统，图书# 39的源代码。相对硅…

算法类，合并排序的源代码，来自算法导论上的-Algorithm category, the combined ranking of the source code, from the Introduction to Algorithms

如何以编程方式将数据从ACCESS数据库导出到EXCEL

素数的求法，用vb编写的-primes for the law, prepared by using vb

算法设计与分析中的贪心法源程序，用VC编写，应用贪心设计策略来解决操作系统中单机、无资源约束且每个作业可在等量时间内完成的作业调度问题-algorithm design and analysis of the greedy algorithm source, VC preparation, application greedy design strategies to solve the stand-alone operating system, without resource constraints which each job can be in the same amount of time to complete the job-scheduling problem

vc数据库编程程序-vc procedures Database Programming

C#写的导入Excel表到数据库，可以选择工作簿，自己写的还不完善，有用的朋友可以借鉴一下，把完善传上来-C# written to the database table into Excel, you can choose the workbook, write their own is not perfect, can be useful to learn from some friends, to improve the Chuan-up

这是一个生成全排列的程序,采用最小变化算法,相邻两个序列之间只有两个数的次序不同,每交换两个数,便形成一个新的序列,速度非常快.-This is a whole generation with a procedure using the smallest change algorithm sequence between two adjacent only two of several different order every two exchanged a few, it will lead to a new series, very fast.

建立赫夫曼树，然后再由叶子到根实现赫夫曼编码。-Huffman tree set up, and then leaves to the root by the Huffman encoding implementation.

大型数据库，最基本的PL/SQL语句，及其基础编程。-Large databases, the basic PL/SQL statement, and its basic programming.

双向循环链表节点：数据域+指针域指针域：一个指针指向前一个同类型节点，另一个指针指向后一个同类型节点（1）设计节点struct db_node{int data;struct db_node * prev;struct db_node * next;};（2）创建空链表//创建了一个只有头节点的双向循环链表，返回头节点的地址struct db_node * create_db_list(void){struct db_node * phead = (struct db_node *)malloc(sizeof(struct db_node));if(phead == NULL)exit(-1);else{phead->next = phead;phead->prev = phead;}return phead;}（3）制造新节点//制造新节点，返回新节点的地址struct db_node * make_db_node(int value){struct db_node * pnew = (struct db_node *)malloc(sizeof(struct db_node));if(pnew == NULL)printf("malloc failed! ");else{pnew->data = value;pnew->next = NULL;pnew->prev = NULL;}return pnew;}（4）插入节点//把pnew指向的节点插入到头节点的前面，也就是整个链表的末尾bo