timsort

Quadsort is a branchless stable adaptive mergesort faster than quicksort.

Generic algorithms and data structures for Lazarus/Free Pascal

General purpose C# code library.

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

Various Sorting Algorithms with golang

Implementing and testing various sorting algorithms.

algorithms study guid/reference

A Persian Presentation About Timsort Algorithm Implemented for Python

collection of tested Go integer sort algorithms

A new recursive MergeSort++ which is a variant of classical merge sort.

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

Master's | Basic Algorithms & Data structures | Module 4 | Sorting Algorithms

Computational Thinking Algorithms (CTA) Project. Micro benchmark of 5 sorting algorithms: Insertion sort, Merge Sort, Counting Sort, Quicksort and Timsort.

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

Comparison of Timsort and Quicksort for ICS4U

Timsort Algorithm Visualizer is a Computer Graphics Mini project developed using OpenGL.

Study material on the TimSort method 👩‍🏫