How-fast-does-it-quicksort Alternatives

Similar projects and alternatives to how-fast-does-it-quicksort

subleq

9 52 4.6 Forth how-fast-does-it-quicksort VS subleq

16-bit SUBLEQ CPU running eForth - just for fun
bit-serial

1 109 6.7 VHDL how-fast-does-it-quicksort VS bit-serial

A bit-serial CPU written in VHDL, with a simulator written in C.
WorkOS

workos.com sponsored

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 number of mentions on this list indicates mentions on common posts plus user suggested alternatives. Hence, a higher number means a better how-fast-does-it-quicksort alternative or higher similarity.

Suggest an alternative to how-fast-does-it-quicksort

how-fast-does-it-quicksort reviews and mentions

Posts with mentions or reviews of how-fast-does-it-quicksort. We have used some of these posts to build our list of alternatives and similar projects. The last one was on 2024-04-03.

The ancient world before computers had stacks or heaps
3 projects | news.ycombinator.com | 3 Apr 2024

Well first of all, both are abstract concepts.
No they aren't. A stack is a specific type of data structure. Recursion isn't even specific to computers.
in computer science stacks are considered to be an abstract data type
I think you meant data structure and they aren't both concepts.
Of course, another way to refer to this kind of a structurally induced data type is to call it recursive.
You are making a linked list. A node in a traditional linked list has data and a pointer to the next node. This is what you are making here. Just because you over complicate a stack by using a linked list, it doesn't mean a 'stack' and 'recursion' are the same thing.
Fundamentally this is functional programming silver bullet syndrome. These things really have nothing to do with recursion, they just putting a square peg in a round hole by using recursion for iteration and linked lists.
It's all fun and games until you get past trivial examples. Then pretending complex iteration and data structures are best done with recursion aren't so fun anymore and you want to control what is actually happening.
One example is this rust quicksort being 40x faster than haskell
https://github.com/LightAndLight/how-fast-does-it-quicksort