▍1. C-data
大一c语言实验的所有源码以及实验报告报告(All source code and report experimental freshman c language)
大一c语言实验的所有源码以及实验报告报告(All source code and report experimental freshman c language)
数据结构与算法分析的 C++检索代码,很经典(the code of Data structure)
利用串来比较数据大小,代码中有两个串,通过串来比较大小( 10/5000 Use the string to compare the data size)
拓扑排序 -打印输出计算机本科专业4年每学期的课表(Topological sort - computer printout of undergraduate curriculum of each semester for 4 years)
经典的 数据结构问题 八皇后问题。问题是在8*8的棋盘上放置棋子,要求每条直线上不能出现两个或以上的棋子。(The classical data structure problem Eight queens problem.Question is placed on the 8* 8 board piece, requirements on each line cannot appear two or more pieces.)
基于MFC平台,实现多功能计算器,可求解复杂表达式,主要实现为数据结构中链表和数组,对于要熟悉链表和数组的初学者有很帮助。(Based on the MFC platform, to achieve multi-function calculator, can solve complex expressions, the main realization of the data structure for the list and array, to be familiar with the list and the array of beginners helpful.)
数据结构的一些简单的排序算法,有利于初学者学习。(Data structure of some simple sorting algorithm is conducive to beginners learning.)
C数据结构课程设计 交集与并集的函数代码模块(C curriculum design and the intersection of function and set the code module)
关于C语言的一些指针的处理算法,能够使得初学者对C语言指针有自己的了解(Some pointers on C language processing algorithms, it is possible to make a beginner C language pointer has its own understanding)
实现经典问题老鼠迷宫,并用坐标将路径显示出来(Achieve classic problem rat maze, and coordinate with the path displayed)
该程序分析eit表的数据结构,病输出相应内容信息(parse eit table and output content info)
数据结构,c语言 计算数组的出度和入度。(Data structures, arrays calculate the degree and in-degree.)
输入迷宫行列数,1代表墙0代表路,之后系统生成路径(Enter the maze ranks number 1 represents 0 for Wall Road, after the system-generated path)
基于dijkstra和广度搜索的加权有向图有必经点的点对点的最短路径算法,路径必须经过要求的必经点,且不成环。 该算法采用了一种自适应调整的方法,经过多次迭代,使解收敛。 但只是寻找了一个略优的可行解(每次迭代都基于贪婪算法寻找),不能保证最优解。而且如果图过于稀疏,因为收敛速度过快,可能导致问题无解(收敛于一个局部最优解,没有经过所有点)。 解决相对稠密的图(每个点的平均出入度4以上),表现良好。 备注:里面有一个QT的工程,可以直接打开(源码里没用QT的库)(Weighted Dijkstra and breadth first search based on a shortest path algorithm must point to point to the map, the path must pass through points, and not a ring. This algorithm adopts an adaptive method to adjust, after several iterations, the convergence of solution. But only to find a slightly better feasible solution (each iteration is based on the greedy algorithm to find), can not guarantee the optimal solution. And if the graph is too sparse, because the convergence speed is too fast, it may lead to the problem of no solution (convergence to a local optimal solution, not after all points). To solve the relatively dense graphs (each entry point average above 4), good performance.)
本算法用于实现二叉树的查找和输出,使用了数据结构中的二叉树结构,精髓在于使用了函数指针。( This algorithm is used to find and implement binary output, use the data structure of the binary tree structure, the essence is the use of function pointers.)
求最长上升下降\非上升非下降的刷表法(Seeking maximum rise fall Philippines rise fall Philippines brush table method)
通过鸽巢排序实现对于数字在10000以内的排列。(For the realization of the arrangement within the digital pigeonhole sort through 10,000.)
信息输入输出查找删除插入更改显示保存建立(Telephone management system)
单链表的插入。数据结构中的算法小程序。初学者很适用。(Single-linked list insertion. Data structure of algorithm applet. Beginners are applicable.)