#QuickSort
estarei implementando quicksort em C hoje
November 14, 2026 at 1:06 PM
eu prometo que o quicksort tá escondido aí em algum lugar
November 14, 2026 at 11:00 PM
like that oneline quicksort everyone loves
November 10, 2026 at 12:39 AM
não dava pra eu usar qsort() da stdlib
implementei um híbrido quicksort + insertion sort
November 14, 2026 at 1:09 PM
If I'm thinking of the one you're thinking of, it isn't even actually quicksort
November 10, 2026 at 2:51 AM
November 11, 2026 at 6:24 PM
A C++ Quicksort Faster Than std:sort

https://tiki.li/blog/about_blqsort
November 11, 2026 at 6:40 PM
> Keep adding useless unnecessary features until everything becomes Turing complete. I'm looking forward to using a YouTube comment to implement quicksort
November 7, 2026 at 12:41 AM
A C++ Quicksort Faster Than std:sort
comments · posted on 2026.11.10 at 01:28:15 (c=1, p=6)
November 11, 2026 at 6:25 PM
Sure, but what does it sound like when they’re sorted neatly? 😬 youtu.be/fgxgjI1vYVY
Quicksort — The Sound of Sorting 🎵 (You're Hearing Real Operations) | 2
YouTube video by Glass Box Computing
youtu.be
November 14, 2026 at 10:01 AM
A C++ Quicksort Faster Than std::sort
Discussion | lobsters | Author: chkas

#Performance
A C++ Quicksort Faster Than std::sort
tiki.li
November 9, 2026 at 1:08 PM
A C++ Quicksort Faster Than std::sort https://lobste.rs/s/qi2lni ##c ##c++ ##performance
A C++ Quicksort Faster Than std::sort
tiki.li
November 9, 2026 at 1:00 PM
A C++ Quicksort Faster Than std::sort
Comments
tiki.li
November 10, 2026 at 7:47 AM
On Secure Sorting and Its Application to Privacy-Preserving Graph Pattern Matching (Marcel Keller) ia.cr/2026/2457
November 9, 2026 at 1:43 AM
A Python function can call itself. It's called recursion.

The tutorial uses it to count down, walk a nested list and sort with quicksort, and shows each one beside a version without recursion.

realpython.com/python-recur...
Recursion in Python: An Introduction – Real Python
Get to grips with Python recursion: what it is, how it works, when to reach for it, and how recursive and iterative solutions compare.
realpython.com
November 4, 2026 at 11:30 PM
What you're telling me is that, after the Butlerian Jihad, those that still know how to code a quicksort routine or a toon shader will be looked upon as some sort of wizards.
October 28, 2026 at 10:50 PM
Un euro per ogni volta che ordini i risultati con quicksort.
October 26, 2026 at 4:42 PM
bah i think the chapter boundaries were inaccurate

'complexity [at least in regards to cryptography] seems to be lacking in telling us how fast things actually run on computers; we don't have good formalizations to tell us why quicksort is faster than mergesort in practice for example;'
October 27, 2026 at 6:11 PM
I once was asked to literally write a quicksort on a whiteboard. Another time I was presented the problem, so I started a discussion and proposed few approaches, but heard: "thank you but the answer was RB-tree".
October 23, 2026 at 10:21 AM
Sorted! The latest version of MP-SPDZ includes Quicksort, improved radix sort, sparse matrix multiplication, and graph cycle detection, all facilitated by more efficient oblivious shuffling in the semi-honest two-party setting. github.com/data61/MP-SP...
Release More sorting, efficient two-party shuffling, sparse matrix multiplication, graph cycle detection · data61/MP-SPDZ
Secure two-party binary shuffle as in Peceny et al. Secure Quicksort Sparse matrix multiplication Graph cycle detection More efficient radix sort as in Asharov et al. Efficient two-party MUX as in ...
github.com
October 16, 2026 at 5:33 AM
for instance, once hylomorphisms are introduced, we get a bunch of definitions of practical functions like list concatenation, tree flattening, list partitioning, quicksort, merge sort

this is fine but.. its not calculating to just say "here's the definition of quicksort"
October 15, 2026 at 4:20 PM
Sorted? My latest paper shows when to use which sorting in MPC, and how to apply it to sparse matrix multiplication and graph cycle detection. eprint.iacr.org/2026/2457
October 15, 2026 at 2:00 AM
This week's progress on Toy:

* Implemented Array.flatten()
* Implemented Array.sort(fn)

'sort()' uses my implementation of quicksort, using the arg as the comparator. That was not an easy task, and there's likely hidden gotchas, but I'm happy for now.

#coding #gamedev #langdev #toylang
Front Page - The Toy Scripting Language
Documentation For The Toy Scripting Language
toylang.com
October 11, 2026 at 11:51 PM
Same dude that named quicksort
October 7, 2026 at 2:05 AM