combsort.h
optimized combsort macro (by FrozenVoid)
sort-test
A simple sort benchmarking tool (by hareball)
| combsort.h | sort-test | |
|---|---|---|
| 1 | 1 | |
| 0 | 0 | |
| - | - | |
| 0.0 | 0.0 | |
| almost 2 years ago | almost 2 years ago | |
| C | C | |
| - | GNU General Public License v3.0 only |
The number of mentions indicates the total number of mentions that we've tracked plus the number of user suggested alternatives.
Stars - the number of stars that a project has on GitHub. Growth - month over month growth in stars.
Activity is a relative number indicating how actively a project is being developed. Recent commits have higher weight than older ones.
For example, an activity of 9.0 indicates that a project is amongst the top 10% of the most actively developed projects that we are tracking.
Stars - the number of stars that a project has on GitHub. Growth - month over month growth in stars.
Activity is a relative number indicating how actively a project is being developed. Recent commits have higher weight than older ones.
For example, an activity of 9.0 indicates that a project is amongst the top 10% of the most actively developed projects that we are tracking.
combsort.h
Posts with mentions or reviews of combsort.h.
We have used some of these posts to build our list of alternatives
and similar projects. The last one was on 2022-07-04.
sort-test
Posts with mentions or reviews of sort-test.
We have used some of these posts to build our list of alternatives
and similar projects.
-
sort algorithm comparison tool
You can see the (open source) sort tool here: https://github.com/hareball/sort-test
What are some alternatives?
When comparing combsort.h and sort-test you can also consider the following projects:
crumsort - A branchless unstable quicksort / mergesort that is highly adaptive.
quadsort - Quadsort is a branchless stable adaptive mergesort faster than quicksort.
rhsort - Robin Hood Sort, for uniform data
Fortress-of-Solitude - This Library has resources to solve common data structure algorithm problems like a Doubly linked list, Generic trees, Queue, Stack, and other algorithms. Each lib has an option to carry your custom data in elements. Custom data in detail, other fantastic resources.
blitsort - Blitsort is an in-place stable adaptive rotate mergesort / quicksort.
c-sorter - [IN DEVELOPMENT] This is my sorting algorithm.
simplest-sort - The simplest sorting algorithm that sorts in quadratic time