▍1. link
实现链表的一些操作,方便进行遍历,查找等程序(Operation, convenient linked list traversal, the search procedure)
实现链表的一些操作,方便进行遍历,查找等程序(Operation, convenient linked list traversal, the search procedure)
直接插入排序算法验证。 快速排序算法验证。 直接选择排序算法验证。 (Direct insertion sort algorithm validation. Quick sort algorithm validation. Direct selection sort algorithm validation.)
迪特斯特拉算法,课程设计的作品,主要计算站点距离的吧,可以看看(Dieter Stella algorithm, distance course design work, the main computing sites can look)
A*算法 1、将开始节点放入开放列表(开始节点的F和G值都视为0) 2、重复以下步骤: 在开放列表中查找具有最小F值的节点,并把查找到的节点作为当前节点 把当前节点从开放列表删除, 加入到封闭列表. (A* algorithm 1, will begin to node placed in the and opening up list of (the began to node of the F and G values are regarded as 0) 2, repeat the the following steps: to Find a the has a the the smallest F value of the node in the the and opening up list of, and put Find a to the node as the current node current node is removed from the open list, added to the closed list.)
实现栈的基本操作,建栈,进栈,出栈,数据结构实现(To achieve the basic operation of the stack, built stack into the stack, the stack data structure)
二叉树的建立 中序遍历二叉树 把二叉树转换成双向链表(Binary tree in the establishment of traversing Binary conversion to binary tree into a doubly linked list)
数据结构中KMP算法c语言实现,vc6.0环境(KMP algorithm in c language data structure, vc6.0 environment)
使用很好的数据结构,程序运行效率高,界面简洁美观。(Good data structure, high efficiency, simple and beautiful interface.)
以太网首部的一个c语言程序,代码功能是对设备要传送的帧进行排队(Ethernet header c language program code function is queued frames to be transferred to the device)
用于课程设计 利用Dijkstra算法进行简单的最短路径查询 (For curriculum design simple shortest path query)
快速排序,用数组的存储结构,实现数的排序。共有八组随机数据,还能够计算出每组数据的处理时间,最终得到平均时间。(Quicksort array storage structure, to achieve the sort of number. A total of eight sets of random data, but also be able to calculate the processing time of each data, and eventually obtain the average time.)
红黑树 二叉树 性能比较分析 红黑树 二叉树(Red-black tree binary tree performance analysis,)
用c++实现的haffman tree 小程序,仅供参考 。 (The the haffman tree applet realized with c++ for reference only.)
学数据结构自己总结的东西,希望对大家有所帮助。(Learn data structure sum things up, we want to help.)
迪杰斯特拉算法,数据结构,C语言写的,上大学计算机系会用到的。。。(Dijkstra algorithm, data structures, C language written on the Department of Computer Science will be used. . .)
随机函数产生10000个随机数,用快速排序、直接插入排序、冒泡排序、选择排序的排序方法排序,并统计每一种排序所花费的排序时间和交换次数。其中随机数的个数由用户定义,系统产生随机数。(Random function generates 10,000 random numbers using quick sort, insertion sort, bubble sort, select Sort sort Sort, and statistics for each sort spend the sort of time and the number of exchanges. Wherein the number of the random number defined by the user, the system generates random numbers.)
里面有50例经典算法,其中包括水仙花素,兔子的繁殖等古典问题的求解(There are 50 cases of classic algorithms, including daffodils prime, rabbit breeding classical problem solving)
关于二叉树的一些相关代码,运用链表的形式,求二叉树的高度,结点个数以及叶节点个数(Some of the relevant code on the binary tree, using a linked list, find the height of a binary tree, the number of nodes, and the number of leaf nodes)
这个程序用来解决树结构与树之间的程序匹配的问题这个程序可以解决很多的问题(it is very good)
常用的算法经典代码,包括快速排序,冒泡排序等各种排序方法,还有二叉树的前序、中序和后序遍历等(The classic algorithm code, including quick sort and bubble sort sorting methods, as well as the preamble of the binary tree, inorder and postorder traversal, etc.)