资源列表
Microsoft_question
- 请在O(n)时间内找出一个线性表内第二大的数。而且只能从左到右遍历一遍。(本题选自Microsoft面试真题)，时间在20sm内-In the O (n) time to find a linear form the second largest number. And can only be traversed from left to right again. (The title taken from Microsoft interview dependent on), the time
IDcard
- 主要参数：输入15位旧身份证号码，输出18位新身份证号码。完成以下功能：根据给定的转换规则将15位身份证号转化为18位身份证号码，要考虑程序命令行参数； 要应用以下知识点：字符数组基本输入、输出；循环控制结构；命令行参数。 -The main parameters: the old ID number input 15, output 18 new ID number. Complete the following functions: the transformation rules
FastSort
- 一个很经典的排序算法，此算法步骤非常简单，可以快速的进行对数组的排序。-A very classic sort algorithm, this algorithm is very simple steps, can quickly to an array of the list.
CPP--MGraph
- 《数据结构》课程中，图的邻接矩阵存储，用C/C++编程实现。-Data structure course, graph the adjacency matrix storage, use C/C++ programming realization
matrix
- 基本矩阵运算，供数据结构课程学习。或相关学科-Basic matrix operations for data structure course. Or related disciplines
quick
- 快速算法的c语言实现 使用快速算法对数组进行排序，数组为随机生成的-Fast Algorithm for c-language implementation using fast algorithm to sort an array, an array of randomly generated
insert
- 数据结构无头结点的插入 用于数据结构课程的学习 进行插入节点操作-Data structure without a head node insert
Linked-list
- 较为全面的链表的链表的部分基本操作和链表的倒置，适合数据结构初学者-A more comprehensive list of list of some of the basic operations and the inverted list for data structures for beginners
4-3-QuickSort
- 一个实现快速排序的源码，主要用来实现快速排序-code of quick sort
ordering-model
- 排序法是教学过程中最常见的算例，通过三种不同的排序方式，体会排序思路不同对编程产生的影响-The sorting method is the most common example of the teaching process, through three different sort to appreciate the impact of sorting ideas for programming
beibaosufa
- 背包算法 问题描述 给定一组物品，每种物品都有自己的重量和价格，在限定的总重量内，我们如何选择，才能使得物品的总价格最高。-The knapsack algorithm descr iption of the problem given a set of items, each item has its own weight and price, the total weight of the limited, how to choose in order to make the highest
Demo
- 数据结构中的希尔排序算法。希尔排序算法是直接插入排序算法改进，时间复杂度降低了。-Hill sorting algorithms in data structure. Hill sorting algorithm is direct insertion sort algorithm is improved, and reduces the time complexity.