资源列表
simple_linked_list
- Functions to create and manage linked-lists in C language. It includes node sorting and searching implementing quicksort and binary-search algorithms.
KMP-algorithm
- KMP算法是一种用于字符串匹配的算法,这个算法的高效之处在于当在某个位置匹配不成功的时候可以根据之前的匹配结果从模式字符串的另一个位置开始,而不必从头开始匹配字符串-KMP string pattern matching algorithm
Array-Randomize-(Discrete)
- A VB program to randomize data entered in an array
doublinklist
- Double linked list- a doubly-linked list is a linked data structure that consists of a set of sequentially-linked records called nodes. Each node contains two fields, called links, that are references to the previous and to the next node in the seque
bubble
- Selection sort is a sorting algorithm, specifically an in-place comparison sort. It has O(n2) complexity, making it inefficient on large lists, and generally performs worse than the similar insertion sort. Selection sort is noted for its simplicity,
insertion
- Insertion sort is a simple sorting algorithm: a comparison sort in which the sorted array (or list) is built one entry at a time. It is much less efficient on large lists than more advanced algorithms such as quicksort, heapsort, or merge sort
optimizer
- a cpp code for particle swarm optimization method
psomain
- a main test code of pso method
dgmopso
- Another cpp file for the pso method of solving optimization problems
optimizer
- One part of the pso method for solving optimization, it is necessary in realizing the algorithm
RANSAC-algorithm
- RANSAC为Random Sample Consensus的缩写，它是根据一组包含异常数据的样本数据集，计算出数据的数学模型参数，并得到有效样本数据的算法。-RANSAC stands for the Random Sample Consensus, which is based on a set of sample data that contains abnormal data set, a mathematical model to calculate the parameters of
neuralnet
- 人工智能的三个算法,和大家分享下.希望大家喜欢！-The three artificial intelligence algorithms, and share with you. Hope you like!