一个简单的文件系统模拟算法

描述：这个实验中需要实现的是拍卖系统的3个核心的类（Class Date, class Advertisement, and class Client） 目的： 1，使用C++的数据类型； 2，实现所有声明的函数； 3，使用预处理器实现包含。-Description：This assessment requires the creation of three of the core classes of the auction project. Class Date, class Advertisement, and class Client are three of the fundamental classes in the system. Outcomes: Students successfully completing this assignment would master the following outcomes. Use fundamental C++ data types Produce C++ class implementations given class declarations Use the preprocessor to perform file inclusion

一款不错的档案VB-files VB

归并排序，C代码，初学者可以看一下，大家分享一下-Merge sort, C code, and beginners can take a look, we share with you

参考课堂迷宫问题的解题方法，建立move数组，若马当前位置是（x,y）,则沿着第i(1

&实验数据结构，教学第二（四月）访问程序。雷亚尔

ssd7的本人的答案， 供大家参考, 希望大家喜欢-ssd7 exercise1

实现了插入排序，希尔排序， 冒泡排序，快速排序，选择排序，堆排序和归并排序，以及可以对排序的性能进行分析，较适合用作排序算法的学习-achieved insertion sort, Hill, in order Bubble Sort, quick sort, select, in order of ranking and sculpture merge sorting, and sequencing can analyze the performance and more appropriate for the learning algorithm

哈夫曼编码 很小的程序 数据结构的-Huffman coding procedures small data structure

一个采用VC+ACCESS开发的酒店管理，以及论文-using a development of the VC ACCESS hotel management, and the papers

一． 问题描述很多涉及图上操作的算法都是以图的遍历为基础的。试写一个程序，演示在连通的无向图上访问全部节点的操作。二． 基本要求以邻接多重链表为存储结构。实现连通无向图的深度和广度优先遍历。以用户指定的节点为起点，分别输出每种遍历下的节点访问序列和相应生成树的边集。-one. Description many issues involving maps of algorithms are to traverse the map-based. A written test procedures, demonstrating the connectivity of undirected graph visit all the nodes on the operation. 2. Adjacent to the basic requirements for storage of multiple linked list structure. Connectivity to the map without the depth and breadth- first traversal. User specified nodes as a starting point, the output of each node traversal visit Spanning Tree sequence and the corresponding set of edges.