连接oracle的java库

统计字符出现的频率的哈夫曼编码-the frequency of Huffman coding

可重用的，PYQT编写的oracle数据库登录通用窗口（通过录入数据库IP地址、端口，用户名、密码等），

STL算法实现的大整数加减法的程序， 能够进行正负数的加减，而且是动态数组的， 因此可以无限输入，这是本人这学期的大作业-STL algorithms and the largest integer addition and subtraction procedures, plus or minus a few to carry out addition and subtraction, but is a dynamic array, it can be unlimited importation, this is my semester of this operation

链表程序，新版！关于数据结构-Chain procedures, the new version! On the data structure

这些是学校管理系统所需的数据库规范。。。。。。。。。。。。。。。。。。。。。。。。数据库mysql

自己写的堆栈算法，C语言＋Visual C++6.0环境下-Write their own stack algorithm, C language Visual C++ 6.0 environment

基于数据结构的相关知识点，构造的基数排序-Knowledge-based data structure point of radix sort

商品管理系统，含用户管理和商品管理两大模块，可来回切换。用户模块包括员工管理和账户管理。员工管理包含新增员工、删除员工和修改员工信息等功能；账户管理包括账户注册、账号删除和修改信息等功能。商品管理模块包括商品上下架管理和商品信息管理。商品上下架管理包括商品上架和商品下架两个功能；商品信息管理包括商品信息的增删改等功能。

Astar 精灵版本 -Astar Wizard Wizard version version Astar

迷宫算法（maze） /* Maze * Starting point is m[0][0], need to find a path go to m[9][9]. 0 means OK, * 1 means cannot go there, boundary is 0 and 9, cannot go beyond boundary. * Each step can be made horizontally or vertically for one more grid (diagonal * jump is not allowed). * Your program should print a series of grid coordinates that start from m[0][0] * and go to m[9][9] * Hint: No need to find the shortest path, only need to find one path that gets * you to desitination. */ -/* Maze * Starting point is m[0][0], need to find a path go to m[9][9]. 0 means OK, * 1 means cannot go there, boundary is 0 and 9, cannot go beyond boundary. * Each step can be made horizontally or vertically for one more grid (diagonal * jump is not allowed). * Your program should print a series of grid coordinates that start from m[0][0] * and go to m[9][9] * Hint: No need to find the shortest path, only need to find one path that gets * you to desitination.