ncruces/sort
View on GitHub ↗ ★ 22 Go
Sorting algorithms implemented in Go
7 mentions on Hacker News by 1 person: 0 stories, 7 comments · first 2024-07-25 · latest 2026-10-13
20082026
-
…used in practice. This one is just not true . Here it is in 255 lines of well commented Go code: https://github.com/ncruces/sort/blob/v1.0.3/quick/quick.go It's worse case linear, as used for sorting it beats the Go standard library on the…
comment by ncruces · 2026-10-13 · in A look at the math that OpenAI claims computes faster Fourier transforms -
…[1] for my sorting repo [2] (thanks invzhi!) 1: https://github.com/invzhi/sorting-visualization/ 2: https://github.com/ncruces/sort Those choices (what counts as a step) are interesting because e.g. for my quicksort they make it look…
comment by ncruces · 2026-06-25 · in 15 sorting algorithms in 6 minutes (2013) [video] -
…compact Shell sort can be. C: https://github.com/ncruces/go-sqlite3/blob/main/sqlite3/libc... Go: https://github.com/ncruces/sort/blob/main/shell/shell.go
comment by ncruces · 2026-01-04 · in Sorting with Fibonacci Numbers and a Knuth Reward Check -
…I was able to use this to implement practical deterministic linear time median selection in Go: https://github.com/ncruces/sort/blob/main/quick/quick.go
comment by ncruces · 2025-12-13 · in Fast Median Filter over arbitrary datatypes -
…and found it extremely useful to validate the properties of my Quicksort implementation. https://github.com/ncruces/sort
comment by ncruces · 2025-05-09 · in Reservoir Sampling -
…it needs to be covered. There's more to learn from 200 lines of Quicksort than from Mergesort: https://github.com/ncruces/sort/blob/main/quick/quick.go
comment by ncruces · 2025-02-24 · in Sublinear Time Algorithms -
…in Go, that's (hopefully) simple enough to be understandable, yet minimally practical: https://github.com/ncruces/sort/blob/main/quick/quick.go
comment by ncruces · 2024-07-25 · in My Favorite Algorithm: Linear Time Median Finding (2018)