▍1. BSM
一个很经典的问题_八数码! 算法速度快,解决问题多...有兴趣的可以(A very classic problem _ eight digital! Fast algorithm to solve the problem ... are interested in more than can be)
一个很经典的问题_八数码! 算法速度快,解决问题多...有兴趣的可以(A very classic problem _ eight digital! Fast algorithm to solve the problem ... are interested in more than can be)
矩阵运算器,c语言编程,数据结构,免费下载(Matrix calculator, c language programming, data structures, free download)
数据结构链表作业题,经调试通过,可做作业参考(Operating title list data structure, passed by the debugger can be homework reference)
数据结构:抽象数据类型的介绍;讲述如何构造函数和如何实现;(Data structure: the introduction of abstract data types on how to structure function and how to achieve )
计算机软件技术基础实验之快速排序程序,实现语言为c(Computer software technology based on quick sort of experimental procedure, the realization of language as c)
使用C语言实现高斯塞德尔迭代算法,GS迭代发是一种用于计算方程组的经典方法。(The use of C language to achieve high斯塞德尔iterative algorithm, GS-fat is a kind of iterative equations used to calculate the classical method.)
队列的顺序实现与运算操作(数据结构---c语言)(Queue with computing the order of operations (data structure-c language))
四叉树递归 此种模型绘制类似米字形的网格。由于整个过程递归调用绘图函数,所以可以根据误差判断绘制DEM的精细程度,从而绘制出不同精细程度的DEM,为解决漫游中数据量较大而引起的画面不流畅现象提供了模型基础。 本文并没有对LOD作研究,只是给出了四叉树的建立和遍历绘图的方法。 (Recursive quadtree rendering such models similar character-meter grid. Recursive calls as a result of the whole process of mapping function, so it can be judged according to the error map of the fine DEM, thus rendering a different degree of precision DEM, for the settlement of roaming in the amount of data arising from the larger screen does not provide a model of fluid based on the phenomenon. This article does not LOD for research, but given quadtree traversal of the establishment and mapping method.)
哈夫曼编码程序,实现计算编码学中哈夫曼编码程序的源代码。(Huffman coding procedures, the realization of computing science Huffman encoding procedure s source code.)
二叉树的设计。包含二叉树结点类的设计以及二叉树的遍历。(Binary tree design. Contains the binary tree node class design, and Binary Tree Traversal.)
这是数据结构、算法与应用-C++语言描述的代码,作者是Sartaj Sahni(This is a data structure, algorithm and application-C++ Language description of the code, the author is Sartaj Sahni)
自己做的一个用用栈实现类的操作,是课内作业,希望和大家互相交流(Own a type used by the realization of the operation of the stack is class work, hope and we can exchange ideas)
采用邻接矩阵实现有向网的存储,建立有向网,并实现单源最短路径算法。(The realization of the use of adjacency matrix to the network storage, the establishment of the network, and to achieve single-source shortest path algorithm.)
在一个圆形操场的四周摆放着n 堆石子。现要将石子有次序地合并成一堆。规定每次只能选相邻的2 堆石子合并成新的一堆,并将新的一堆石子数记为该次合并的得分。试设计一个算法,计算出将n堆石子合并成一堆的最小得分和最大得分。 (Playground in a circle around the stones are placed n heap. Stone is to have the order to merge into a pile. Provisions can only choose 2 adjacent stones piled into a heap of new and new pile of stones a few in mind for its combined score. Try to design an algorithm to calculate the n heap into a pile of stones the minimum scores and maximum scores.)
另外一个可以实现线性表的程序,简单的操作,值得初学者的借鉴(Another table can achieve a linear process, simple to operate, it is worth drawing beginners)
就是一个简单的约瑟夫环实现程序。主要就是在痛过程序实现栈的实现。(Joseph is a simple procedure to achieve ring. The main program is in pain over the realization of the realization of the stack.)
floyd算法 数据结构 求最短路径(floyd algorithm for data structure for shortest path)
算法与数据结构——快速排序 01背包问题,是一个简单的程序,高手就不用研究了(Algorithms and data structures- quick sort 01 knapsack problem is a simple procedure, you need to conduct a study on the)
利用双向链表实现对两大整数的相加运算。 可以修改数组长度实现更大整数的相加(Realize the use of two-way linked list of integers the sum of the two operations. Can modify the array length to achieve a greater sum of integers)
对首先产生20个随机数进行基数排序,是利用C++实现的(On the first 20 random numbers generated for the base sequencing is the use of C++ Realize the)