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.

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

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.

Brief overview on new and improvements on existing algorithms

Examples of implementation of a few different algorithms on Java

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

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

Quick select, fast and generic

Solutions to Leetcode questions

Median of medians quickselect algorithm

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

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

Selection algorithms implementation

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

Parallel selection on GPUs

A fast selection algorithm in JavaScript.

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