Author: Manuel Lemos
Package: PHP Sorting Algorithms Benchmarker
This package can help developers determining what can be the best method to sort arrays by testing each of the supported method by the package.
Then it can return information about the speed of processing of each of the methods to help developers deciding which is the best method for their purposes.
About the PHP Sorting Algorithms Benchmarker Package
The basic purpose is: Benchmark sorting arrays with different algorithms
Here follows in more detail what it does:
This package can benchmark sorting arrays with different algorithms.
It provides several classes that can sort arrays using several different algorithms like for instance: PHP native sort, bubble, comb, gnome, heap, MatosGoulart, quick and shell.
An additional class can also measure the time each algorithm take sort the arrays and stores the results in a class variable that can be inspected and displayed to compare the results.
This package was considered notable for implementing its benefits in a way that is worth noticing.
Notable PHP packages can be often considered innovative. If this package is also innovative, it can be nominated to the PHP Innovation Award and the author may win prizes and recognition for sharing innovative packages.
If you also developed your own notable or innovative packages consider sharing them, so you can also earn more visibility for your package as well nice prizes.
One nice prize that many PHP developers want and you may like is the PHP elePHPant mascot plush.
You need to be a registered user or login to post a comment
Login Immediately with your account on:
No comments were submitted yet.