This sort can preserve order.  It can be "stable".  

This routine continuously organizes the new data into a data-structure.  The prepared numbers are not fully sorted but is always in a state of near readiness.

This sort gives the lowest successive values in ascending order it provides good short term results.  It can delays sorting the entire list until needed.

This sort is fast if the data is partially sorted data.  Partly sorted data actually shows up a lot in real world applications.

Please handle with care, it does have several disadvantages.   Mostly it is slow for unsorted data.

Multi threaded version of Quicksort. 

This gets work done fast.  

This sort can preserve order.  It can be "stable".  

This sort can preserve order.  It can be "stable".  

This sort can preserve order.  It can be "stable".  

This sort can preserve order.  It can be "stable".  

This sort can preserve order.  It can be "stable".  

This sort can preserve order.  It can be "stable".  

This sort can preserve order.  It can be "stable".  

This sort can preserve order.  It can be "stable".  

This website is a work in progress.

Please feel free to reach out if you have any questions. (Seriously)