<!-- mobian-agent-page publisher="dailydev" canonical="https://daily.dev/posts/branchless-quicksort-lqrg1x2cu" -->

---
title: Branchless Quicksort | daily.dev
description: blqsort is a branchless quicksort implementation available as single-header C and C++ libraries. It achieves significant speedups over std::sort and pdqsort by...
canonical: https://daily.dev/posts/branchless-quicksort-lqrg1x2cu
twitter:card: summary_large_image
twitter:site: @dailydotdev
og:type: website
og:site_name: daily.dev
og:title: Branchless Quicksort | daily.dev
og:description: blqsort is a branchless quicksort implementation available as single-header C and C++ libraries. It achieves significant speedups over std::sort and pdqsort by...
og:url: https://daily.dev/posts/branchless-quicksort-lqrg1x2cu
og:image: https://api.daily.dev/og/posts/LqrG1X2CU.png
og:image:alt: Branchless Quicksort
og:image:width: 1200
og:image:height: 630
og:locale: en
---

> ## Documentation Index
> Fetch the complete documentation index at: https://daily.dev/llms.txt
> Use this file to discover all available pages before exploring further.

# Branchless Quicksort

**[Lobsters](https://daily.dev/sources/lobsters)** · 4 min read · 1 upvotes · 0 comments

## Summary

blqsort is a branchless quicksort implementation available as single-header C and C++ libraries. It achieves significant speedups over std::sort and pdqsort by avoiding branch mispredictions through an auxiliary-buffer partitioning strategy, sorting networks for small arrays (2–12 elements), median-of-medians pivot selection, and a BlockQuicksort variant for non-trivially-copyable types. Benchmarks on Apple M1 and AMD Ryzen show blqsort sorting 50 million doubles in ~0.97s vs 1.33s for std::sort and pdqsort, and sorting 50 million custom structs in ~0.96s vs ~3.46s. Both single-threaded and multithreaded (C++ threads / POSIX threads) variants are provided.

## Full article

daily.dev links to this article rather than hosting it. Read it at the original source: <https://tiki.li/blog/blqsort>

## Similar posts on daily.dev

- [Fast sorting, branchless by design](https://daily.dev/posts/fast-sorting-branchless-by-design-w7ar77tfp) · Lobsters · 0 upvotes · 0 comments
- [Branchless sorting of trivially relocatable types](https://daily.dev/posts/branchless-sorting-of-trivially-relocatable-types-wkk1fdg6n) · Arthur O'Dwyer · 0 upvotes · 0 comments
- [Hoare’s Rebuttal and Bubble Sort’s Comeback](https://daily.dev/posts/hoare-s-rebuttal-and-bubble-sort-s-comeback-gkcrqjicr) · Lobsters · 0 upvotes · 0 comments
- [Lucky Code](https://daily.dev/posts/lucky-code-jwiwesdsx) · Hacker News · 0 upvotes · 0 comments

---

Tags: [#general-programming](https://daily.dev/tags/general-programming), [#performance](https://daily.dev/tags/performance)

[View this post on daily.dev](https://daily.dev/posts/branchless-quicksort-lqrg1x2cu)

```json
{"@context":"https://schema.org","@graph":[{"@type":"Organization","@id":"https://daily.dev/#organization","name":"daily.dev","url":"https://daily.dev","logo":{"@type":"ImageObject","url":"https://daily.dev/apple-touch-icon.png","width":180,"height":180},"sameAs":["https://twitter.com/dailydotdev","https://github.com/dailydotdev","https://www.linkedin.com/company/daily-dev-ltd"]},{"@type":"WebSite","@id":"https://daily.dev/#website","url":"https://daily.dev","name":"daily.dev","publisher":{"@id":"https://daily.dev/#organization"},"potentialAction":{"@type":"SearchAction","target":{"@type":"EntryPoint","urlTemplate":"https://daily.dev/search?q={search_term_string}"},"query-input":"required name=search_term_string"}}]}
{"@context":"https://schema.org","@type":"TechArticle","headline":"Branchless Quicksort","url":"https://daily.dev/posts/branchless-quicksort-lqrg1x2cu","mainEntityOfPage":{"@type":"WebPage","@id":"https://daily.dev/posts/branchless-quicksort-lqrg1x2cu"},"datePublished":"2026-06-05T14:25:06.494Z","dateModified":"2026-06-05T14:25:31.550Z","description":"blqsort is a branchless quicksort implementation available as single-header C and C++ libraries. It achieves significant speedups over std::sort and pdqsort by...","image":"https://media.daily.dev/image/upload/s--1KxV4ohY--/f_auto/v1722860400/public/Placeholder%2007","thumbnailUrl":"https://media.daily.dev/image/upload/s--1KxV4ohY--/f_auto/v1722860400/public/Placeholder%2007","isAccessibleForFree":true,"articleSection":"Lobsters","inLanguage":"en","publisher":{"@type":"Organization","name":"daily.dev","url":"https://daily.dev","logo":{"@type":"ImageObject","url":"https://daily.dev/apple-touch-icon.png","width":180,"height":180}},"author":{"@type":"Organization","name":"Lobsters","logo":"https://media.daily.dev/image/upload/s--tl8v_Fku--/f_auto,t_logo/v1698841318/logos/lobste.jpg","url":"https://daily.dev/sources/lobsters"},"commentCount":0,"discussionUrl":"https://daily.dev/posts/branchless-quicksort-lqrg1x2cu","interactionStatistic":[{"@type":"InteractionCounter","interactionType":{"@type":"LikeAction"},"userInteractionCount":1},{"@type":"InteractionCounter","interactionType":{"@type":"CommentAction"},"userInteractionCount":0}],"keywords":"general-programming,performance","timeRequired":"PT4M"}
{"@context":"https://schema.org","@type":"BreadcrumbList","itemListElement":[{"@type":"ListItem","position":1,"name":"Home","item":"https://daily.dev"},{"@type":"ListItem","position":2,"name":"Lobsters","item":"https://daily.dev/sources/lobsters"},{"@type":"ListItem","position":3,"name":"Branchless Quicksort"}]}
```

