The APIs are flexible and easy-to-use, supporting authentication, user identity, and complex enterprise features like SSO and SCIM provisioning. Learn more →
Top 23 Sort Open-Source Projects
-
-
JavaScript
Algorithms and Data Structures implemented in JavaScript for beginners, following best practices. (by TheAlgorithms)
4. The Algorithm - Javascript
-
SurveyJS
Open-Source JSON Form Builder to Create Dynamic Forms Right in Your App. With SurveyJS form UI libraries, you can build and style forms in a fully-integrated drag & drop form builder, render them in your JS app, and store form submission data in any backend, inc. PHP, ASP.NET Core, and Node.js.
-
C-Plus-Plus
Collection of various algorithms in mathematics, machine learning, computer science and physics implemented in C++ for educational purposes.
-
sortablejs
Reorderable drag-and-drop lists for modern browsers and touch devices. No jQuery or framework required.
Well, it worked. But only for one case: dragging stuff within only one column. You see, stimulus-sortable uses SortableJS under the hood, which is powerful.
-
-
C
Collection of various algorithms in mathematics, machine learning, computer science, physics, etc implemented in C for educational purposes.
-
Project mention: How do you go about the lack of built in data structure like stack, queue for LeetCode | /r/golang | 2023-05-24
for len(stack) > 0 { n := len(stack) - 1 // Top element fmt.Print(stack[n]) stack = stack[:n] // Pop } ``` Another solution would be to import a package like https://github.com/emirpasic/gods
-
InfluxDB
Power Real-Time Data Analytics at Scale. Get real-time insights from all types of time series data with InfluxDB. Ingest, query, and analyze billions of data points in real-time with unbounded cardinality.
-
list.js
The perfect library for adding search, sort, filters and flexibility to tables, lists and various HTML elements. Built to be invisible and work on existing HTML.
-
-
-
mixitup
A high-performance, dependency-free library for animated filtering, sorting, insertion, removal and more
-
-
-
In my example the table stores the hash codes themselves instead of the keys (because the hash function is invertible)
Oh, I see, right. If determining the home bucket is trivial, then the back-shifting method is great. The issue is just that it’s not as much of a general-purpose solution as it may initially seem.
“With a different algorithm (Robin Hood or bidirectional linear probing), the load factor can be kept well over 90% with good performance, as the benchmarks in the same repo demonstrate.”
I’ve seen the 90% claim made several times in literature on Robin Hood hash tables. In my experience, the claim is a bit exaggerated, although I suppose it depends on what our idea of “good performance” is. See these benchmarks, which again go up to a maximum load factor of 0.95 (Although boost and Absl forcibly grow/rehash at 0.85-0.9):
https://strong-starlight-4ea0ed.netlify.app/
Tsl, Martinus, and CC are all Robin Hood tables (https://github.com/Tessil/robin-map, https://github.com/martinus/robin-hood-hashing, and https://github.com/JacksonAllan/CC, respectively). Absl and Boost are the well-known SIMD-based hash tables. Khash (https://github.com/attractivechaos/klib/blob/master/khash.h) is, I think, an ordinary open-addressing table using quadratic probing. Fastmap is a new, yet-to-be-published design that is fundamentally similar to bytell (https://www.youtube.com/watch?v=M2fKMP47slQ) but also incorporates some aspects of the aforementioned SIMD maps (it caches a 4-bit fragment of the hash code to avoid most key comparisons).
As you can see, all the Robin Hood maps spike upwards dramatically as the load factor gets high, becoming as much as 5-6 times slower at 0.95 vs 0.5 in one of the benchmarks (uint64_t key, 256-bit struct value: Total time to erase 1000 existing elements with N elements in map). Only the SIMD maps (with Boost being the better performer) and Fastmap appear mostly immune to load factor in all benchmarks, although the SIMD maps do - I believe - use tombstones for deletion.
I’ve only read briefly about bi-directional linear probing – never experimented with it.
-
-
prettier-plugin-sort-imports
A prettier plugin to sort imports in typescript and javascript files by the provided RegEx order.
Project mention: Tailwind CSS: Automatic Class Sorting with Prettier | news.ycombinator.com | 2024-01-18In a similar vein, you can sort imports with Prettier using Trivago’s plugin.
-
-
Project mention: 10~17x faster than what? A performance analysis of Intel x86-SIMD-sort (AVX-512) | news.ycombinator.com | 2023-06-10
https://github.com/scandum/quadsort/blob/f171a0b26cf6bd6f6dc...
As you can see, quadsort 1.1.4.1 used 2 instead of 4 writes in the bi-directional parity merges. This was in June 2021, and would have compiled as branchless with clang, but as branched with gcc.
When I added a compile time check to use ternary operations for clang I was not adapting your work. I was well aware that clang compiled ternary operations as branchless, but I wasn't aware that rust did as well. I added the compile time check to use ternary operations for a fair performance comparison against glidesort.
https://raw.githubusercontent.com/scandum/fluxsort/main/imag...
As for ipnsort's small sort, it is very similar to quadsort's small sort, which uses stable sorting networks, instead of unstable sorting networks. From my perspective it's not exactly novel. I didn't go for unstable sorting networks in crumsort to increase code reuse, and to not reduce adaptivity.
-
-
Project mention: Junction/association/Link Table VS Join ( Entity Framework Core ) | /r/learnprogramming | 2023-04-26
Biarity/Sieve: ⚗️ Clean & extensible Sorting, Filtering, and Pagination for ASP.NET Core (github.com)
-
-
-
Project mention: SIMD based custom object and key-value pair sorting in C++ | news.ycombinator.com | 2024-02-14
-
WorkOS
The modern identity platform for B2B SaaS. The APIs are flexible and easy-to-use, supporting authentication, user identity, and complex enterprise features like SSO and SCIM provisioning.
NOTE:
The open source projects on this list are ordered by number of github stars.
The number of mentions indicates repo mentiontions in the last 12 Months or
since we started tracking (Dec 2020).
The latest post mention was on 2024-03-16.
Sort related posts
- Need a Quick Favor: Help a Student with a Simple Click!
- How to auto sort imports in frontend, example with typescript & nextjs
- Doubt regarding counting sort
- [Learn Programming] J'ai créé un site Web pour visualiser et apprendre des algorithmes de tri, avec description et implémentations dans plusieurs langages de programmation
- Junction/association/Link Table VS Join ( Entity Framework Core )
- ASP.NET Core MVC Generic Repository only works with a specific Context. (Need help)
- Most flexible way to query data from database
-
A note from our sponsor - WorkOS
workos.com | 18 Apr 2024
Index
What are some of the best open-source Sort projects? This list will help you:
| Project | Stars | |
|---|---|---|
| 1 | Java | 56,582 |
| 2 | JavaScript | 31,191 |
| 3 | C-Plus-Plus | 29,048 |
| 4 | sortablejs | 28,610 |
| 5 | algorithms | 23,516 |
| 6 | C | 17,961 |
| 7 | gods | 15,385 |
| 8 | list.js | 11,160 |
| 9 | muuri | 10,676 |
| 10 | Tabulator | 6,167 |
| 11 | mixitup | 4,500 |
| 12 | java-algorithms-implementation | 4,362 |
| 13 | gridjs | 4,266 |
| 14 | Klib | 4,010 |
| 15 | AlgoDS | 3,418 |
| 16 | prettier-plugin-sort-imports | 2,945 |
| 17 | deep_sort_pytorch | 2,699 |
| 18 | quadsort | 2,104 |
| 19 | eloquent-sortable | 1,336 |
| 20 | Sieve | 1,141 |
| 21 | mega-interview-guide | 1,069 |
| 22 | gostl | 982 |
| 23 | x86-simd-sort | 794 |
The modern identity platform for B2B SaaS
The APIs are flexible and easy-to-use, supporting authentication, user identity, and complex enterprise features like SSO and SCIM provisioning.
workos.com