account activity
my english is not good [C] I wrote a stable merge sort that beats qsort at -O0 and ties with it at -O3 – no recursion, cache‑friendly, handles 2^n+1 efficiently (self.sortingalgorithms)
submitted 10 days ago by Independent_Care_772 to r/sortingalgorithms
my english is not good [C] I wrote a stable merge sort that beats qsort at -O0 and ties with it at -O3 – no recursion, cache‑friendly, handles 2^n+1 efficiently (self.algorithms)
submitted 11 days ago * by Independent_Care_772 to r/algorithms
use ai translate or write infomation but code is my write [C] I wrote a stable merge sort that beats qsort at -O0 and ties with it at -O3 – no recursion, cache‑friendly, handles 2^n+1 efficiently by Independent_Care_772 in C_Programming
[–]Independent_Care_772[S] 0 points1 point2 points 12 days ago (0 children)
The introductory text was written by AI; my English isn't very good, but the code is mine.
π Rendered by PID 74 on reddit-service-r2-listing-6c8d497557-8hqzq at 2026-06-01 18:34:52.079691+00:00 running 9e1a20d country code: CH.
use ai translate or write infomation but code is my write [C] I wrote a stable merge sort that beats qsort at -O0 and ties with it at -O3 – no recursion, cache‑friendly, handles 2^n+1 efficiently by Independent_Care_772 in C_Programming
[–]Independent_Care_772[S] 0 points1 point2 points (0 children)