|
| 1 | +# Algorithms.NET |
| 2 | +## Open source library containing the most used sorting and searching algorithms. |
| 3 | + |
| 4 | +In this library you can find the most used sorting & searching algorithms and that are must know for developers, and their implementation, these algorithms are as follows: |
| 5 | + |
| 6 | +### Sorting: |
| 7 | +- Bubble Sort |
| 8 | +- Insertion Sort |
| 9 | +- Selection Sort |
| 10 | +- Bucket Sort |
| 11 | +- Merge Sort |
| 12 | +- Quick Sort |
| 13 | +- Counting Sort |
| 14 | + |
| 15 | +### Searching: |
| 16 | +- Binary Search |
| 17 | +- Ternary Search |
| 18 | +- Jump Search |
| 19 | +- Linear Search |
| 20 | +- Exponential Search |
| 21 | + |
| 22 | + |
| 23 | +### You can play with these algorithms in ```Algorithms.NET.Debug``` |
| 24 | + |
| 25 | +### To view and compare performance of each algorithm, manipulate the code inside : |
| 26 | +```SearchingBenchmark.cs``` & ```SortingBenchmark.cs``` |
| 27 | +### To run the benchmarks, comment out : |
| 28 | +```var searchingBenchmarkSummary = BenchmarkRunner.Run<SearchingBenchmark>();``` |
| 29 | +</br> |
| 30 | +or |
| 31 | +</br> |
| 32 | + ```var sortingBenchmarkSummary = BenchmarkRunner.Run<SortingBenchmark>();``` |
| 33 | + |
| 34 | + Then run the project in ```Release Mode``` |
| 35 | + |
| 36 | + ### Here is the explanation of each algorithm: |
| 37 | + |
| 38 | +### Sorting: |
| 39 | +- Bubble Sort : https://www.programiz.com/dsa/bubble-sort |
| 40 | +- Insertion Sort : https://www.programiz.com/dsa/insertion-sort |
| 41 | +- Selection Sort : https://www.programiz.com/dsa/selection-sort |
| 42 | +- Bucket Sort : https://www.programiz.com/dsa/bucket-sort |
| 43 | +- Merge Sort : https://www.programiz.com/dsa/merge-sort |
| 44 | +- Quick Sort : https://www.programiz.com/dsa/quick-sort |
| 45 | +- Counting Sort : https://www.programiz.com/dsa/counting-sort |
| 46 | + |
| 47 | +### Searching: |
| 48 | +- Binary Search : https://www.programiz.com/dsa/binary-search |
| 49 | +- Ternary Search : Same as binary search but with dividing in 3 sections. |
| 50 | +- Jump Search : https://en.wikipedia.org/wiki/Jump_search |
| 51 | +- Linear Search : https://www.programiz.com/dsa/linear-search |
| 52 | +- Exponential Search : https://en.wikipedia.org/wiki/Exponential_search |
0 commit comments