Skip to content
#

sortingalgorithms

Here are 33 public repositories matching this topic...

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.

  • Updated Jan 22, 2018
  • Java

Improve this page

Add a description, image, and links to the sortingalgorithms topic page so that developers can more easily learn about it.

Curate this topic

Add this topic to your repo

To associate your repository with the sortingalgorithms topic, visit your repo's landing page and select "manage topics."

Learn more