|
| 1 | +# 算法实例 |
| 2 | + |
| 3 | +这个仓库包含各种各样的，由不同的编程语言实现的算法实例。 |
| 4 | + |
| 5 | +## 不同语言的算法实现 |
| 6 | + |
| 7 | + |
| 8 | +语言| Java | Python | Rust | C | C++ | JavaScript | Go | C# | Ruby | Swift | Racket | Perl | Crystal| Kotlin | Haskell |
| 9 | +---|:---:|:---:|:---:|:---:|:---:|:---:|:---:|:---:|:---:|:---:|:---:|:---:|:---:|:---:|:--:| |
| 10 | +A*Search | | :+1: | | | :+1: | | | | | |
| 11 | +BellmanFord | :+1: | | | | :+1: | | | | | |
| 12 | +BestFirstSearch | :+1: | :+1: | | | | | | | :+1: | | |
| 13 | +BinaryGCD | :+1: | | | | :+1: | | | | | | |
| 14 | +BinarySearch | :+1: | :+1: | | :+1: | :+1: | :+1: | :+1: | :+1: | :+1: | :+1: | | | | :+1: | | |
| 15 | +Binary Search Modified | | | | :+1: | | | | | | |
| 16 | +Bitap Algorithm | | :+1: | | | :+1: | | | | | |
| 17 | +BitonicSort | | | | :+1: | | | | | | |
| 18 | +BreadthFirstSearch | :+1: | :+1: | | :+1: | | | | | | |
| 19 | +Borwein's Algorithm | :+1: | :+1: | | | :+1: | | | | | | |
| 20 | +BubbleSort | :+1: | :+1: | :+1: | :+1: | :+1: | :+1: | :+1: | :+1: | :+1: | | | :+1:| | |
| 21 | +Conjugate Gradient | | :+1: | | | :+1: | | | | | | | |
| 22 | +CountingInversions | :+1: | | | |:+1:| | | | | | | |
| 23 | +CountingSort | :+1: | :+1: | | | :+1: | | | | :+1: | | |
| 24 | +CycleSort | :+1: | :+1: | | | :+1: | | | | | | |
| 25 | +DepthFirstSearch | :+1: | :+1: | | | :+1: | :+1: | | | | | |
| 26 | +Dijkstra's | :+1: | :+1: | | | :+1: | :+1: | :+1: | | | | |
| 27 | +Dynamic programming | :+1: | | | | | | | | | | |
| 28 | +Doomsday | :+1: | :+1: | | | :+1: | :+1: | | | :+1: | :+1: | :+1:| | |
| 29 | +EditDistance | | :+1: | | | :+1: | | | | | |
| 30 | +Edmonds-Karp | :+1: | | | | | | | | | |
| 31 | +ElevatorAlgorithm | :+1: | | | | | | | | | |
| 32 | +Fast Fourier Transform | :+1: | :+1: | |:+1: | :+1: | :+1: | | | | |
| 33 | +Fibonacci | :+1: | :+1: | :+1: | :+1: | :+1: | :+1: | :+1: | :+1: | :+1: | :+1: | :+1:| | |
| 34 | +FisherYatesShuffle | :+1: | | | | :+1: | :+1: | | :+1: | :+1: | | |
| 35 | +FloodFill Algorithm | :+1: | :+1: | | | | | | | | |
| 36 | +Floyd'sAlgorithm | :+1: | :+1: | | | :+1: | | | | | |
| 37 | +Greatest Common Divisor | :+1: |:+1:| :+1: | :+1: | :+1: | :+1: | :+1: |:+1:| | |
| 38 | +Hamming Distance | :+1: | :+1: | | :+1: | | :+1: | :+1: | | :+1:| | |
| 39 | +HeapSort | :+1: | :+1: | | | :+1: | :+1: | :+1: | | :+1: | | | | :+1: | | |
| 40 | +Histogram equalization | :+1: | | | | | | | | | |
| 41 | +InsertionSort | :+1: | :+1: | :+1: | :+1: | :+1: | :+1: | :+1: | :+1: | :+1: | | |
| 42 | +Inverse Fast Fourier Transform | | | | | :+1: | | | | | |
| 43 | +Johnson algorithm | :+1: | :+1: | | | :+1: | | | | | |
| 44 | +Kadane's algorithm | :+1: | :+1: | | :+1: | :+1: | :+1: | :+1: | :+1: | | |
| 45 | +Knuth Morris Prath Algorithm | :+1: | :+1: | | | :+1: | | | | | |
| 46 | +Leaky-Bucket | | | | | :+1: | | | | | |
| 47 | +LinearSearch | :+1: | :+1: | :+1: | :+1:| :+1: | :+1: | :+1: | :+1: | | :+1: | | |
| 48 | +Longest common subsequence | :+1: | :+1: | | :+1: | :+1: | | | | :+1: | |
| 49 | +Longest increasing subsequence | :+1: | :+1: | | | :+1: | | | | | |
| 50 | +LongestPath | | :+1: | | | :+1: | | | | | |
| 51 | +MergeSort | :+1: | :+1: | | :+1: | :+1: | :+1: | :+1: | :+1: | | :+1: | | | | | :+1: | |
| 52 | +MiniMax with alpha–beta pruning | :+1: | | | | | | | | | |
| 53 | +Pearson Hashing | :+1: | | | | | | | | | |
| 54 | +Postman Sort | | | | :+1: | | | | | | |
| 55 | +Quick Sort | :+1: | :+1: | :+1: | | | :+1: | :+1: | :+1: | :+1: | :+1: | | | | | :+1: | |
| 56 | +Quick Select | :+1: | :+1: | | :+1: | | | :+1: | | | |
| 57 | +Uniform-cost search | :+1: | | | | | :+1: | :+1: | | | |
| 58 | +RadixSort | :+1: | :+1: | | | :+1: | | | | | |
| 59 | +Rabin-Karp | :+1: | :+1: | | | | | | | | |
| 60 | +SelectionSort | :+1: | :+1: | :+1: | :+1: | :+1: | :+1: | :+1: | :+1: | :+1: | |
| 61 | +SelectionSort (Descending) | | | | | | :+1: | | | | |
| 62 | +ShellSort | :+1: | :+1: | | | :+1: | | | | :+1: | | |
| 63 | +Sieve of Eratosthenes | :+1: | :+1: | | | :+1: | :+1: | :+1: | | | |
| 64 | +UnaryCoding | :+1: | :+1: | | | | :+1: | | | | |
| 65 | +VEGAS Algorithm | | | | | :+1: | | | | | | | |
| 66 | +Tarjan'sOff-LineLCA | | | | | :+1: | | | | | |
| 67 | +TernarySearch | :+1: |:+1: | | :+1: | :+1: | | | | | |
| 68 | +Topological Sort | | | | | :+1: | | | | | |
| 69 | +Segmented Sieve |:+1:| :+1: | | | :+1: | | | | | |
| 70 | +Union Find |:+1:|:+1:| | :+1: | | | | | | |
| 71 | +Xor swap |:+1:|:+1:| |:+1:| |:+1:|:+1:| :+1: | | |
| 72 | +Connected-component labeling | | | | |:+1:| | | | | |
| 73 | +Extended Euclidean algorithm | | | | |:+1:| | | | | |
| 74 | +Knapsack problem | | | |:+1:| | | | | | |
| 75 | + |
| 76 | + |
| 77 | +[算法列表]() |
| 78 | + |
| 79 | +文件目录结构应该有如下格式： |
| 80 | +[**Algorithm name**]/[**language**]/**file** |
| 81 | + |
| 82 | +*举例* |
| 83 | +* **BubbleSort/Go/BubbleSort.go** |
| 84 | +* **QuickSort/C++/QuickSort.cpp** |
| 85 | + |
| 86 | +## License |
| 87 | + |
| 88 | +[Apache License 2.0](LICENSE) |
0 commit comments