oracle问题集，适合初学者

好东西大家　要支持啊 c++常用排序算法-Good thing we have to support ah c++ Common sorting algorithm

本程序为本人本科期间一次课程设计，粗制滥造，本不敢拿出示人，无奈急需源码一份，苦于无积分在身，只得滥竽充数。各位若是刚刚入门的新手，就不必看了，以免被我误导。技术问题    这里只有数据库设计部分以及部分SQL语句。

一本描述C++数据结构描述的书籍-a description of C data structures described in the books

Samsung 8-bit machine the realization of the definition and operation of the sample file spaces

这是数据结构中图的全部实现代码，对学习数据结构的同学很有帮助-this is a code of data structure

用列表实现的队列和栈的算法，用接口和实现的结构组织。 原来打算一个通用的包含所有数据结构算法的接口以及实现集，由于时间问题，只是做了一点点，作为数据结构算法和设计思想的一个简单范例以及尝试吧，希望和大家多讨论。 里面附有使用实例，以及可执行文件，适合初学者！-used to achieve the queue list and stack algorithm, Interface and realization of the structure. The original intention of a common data structure contains all the interfaces and algorithms to achieve set, as a matter of time, but only a little, as the algorithm and data structure design of a simple model and try it, and we hope that more discussion. Inside with the use of examples, as well as executable files, suitable for beginners!

一个封装好的产生随机数的类,十分好用,是学数据结构是写的,希望对大学有用-Generate a good random number package class, very easy to use is data structure is written in the hope of the University of useful

这几个是本人整理的.cpp程序，您可以借鉴参考------>> dos前景背景色设置.cpp 二．八．十．十六进制转换程序的函数.cpp 二叉树的遍历.cpp 图形的广度优先搜寻法.cpp 图形的深度优先搜寻法.cpp 用C语言编的一个日历.c-these are my finishing. Cpp and you can draw reference--- gt; Gt; Dos prospects for the background color set. Cpp two. 8. 10. Hexadecimal conversion function. Cpp binary tree traversal. Cpp graphics priority to search for the breadth of France. Cpp graphics depth-first search of the law. Cpp C language compile a calendar. C

SVG动态读取数据库并实时显示出来。该代码以通过后台读取时间实时显示出来，如果你需要读取数据库，请在Default.aspx中处理即可。-SVG Dynamic read the database and displayed in real time. The code to read through the background of real-time display of time, if you need to read the database, please Default.aspx in treatment can be.

这是一个用于计算最小生成树的程序。当人们逐个输入每条边的权，再点击生成，便能得到这个图的最小生成树。-This is a used to calculate the minimum spanning tree procedure. When people enter one by one each side of the right, then click generate, will be able to get this graph minimum spanning tree.