▍1. shell
希尔排序,希尔排序,希尔排序,希尔排序,c语言(shell sort)
求矩阵的最大值 有一个整型二维数组,大小为m行n列,要求分别找出其中最大值所在的行和列,以及该矩阵中的最大值。 要求: 1.编写自定义函数MaxVal 函数的原型为:int MaxVal(int arr[][N], int *m, int *n) 功能: 数组中最大元素的值通过MaxVal函数的返回值传递给主函数,最大元素的行值和列值分别通过m和n传递给主程序相应的变量。 2.main主函数的功能 (1)变量定义 (2)输入数组各元素的值 (3)以二维矩阵形式输出数组中各元素的值 (4)调用MaxVal函数,或者insert函数 (5)输出数组中最大元素的值和该数组元素的行值和列值。 3.所有关于数组的操作尽量使用指针 (FindMax)
排序二叉树(模板类),主要用于数据排序和查找。已在项目中使用(Sorted binary tree (template class), mainly used for data sorting and searching. Has been used in the project)
讲解了循环单链表的建立,以及在链表中插入、删除、更改数据...(Explain the establishment of circular single linked list, and insert in the list, delete, change the data ...)
各种排序算法的实现,如快速排序,冒泡排序,选择排序,堆排序,二分插入排序等(Implementation of various sorting algorithms, such as quick sort, bubble sort, selection sort, heap sort, binary insertion sort, etc.)
严蔚敏的数据结构讲义 让你在学习时少走很多弯路 这可是我的珍藏版哦!!(Yan Wei-min data structure notes when you walk less in learning a roundabout that was my Special Edition Oh! !)
主要是DIJKSTRA经典算法,可以作为单个算法来读,也可以调用。(DIJKSTRA mainly classical algorithm can be read as a single algorithm can also be called.)
排序树 能够根据你的需要,建立二叉树,并且对其进行遍历(Sort tree according to your needs, build a binary tree and its traversal)
1.建立两个有序得链表(带表头,用头插法); //2.写一算法在单链表上实现线性表的ListLength(L)运算。 写一算法将单链表中值重复的结点删除,使所得的结果表中各结点值均不相同。 (1. The establishment of two ordered lists too (with header, with the first interpolation) // 2. To write a method to achieve a single linked linear form of ListLength (L) operations. Write an algorithm to list the value of a single node to delete the duplicate, so the results in the table are not the same as the value of each node.)
队列的一般数据结构 队列的创建 删除 修改 取数据等等(The general data structure queue queue to take the data and so create delete modify)
通过学习奥赛培训课程,利用回溯加递归的编程技巧完成的迷宫问题(Training courses through learning Orsay, plus use of recursive programming skills back to complete the maze problem)
图的遍历的实现,文字界面,包含深度遍历和广度遍历两种情况~~(Graph traversal implementation, the text interface, including the depth and breadth traversal traverse both cases ~ ~)
文件的多路归并排序算法, C++描述(要求待排序文件已经事先有序)(C++ implementation of K-Merge Algorithm)
总结了10种排序的方式。用代码加以实现。(the ten way of Line up a preface)
AE中实现最短路径和最近设施的小例子,有附带数据,(AE in the shortest path and the latest facilities to achieve a small example of incidental data,)
程序可以实现哈弗曼自动编码功能!很详细的!很有参考价值!(Program can be Havermann automatic coding features! Very detailed! A good reference!)
键盘任意输入一组字母或数字生成无序数组,对数组按ASCII顺序进行排序(排序要求至少用两种排序算法),再从键盘输入一个值进行二分查找,返回查找成功或者失败的信息(Keyboard input and a group of letters, or any number of arrays, and generate disordered array sort order according to the ASCII at least two requirements (sort of), sorting algorithms from the keyboard input a value dichotomy, returns to find success or failure of the information)
最小生成树两种经典算法,kruscal和Prim算法(spanning tree)
说明: c编写的链表连接函数,上课时学的,上传试试 (c write the list to connect function, class, learn, try uploading)
数据结构课程设计,多种内部排序的效率分析(Data structure course design, the efficiency of a variety of internal sorting)