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:
- Bubble Sort
- Insertion Sort
- Selection Sort
- Bucket Sort
- Merge Sort
- Quick Sort
- Counting Sort
- Binary Search
- Ternary Search
- Jump Search
- Linear Search
- Exponential Search
SearchingBenchmark.cs
& SortingBenchmark.cs
var searchingBenchmarkSummary = BenchmarkRunner.Run<SearchingBenchmark>();
or
var sortingBenchmarkSummary = BenchmarkRunner.Run<SortingBenchmark>();
Then run the project in Release Mode
Note : BuiltIn Sorting algorithm uses an unstable version of QuickSort, and after .NET 4.5 it now uses Insertion sort for n<16, otherwise it starts with Quicksort and switches to Heapsort when the number of partitions (recursion depth?) exceeds 2 * Log^N. Called: Introsort, and that explains why it is the fastest.
- Bubble Sort : https://www.programiz.com/dsa/bubble-sort
- Insertion Sort : https://www.programiz.com/dsa/insertion-sort
- Selection Sort : https://www.programiz.com/dsa/selection-sort
- Bucket Sort : https://www.programiz.com/dsa/bucket-sort
- Merge Sort : https://www.programiz.com/dsa/merge-sort
- Quick Sort : https://www.programiz.com/dsa/quick-sort
- Counting Sort : https://www.programiz.com/dsa/counting-sort
- Binary Search : https://www.programiz.com/dsa/binary-search
- Ternary Search : Same as binary search but with dividing in 3 sections.
- Jump Search : https://en.wikipedia.org/wiki/Jump_search
- Linear Search : https://www.programiz.com/dsa/linear-search
- Exponential Search : https://en.wikipedia.org/wiki/Exponential_search