Download the PHP package carloswph/sorter without Composer
On this page you can find all versions of the php package carloswph/sorter. It is possible to download/install these versions without Composer. Possible dependencies are resolved automatically.
Download carloswph/sorter
More information about carloswph/sorter
Files in carloswph/sorter
Package sorter
Short Description Collection of sorting algorithms with annotations on procedures, history and functioning details.
License GPL-2.0-only
Informations about the package sorter
Sorter
Collection of sorting algorithms implemented in PHP classes. Also, a benchmarking class for doing performance tests using any array and passing it through all available sorting algorithms. At this moment, this library can sort arrays in the following sorting algorithms:
- PHP sort()
- Quick Sorting
- Bubble Sorting
- Heap Sorting
- Gnome Sorting
- Shell Sorting
- Comb Sorting
- Insertion Sorting
- Merge Sorting
- Selection Sorting
- Matos-Goulart Simple Sorting (recently created by myself)
Matos-Goulart Simple Sorting Algorithm © 2021 by Carlos Artur C. S. Matos is licensed under Attribution 4.0 International .
All sorting algorithms can be applied to any array of integers using the respective static method. Also, using the class Benchmark() the developer can perform all sorting methods at once, and get a var_dump() of the benchmark times in seconds. Also, we compare all sort methods in the becnhmark with PHP's native sort() function, as reference.
Usage
Obviously, all other sorting methods will result in the same response array - as the main objective of this library is to realize benchmarking tests amongst all possible algorithms, rather than sorting numbers itself. All details on the algorithms and some pseudocode for implementations in other programming languages can be found on each class' docblock comments.
Benchmark
Also, this library has a Benchmark class, which can be used to subject an array to all sorting methods, and then return benchmark times for each of the sorting algorithms. As simple as follows: