Quadsort is a stable non-recursive adaptive merge sort which is faster than quicksort.

Hayate-Shiki is an improved merge sort algorithm with the goal of "faster than quick sort".

Sorting algorithm quicker than MergeSort, and is adaptive and stable.

Highly-optimized sorting implemention in C++, including insertsort, shellsort, heapsort, quicksort, mergesort, timsort

algorithms study guid/reference

Comparison of Timsort and Quicksort for ICS4U

An open source nodeJS backend that retrieves and parses Youtube data via the Google Youtube APIs

МГТУ ИУ7 "Анализ алгоритмов" лабораторные работы

Implementing and testing various sorting algorithms.

Author: Matthew Munns and Ahnaf Prio. Multi-lab exercise on developing the fastest sorting algorithm for a given type of data. By "fast" we mean the actual running time and not the Big-Theta approximation. The solutions are developed in Java and were ran on a single processor.

Timsort algorithm for sorting done in C language.

Python implementation of most popular algorithms

a linked list data structure that has easy functions but powerful performance.

Implementation of all the sorting algorithms