Implementation of Algorithms and Data Structures, Problems and Solutions

A fast branchless stable quicksort / mergesort hybrid that is highly adaptive.

This is a web app built to visualize classic sorting algorithms such as insertion sort, merge sort, quick sort, heap sort, etc. The entire app is built with only React; no other third-party JS or CSS library has been used.

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

Robin Hood Sort, for uniform data

Super fast algorithms for typescript

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

Implementation of a few sorting algorithms in OpenCL

All DSA topics covered in UIU DSA-I course, both lab and theory courses. Check DSA-2 Topics: https://github.com/TashinParvez/Data_Structure_and_Algorithms_2_UIU

Code for various YouTube video lessons + extras

Image glitch visualization using various Pixel Sorting methods for Processing

A GUI program to visualize sorting algorithms

Implementation of Origami: A High-Performance Mergesort Framework

🍡 Visualize the process of sorting algorithms simply

Stable sort algorithms and their stability proofs in Coq

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

This repository serves as a comprehensive resource for understanding and implementing various data structures and algorithms

This repository supplements a mobile app on algorithm and data structure visualization, providing code for the concepts demonstrated in the app. It's an essential resource for users seeking to understand and explore these implementations in detail.

Sorting algorithms in Java