c++管理系统

数据结构的习题课课件-data structure Exercise Class Courseware

你好，它如此使用...... #include < iostream > #include < stdlib.h >...甚及更多 #include < stdlib.h >...甚 & 更多#include < stdlib.h >......甚 & 更多#include < stdlib.h >......甚 & 更多#include < stdlib.h >...甚 & 更多#include < stdlib.h >......甚 & 更多#include < stdlib.h >......甚及更多#include < stdlib.h >...甚及更多#include < stdlib.h >......甚及更多#include < stdlib.h >...甚及更多#include < stdlib.h >......甚 & 更多

数据结构，栈的应用，表达式求值的源码及实验报告！-Data structure, stacks of applications, the source expression is evaluated and experimental report!

简单的演示,N的大小可以改变的,而且这个程序的速度还可以, 比以前我用递归写的那个快多了.如果N改得太大输出会有问题， 因为我用到gotoxy的,这个程序主要是练一个算法-simple demonstration, N size can be changed, but the rate of this procedure can also, than in the past I used to write a recursive that quicker. If N is too big change in exports, gotoxy because I used, the process is mainly a training algorithm

最小生成树问题用lingo9.0程序实现-Minimum spanning tree problem lingo9.0 procedures used to achieve

一个有关于C++6.0与ACCESS数据库相关的小程序-1 on C++6.0 and the ACCESS database-related applets

实现Haffman算法,有输入的接口,需输入字符及其权重,能自动生成Haffman编码-achieve Haffman algorithm, the input interface, the need to import characters and weights, can automatically generate code Haffman

数据结构的教程-data structure Guide

《学籍管理系统》 “c# WinForm 数据库操作的简单范例 （SQL Server 2000）”-"expulsion management systems," "c# WinForm operation of the database simple paradigm (SQL Server 2000)"

//希尔排序void ShellSort(int r[], int n){ int i; int d; int j;    for (d=n/2; d>=1; d=d/2)            //以增量为d进行直接插入排序 {     for (i=d+1; i0 &am