在线辅导制度

在 C + + 包括堆栈行动像推流行组合拆分和输出中执行扩展的堆栈

在我的教室里，我学会了如何在 php 中使类。这就像在其他语言中的类。所以我分享我的课堂学习。

同时rear和len分别指示环形队列中队尾元素的位置和内含元素的个数。设计相应的入队和出队算法。-At the same time, rear and len, respectively, annular instructions squadron tail queue element containing the location and the number of elements. Design corresponding to the team and the team algorithm.

算法与数据结构技术!想学C语言数据结构的看看有一定的帮助-algorithm and data structure technology! Like the C language data structures to see if there is some help

给定n 个整数a ,a , ,an 1 2  组成的序列， a n i | |£ ，1 £ i £ n。如果对于i £ j ，有 0 = å = j k i k a ，则称序列区间i i j a , a , , a +1  为一个零和区间，相应的区间长度为j-i+1。-given n integers a, a, and an 1 2

寻呼台用户管理系统(vb6.0编写)-paging subscriber management system (vb6.0 preparation)

这是一个决策树算法-This is a Decision Tree Algorithm

仓库管理系统-Warehouse Management System

基于C语言的各种典型排序算法：插入排序，气泡排序，希尔排序，快速排序，选择排序。可以用VC直接编译运行。-Based on the C language provides a variety of sorting algorithms: insertion sort, bubble sort, Shell sort, quick sort, selection sort. VC can be directly translated to run.

Computes estimates for the number of forests of a graph, input as a 0-1 incidence matrix. Notes: Compile in C++, "g++ -o span_forest span_forest.c". The program does not demand that the matrix is symmetric with 0 diagonal, but uses only the upper triangular part. -Computes estimates for the number of fores ts of a graph. input as a 0-1 incidence matrix. Notes : Compile in C, "g-o span_forest span_forest.c." The program does not demand that the matrix is symmetric wit h 0 diagonal. but uses only the upper triangular part.