Sorting in Less Than O(n log n) - Generalizing and Optimizing Radix Sort

Explore an in-depth analysis of advanced sorting techniques in this comprehensive conference talk from CppNow 2017. Delve into the intricacies of radix sort, learning how to generalize and optimize it to achieve sorting speeds faster than O(n log n) for a wide range of data types. Discover how to apply radix sort to various inputs, including integers, floats, doubles, and even custom data structures. Gain insights into the implementation details, optimization strategies, and performance comparisons with standard sorting algorithms. Follow along as the speaker, an AI programmer from Avalanche Studios, breaks down complex concepts, provides code examples, and demonstrates practical applications in C++ programming. Enhance your understanding of efficient sorting algorithms and their potential impact on performance-critical applications, particularly in the context of video game development.

Introduction
Why do I give this talk
Counting sort
Counting sort code
Counting sort example
Swapping
American Flag Sort
Prefix Sort
Generalizing
Recurse
Un 16 char 16
Positive Floats
Doubles
Containers
Sort by first name
Support your types
My answer
Part 2 Optimization
Part 2 Visualization
Part 2 disassembly
Part 2 intuition
New algorithm
Graphs