-
图书管理系统
这个系统是同学给我的,主要是要我熟悉Visual Studio 2008 与SQL Server 2008 的结合使用,她说这个系统比较简单也适合初学者使用,我从中学到了很多东西,希望有的同学也能用到这个系统,能简单使用Visual Studio 2008 。
- 2023-08-13 20:50:02下载
- 积分:1
-
Class processing, exception handling, overloading the encoding, REM AddNewStuden...
类的处理,异常处理,超载的编码,REM AddNewStudent.sql
REM Chapter 9, Oracle9i PL/SQL Programming by Scott Urman-Class processing, exception handling, overloading the encoding, REM AddNewStudent.sql REM Chapter 9, Oracle9i PL/SQL Programming by Scott Urman
- 2022-03-19 18:46:16下载
- 积分:1
-
几个C的小程序,有汉诺塔,数环打印,链表的创建并自动排序...
几个C的小程序,有汉诺塔,数环打印,链表的创建并自动排序
-several small programs, Tower of Hanoi, several Central Print, Chain automatically create and order
- 2022-02-22 09:52:33下载
- 积分:1
-
先构造一个图 用邻接矩阵存储 然后用分别普利姆算法和克努斯卡尔算法构造其最小生成树...
先构造一个图 用邻接矩阵存储 然后用分别普利姆算法和克努斯卡尔算法构造其最小生成树-First construct a map with the adjacency matrix is stored separately plym algorithm and then construct the minimum spanning tree algorithm克努斯卡尔
- 2023-08-02 07:00:03下载
- 积分:1
-
数据结构单链表的实现,包含链表元素的删除,查找,插入
数据结构单链表的实现,包含链表元素的删除,查找,插入-single linked list data structure to achieve List contains elements delete, retrieve, insert
- 2022-07-27 15:47:15下载
- 积分:1
-
用C生成一个课程二叉树,同时先、中、后序遍历该二叉树
用C生成一个课程二叉树,同时先、中、后序遍历该二叉树-C programs generated a binary tree, first, during and after the preorder the binary tree
- 2022-03-24 04:30:49下载
- 积分:1
-
本程序用于数据的折半查找,是折半查找的基本算法
本程序用于数据的折半查找,是折半查找的基本算法-the procedures for the binary search data is the basic binary search algorithm
- 2022-02-03 13:56:59下载
- 积分:1
-
清华大学数据结构讲义
清华大学数据结构讲义-data structure lectures Tsinghua University
- 2023-02-27 13:15:03下载
- 积分:1
-
堆栈的基本功能实现,数组方式实现
堆栈的基本功能实现,数组方式实现-stack to achieve the basic functions, arrays means
- 2022-01-21 05:06:54下载
- 积分:1
-
以一个Maze(m, n)的长方阵表示迷宫, 迷宫的入口是Maze(1,1), 出口是Maze(m, n), Maze(i,j)等于0表示通路, Maze(i,...
以一个Maze(m, n)的长方阵表示迷宫, 迷宫的入口是Maze(1,1), 出口是Maze(m, n), Maze(i,j)等于0表示通路, Maze(i,j)等于1表示障碍。设计一个程序,对任意设定的迷宫,求出一条从入口到出口的通路,或得出没有通路的结论。各个命令以及相关数据的输入格式如下:
输入迷宫:C,接下来一行是m n,其中m是迷宫矩阵行数,n是迷宫矩阵列数,接下来的m行数据是迷宫矩阵,每行n个值,表示一个m*n的迷宫矩阵
求迷宫的一条通路:Q
当输入的命令为E时,程序结束-With a Maze (m, n), said the long square maze, the maze entrance is a Maze (1,1), exports is the Maze (m, n), Maze (i, j) is equal to 0, said channel, Maze (i, j) is equal to 1, said barrier. Designing a program, for any set of the maze, find a path from the entrance to the export, or come to the conclusion there is no path. The various commands and data input format is as follows: Enter the Labyrinth: C, followed by his party mn, where m is the maze of matrix rows, n is a maze of matrix columns, the next line of data is a maze m matrix, each row n- value, indicating an m* n matrix of the labyrinth a maze of pathways: Q when the input command for the E, the end of the process
- 2023-04-15 19:50:03下载
- 积分:1