There are 0 repository under in-place topic.
Share Hash Tables With Stable Key Hints Stored In Memory Mapped Files Between Arbitrary Processes
A simple iterative variant of QuickSort that uses O(1) space for all inputs
In-place Parallel Super Scalar Samplesort (IPS⁴o) Benchmark Suite
Synchronous formatter runner for Neovim using in-place formatters. No stdin support.
Invoke a function for each element in a collection and update the collection in-place.
Invoke a function for each element in a collection and update the collection in-place, iterating from right to left.
Invoke a function for each element in a collection and update the collection in-place.
Invoke a function for each element in a collection and update the collection in-place, iterating from right to left.
Invertible transformations on permutation representations, including an RNG-free in-place Fisher-Yates-Knuth shuffle https://www.npmjs.com/package/factoradic
A parallel stable sort using arbitrary extra memory
OpenCL Fast Fourier Transform using cooley-tukey in-place bit-reversal algorithm with lookup tables.
A stable, in-place, adaptive block merge sort.
Header-Only-Library providing functions that perform parallel in-place Partitioning, Quickselect and Quicksort
3 Modes edit-in-place component: static, active, pending. Can cancel changes.
Heap sort is a time and space efficient comparison-based algorithm
Leonardo heap is the implicit data structure that uses only O(1) auxiliary data to implement smoothsort, an in-place algorithm offering average performance of O(n⋅log(n)) and O(n) in the best-case.
Trick Question about transforming a matrix in-place
A source code to a presentation regarding in-line BFS and DFS in linear time.