I'm a software performance specialist.
I'm building a set of fundamental algorithms and data structures that have optimal performance within each classification.
A | 8 | 16 | 32 | 64 | Extremely-fast, small-period, statistically-weak PRNGs.
B | 8 | 16 | 16-32 | 32 | 64 | Fast, small-period, statistically-strong PRNGs.
C | 8 | 16 | 32 | 64 | Fast, medium-period, statistically-strong PRNGs.
D | 8 | 16 | 32 | 64 | Fast, large-period, statistically-strong PRNGs.
E | 8 | 16 | 32 | 64 | Fast, huge-period, statistically-strong PRNGs.
F | 32 | 64 | Extremely-fast, large-period, statistically-strong PRNGs that emulate quantum RNGs.
A | Sorted | Unsorted | Fast, non-interpolated searching algorithms that emulate quantum searching algorithms.
A | Stable | Unstable | Fast, in-place, non-auxiliary sorting algorithms that emulate quantum sorting algorithms.
B | In Progress | Fast, in-place, semi-auxiliary sorting algorithms that emulate quantum sorting algorithms.