资源列表
4
- algorithme de voyageurs de commerce
1003first
- 大数相乘算法，一种在大数很大时的有效算法，减少乘法次数，增加加法的算法-Large Number Multiplication algorithm, a large number is large in the efficient algorithm to reduce the number of multiplication, addition of the algorithm increases
compositor
- 编写函数void fun(int *x,int n),功能是：求出长度为n的数组x中的最大数与 次最大数，并把最大数和a[0]对调，次最大数和a[1]对调，其余的数保持不变。-Write a function void fun (int* x, int n), function is: find the length of the array x n the maximum number and maximum number of times, and the maximum number
convlutionalcode
- 卷积码的编译码代码，译码为维特比译码算法。-Convolutional codes and decoding the code for the Viterbi decoding algorithm.
SP800-22rev1
- NIST的随机数检测算法，包含中文和英文原文两个版本-NIST random number testing algorithm, including two versions of the original Chinese and English
bellman-ford
- bellman-ford的实现。可以输出每条最短路径经过的节点-bellman-ford implementation. After the shortest path to the output node of each
Adaptive-Random-Testing
- 自适应性随机数检测算法，重点比较演化式算法和其他随机数检测算法-Detection of a random number adaptive algorithms, focusing on evolutionary algorithms and comparing a random number of other Detection
Dijkstra
- 设在图G={V,E}中有一顶点r，Dijkstra算法可以求出其他所有点到点r的最短路径的跳数，这是求单源最短路径的一个最基本的算法。-There is a vertex, r, in the graph G={V,E}. As to every other vertex v, there exist several paths between v and r. The Dijkstra algorithm can get the hop count of the shortest path a
suanshuyouxianquan
- 最短路径之贪心算法，用C语言实现，主要是参考了迪杰斯特拉算法。-The greedy algorithm for shortest path
shunxubiao
- 1. 已知顺序表L为按值递增有序的，编写算法将数据元素e插入到顺序表L中，使之仍有序。 2、编写算法删除顺序表L中所有值为e的数据元素。 3、编写算法清除顺序表L中所有重复的数据元素。 4、已知两个集合分别存储在顺序表La和Lb中，编写算法求出两个集合的并存储在Lc中。-1. The known sequence of Table L, increasing ordered by value, write algorithms to data elements L e
maopaopaixu
- 自己写的几种能够实现的冒泡排序算法，希望能对需要的朋友有所帮助，是C++的-Some write their own bubble sort algorithm can be achieved, hoping to help a friend in need is a C++,
phonebook
- 基于顺序表的一个电话薄程序，c++实现，完成电话薄初始化，添加，删除，修改，精确（模糊）查询，按英文字母排序。-Based on the order of the table a telephone book program, c++ implementation of the phone book to complete initialization, add, delete, modify, precise (fuzzy) query, in alphabetical order.