Sorting

Explanation and implementation of a few sorting algorithms, some well known, others not so much.

Esta página está en inglés. Si usted lo prefiere, puede leer la versión española

License

1. The source code is distributed under an MIT license.

2. The documentation is licensed under a Creative Commons Attribution 3.0 Unported License.

History

I started this project in 2013. It was happily hosted in Google Code until 2015, when they finally shut it down.

The original project name was "combsortcs2p-and-other-sorting-algorithms". By that time I was playing with Combsort variants.

Current state

I plan to adapt all the contents to GitHub, starting with Heapsort, and then Smoothsort. But first I must adapt the pages about computational complexity...

Stay tuned ;-)

Table of contents

• Insertion sort
• Bubble sort
• Comb sort
• Heap sort
• Smooth sort
• Quick sort
• Appendices
  • "Big O" notation
  • Stable sort
  • About the claims of O(N) best case
  • Optimization of the chained swaps