Fully managed B+ Tree implementation for local data storage; ported to .NET Standard 2.0. Forked from: https://github.com/csharptest/CSharpTest.Net.Collections.
Simple generic mergesort method implement the mergersort algorithm (since in c# sort method uses quick sort). To use simple invoke the static method:
For version 1.1.6: use MergeSort<T>.Sort(IEnumerable<T> tosort), it returns result in IEnumerable<T> type.
For version 1.0.0: use...
More information
A fast sorting algorithm for all datatypes using IComparable(ints, floats, decimals, strings, etc.).Outperforms generic mergesorts and leverages parallel processing for larger arrays.
This package contains the following sorting algorithms: Bubblesort, Selectionsort, Insertionsort, Heapsort, Mergesort and Countingsort. You can use it like standard sort. Example: List.Sort() => List.SortWithHeapSort()