# Sorting

Stories about sorting algorithms and their family reunion.

19 Articles

## Bucket Sort - The Sorting Algorithm Family Reunion

Bucket Sort places items in divided buckets, then takes them out in the correct order. He also wants to captain a boat, but there's a problem...

## Radix Sort - The Sorting Algorithm Family Reunion

Radix sort uses the least-significant digit to sort numbers quickly. Plus, he's super chill.

## Gnome Sort - The Sorting Algorithm Family Reunion

Gnome Sort sorts items like a gnome might sort garden pots: inefficiently. She's also an excellent gardener.

## Pigeonhole Sort - The Sorting Algorithm Family Reunion

Pigeonhole Sort creates a set of places to put values in given ranges. He's also a bit of a big child.

## Bitonic Merge Sort - The Sorting Algorithm Family Reunion

Bitonic Merge Sort sorts efficiently on collections with size that is a power of 2, and ONLY those collections.

## Counting Sort - The Sorting Algorithm Family Reunion

Counting Sort counts how many times a number shows up and sorts based on that, but it might not be enough to get her into college.

## Odd-Even Sort - The Sorting Algorithm Family Reunion

Odd-Even Sort compares all numbers in odd-numbered positions to sort them, then all items in even-numbered positions, then gets extra ice cream.

## Bubble Sort - The Sorting Algorithm Family Reunion

Bubble Sort takes two items and reorders them if they are out of order, and then incessantly tells you about doing that.
C#, .NET, Web Tech, The Catch Block, Blazor, MVC, and more!