▍1. graphcursors
Graph plotting in lab windows
c 语言算法的实例实现,将数据结构中的重要算法实现(C language algorithm is implemented by example, and the important algorithm in data structure is realized)
以一个m*n的长方阵表示迷宫,0和1分别表示迷宫中的通路和障碍。设计一个程序,对任意设定的迷宫,求出一条从入口到出口的通路,或得出没有通路的结论。 1.基本要求 (1)首先实现一个以链表作存储结构的栈类型,然后编写一个求解迷宫的非递归程序。求得的通路以三元组(i,j,d)的形式输出。其中:(i,j)指示迷宫中的一个坐标,d表示走到下一坐标的方向。如下图所示迷宫。从入口(1,1)到出口(8,8)的求解结果如下: (1,1)(1,2),(2,2)(3,2)(3,1)(4,1)(5,1)(5,2)(5,3)(6,3)(6,4)(6,5)(5,5)(4,5)(4,6)(4,7)(3,7)(3,8)(4,8)(5,8)(6,8)(7,8)(8,8)(The labyrinth is represented by a m*n rectangular array. 0 and 1 represent the pathways and obstacles in the labyrinth respectively. Design a program for any set of maze, find a way from the entrance to the exit, or draw no conclusion of the path. 1. basic requirements (1) first implement a stack type with linked list as storage structure, then write a non recursive procedure to solve the maze. The path obtained is output in the form of three tuple (I, J, d). Among them: (I, J) indicates a coordinate in the labyrinth, and D indicates the direction of going to the next coordinate. As shown in the labyrinth below. The results obtained from the entrance (1, 1) to the outlet (8, 8) are as follows: (1, 1) (1, 2), (2, 2) (3, 2) (3, 1) (4, 1) (4, 1).)
基于二叉树数据结构的表达式求值,能完成小数,加减乘除,括号的运算(binary tree i can not spreak English,)
由于栈也是线性表,因此线性表的存储结构对栈也适用,通常栈有顺序栈和链栈两种存储结构,这两种存储结构的不同,则使得实现栈的基本运算的算法也有所不同。(Because the stack is also a linear table, the storage structure of the linear table is also applicable to the stack, usually the stack has two kinds of storage structures: sequence stack and chain stack. The two different storage structures make the algorithms of the basic operation of the stack different.)
用队列模拟食堂打饭过程,并计算出每个人打饭的平均等待时间(The queue is used to simulate the canteen cooking process, and the average waiting time for each person to cook meals is calculated.)
S-Stack-Lib:一个C语言实现的简单的Stack库(S-Stack-Lib: A simple stack library implemented by a C language.)
清华大学出版社,数据结构简明教程李春葆著,第四章源文件(Tsinghua University press, a brief course on data structure, Li Chunbao, fourth chapters)
改进的基于c++的快速排序算法排序算法大体可分为两种: 一种是比较排序,时间复杂度O(nlogn) ~ O(n^2),主要有:冒泡排序,选择排序,插入排序,归并排序,堆排序,快速排序等。 另一种是非比较排序,时间复杂度可以达到O(n),主要有:计数排序,基数排序,桶排序等。(Improved fast sorting algorithm based on C ++)
一款可以排序的小程序,希望大家可以看一下(A sort of small program, I hope you can look at it)