Quadsort is a branchless stable adaptive mergesort faster than quicksort.

Blitsort is an in-place stable adaptive rotate mergesort / quicksort.

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

A branchless unstable quicksort / mergesort that is highly adaptive.

Implementation of various Data Structures and algorithms - Linked List, Stacks, Queues, Binary Search Tree, AVL tree,Red Black Trees, Trie, Graph Algorithms, Sorting Algorithms, Greedy Algorithms, Dynamic Programming, Segment Trees etc.

This project will make you sort data on a stack, with a limited set of instructions, using the lowest possible number of actions. To succeed you’ll have to manipulate various types of algorithms and choose the most appropriate solution (out of many) for an optimized data sorting.

Benchmark simples para algoritmos de ordenação. Envolve conteúdo da disciplina EDA-2 da UnB/FGA

Robin Hood Sort, for uniform data

School 42 project // Sorting algorithm using two stacks

Algoritmo de ordenação - Bubble Sort

Actually sort files on your FAT drives

A bespoke sorting algorithm, on 2 stacks.

An attempt at the most comprehensive and efficient push_swap tester I've seen.

42 school project pushswap using radix sort

C Dili; Giriş - Orta ve İleri Seviye Örnek Uygulamalar

A collection of highly optimized, SIMD-accelerated (SSE, AVX, FMA, NEON) functions written in C

O(n log n) In-place Stable Quicksort

DATA STRUCTUREs S3 KTU LAB -2022

Collection of various C programs

Here I am uploading data structure and algorithm codes.