A tidyverse suite for (pre-) machine-learning: cluster, PCA, permute, impute, rotate, redundancy, triangular, smart-subset, abundant and variable features.

An implementation of Kensler's hashed permutation algorithm

Generate word list by combining inputted words or by permutaing characters.

List shuffler and random integers: RANDOM.ORG-like utility webpages supporting 'better' randomness (http://qrng.anu.edu.au or bring-your-own entropy) https://0joshuaolson1.github.io

Sort a strided array using Shellsort.

Sort a single-precision floating-point strided array using heapsort.

Sort a strided array using heapsort.

Perform a series of row interchanges on an input matrix.

Simultaneously sort two strided arrays based on the sort order of the first array using heapsort.

Sort a strided array using insertion sort.

Simultaneously sort two single-precision floating-point strided arrays based on the sort order of the first array using Shellsort.

Sort a single-precision floating-point strided array using Shellsort.

Perform a series of row interchanges on an input matrix.

Sort a double-precision floating-point strided array using heapsort.

Sort a double-precision floating-point strided array using Shellsort.

Simultaneously sort two strided arrays based on the sort order of the first array using Shellsort.

Source code for the permute challenge from 35c3 CTF.

Sort a double-precision floating-point strided array using insertion sort.

Simultaneously sort two double-precision floating-point strided arrays based on the sort order of the first array using insertion sort.

Simultaneously sort two double-precision floating-point strided arrays based on the sort order of the first array using heapsort.