C++ template library for high performance SIMD based sorting algorithms

Selection algorithms implementation

A fast selection algorithm in JavaScript.

Median of medians quickselect algorithm

Solutions to Leetcode questions

Find the kth smallest element of an array using MPI. Three different versions have been implemented for this purpose: k-Search, Heuristic Quickselect and Quickselect.

Are you in love with PHP? So do I! I enjoy solving problems and implementing data structures and algorithms in PHP.

Quick select, fast and generic

Assignment 2 of Randomized Algorithms course (Master in Innovation and Research in Informatics), Fall 2022

Header-Only-Library providing functions that perform parallel in-place Partitioning, Quickselect and Quicksort

Exercises from 'A Common-Sense Guide to Data Structures and Algorithms' done in Golang.

A collection of useful data structures and utilities I am putting together as part of other ongoing solidity projects.

Parallel selection on GPUs

Rust nth_element implementation that leverages Andrei Alexandrescu's Adaptive Quickselect algorithm.

Script to get the nth smallest/largest item. Inspired by std::nth_element.

A simple iterative variant of QuickSort that uses O(1) space for all inputs

Brief overview on new and improvements on existing algorithms

Examples of implementation of a few different algorithms on Java