资源列表
jidiansuanfa
- 都是些非常经典的算法例子，用C语言编写，对初学者很有用！-Algorithms are examples of some very classic, written in C, very useful for beginners!
motkaluo
- 利用蒙特卡洛方法求概率事件，比如用c语言模拟落入点，可求得概率值接近PI-This is a good text for you to learn gailclun .I believe you will like the sourse very much.
dxs
- 输入一个数据n，计算斐波那契数列(Fibonacci)的第n个值 1 1 2 3 5 8 13 21 34 规律：一个数等于前两个数之和 //计算斐波那契数列(Fibonacci)的第n个值 -Enter a data n, calculate the Fibonacci series (Fibonacci) of the n-th value of 112,358,132,134 law: a number equal to the previous two numbers
good
- 第4章 数组 1. 定义一个int型的一维数组，包含10个元素，分别赋一些随机整数，然后求出所有元素的最大值， 最小值，平均值，和值，并输出出来。 -Chapter 4 Array 1. Define a one-dimensional array of type int, contains 10 elements, respectively, assigned some random integer, then find all the elements of the maximu
download.tar
- . 定义一个int型的一维数组，包含40个元素，用来存储每个学员的成绩，循环产生40个0~100之间的随机整数， 将它们存储到一维数组中，然后统计成绩低于平均分的学员的人数，并输出出来。 -Define a one-dimensional array of type int, contains 40 elements, used to store the results of each student, cycling between 40 0 ??to 100 random integ
stack_del_search
- 用栈的方式实现线性链表的删除插入查找等功能，适合初学者自学理解-Be achieved with a stack of linear linked list of deleted into the search functions, suitable for beginners learning to understand
BTree
- 写的一个测试树结构的一个程序，对于学习数据结构的同学应该有所帮助吧-Write a test tree structure of a program for students learning data structures should help it
08-link
- 静态链表的一些操作，增删改查,直接在VC中运行即可-Static list of some of the operations, CRUD, you can run directly in the VC
bank
- Queues or stack dont rememeber, for a bank basic c-Queues or stack dont rememeber, for a bank basic c++
test_code
- 算法设计与分析 _4-19 多元Huffman编码问题-Algorithm design and analysis of algorithm design and analysis of _4-more than 19 yuan Huffman coding problem
lianbiao
- 读区文件中的每一行，然后把所有行做成链表，然后把做成链表的行输出-Read each line in the zone file, and then list all the lines made, and then made the list of output lines
Search
- 分别用数组和链表来存储元素，实现特定元素的递归和非递归查找-Arrays and linked lists were used to store the elements to achieve specific elements of recursive and non recursive search