PHP 5.4+ library to represent equivalence relations and strategies for hashing and sorting values.
-
Updated
Sep 9, 2017 - PHP
PHP 5.4+ library to represent equivalence relations and strategies for hashing and sorting values.
Client Side
A project for my last year of computer science. A algorithm that adaquatly sorts an array with only 300 comparisons. The arrays consist of double values and can be 100, 120, 140 or 160 elements long. The goal is that TimeSort can sort 90% of all arrays with a kendall correlation to the completely sorted array of at least 0.4.
Add a description, image, and links to the sorting-values topic page so that developers can more easily learn about it.
To associate your repository with the sorting-values topic, visit your repo's landing page and select "manage topics."