这是研究生课程计算方法与技术中讲到的Prime算法的具体实现，相信学这个课的同学都会感兴趣的。...

基于ADO数据库的记录日常开销的软件，还有打印功能。-ADO database based on the daily sales record of the software, there are printing function.

此程序为一个简单的oracle数据库程序，用于学生信息与课程成绩对应-This procedure as a simple oracle database for student information and curriculum corresponding results

shi.c 说明:本程序用于层序遍历二叉树.程序开始时先由用户先根序输入二叉树各结点值,对于空结点输入宏ENDTAG所对的值(暂定为整数0). 建立好二叉树后即可自动进行遍历依次层序输出各结点的值. ----Author:zhg 2006.11.26 E-mail: wudazhg@163.com 仅供参考学习之用，所有权保留-shi.c : The procedures for the binary tree traversal sequence. procedures at the beginning of each user input first-sequence binary tree nodes value, for the importation of empty node by right-ENDTAG value (tentatively scheduled for integer 0). After a good binary tree can be automatically traversal sequence followed output of the node values.---- Author : zhg 2006.11.26 E-mail : wudazhg@163.com for reference purposes only learning, retention of title

oracle问题集，适合初学者-problem sets, suitable for beginners

数据结构中的链表类实现多项式的相加 用C++实现!-Linked list data structure in the sum of polynomial-type implementation with C++ implementation!

从数组中 任取一个元素 p (可随机取,现在以取第一个为例).以P作为主元,对数组 进行划分 ,前一部分小于 P,后一部分 大于p.最后划分处存储p,然后分别对划分后的前一部分和后一部分递归调用. 算法平均时间复杂度: O(nlogn) -Any check from the array element p (can be random access, and now to take the first example). To P as the main element of the array to be divided, the first part is less than P, the latter part of the final division is greater than p. Department store p , and then were divided into the first part and the latter part of recursive calls. algorithm the average time complexity: O (nlogn)

编写一个小公司的工资管理系统。该公司主要有4类人员：经理、兼职技术人员、销售员和销售经理。要求存储并显示每类人员的编号（从100起编号）、姓名和月薪，同时给出在创建每一类对象时构造函数的执行顺序（月薪计算方法为：经理固定月薪8000元，兼职技术人员100元/小时，销售员为当月销售额的4％，销售经理保底工资 请点击左侧文件开始预览 ！预览只提供20%的代码片段，完整代码需下载后查看 加载中 侵权举报

sqlite 3.3.8 支持加密的版本-sqlite 3.3.8 supports encrypted version

权限控件sdfsfsdagfadsgasdgads-sgfdsgsdfsdfsdfasdgfagagggag

vb做的-教学计划安排与排课系统-vb do-teaching plans and Timetable