Terms&Tables
Definition&Convictions
Symbol | Name | Memo |
---|---|---|
C* | Ordinal-machine | minimize monotonic cost of distance |
C* | Footprint | measure variableCost x %fixedCost |
C* | Symmetric-asymmetry | low-level-asymmetry, high-level-symmetry |
D | Symmetric-sorting | ‘ascleft’, ‘ascright’, ‘descleft’, ‘descright’ |
C* | Symmetric-recursion | symmetric mutual recursion |
C* | Code-mirroring | left-right mirroring of code |
C* | Symmetric-compiler | compiling symmetric language |
C* | Symmetric-hardware | instructions for mirroring code |
C | No3rd-partition | Early Termination without 3rd partition |
C | Asymmetric-partitioning | Asymmetric-partitioning is good |
C | Undirected-sorting | not requesting asc/desc order |
C* | Share&Merge | recursively share buffer until can splitting |
C | DSDS | Direct Sorting Different Size |
Bold techniques
Symbol | Name | Memo |
---|---|---|
B | Symmetric-language | symmetric semi-in-place merging data and buffer |
B | DIET | Distinct Identification for Early Termination |
B | FLIP | Fast Loops In Partitioning |
B | POET | Pre-Order Early Termination |
B | Data-driven-location | data decides return memory |
B | Data-driven-order | data decides asc/desc order |
B | Gapped-setup | odd-even data-buffer layout |
B | Gapped-merging | merge in odd-even data-buffer layout |
B | Buffer-merging | merging data and buffer |
B | Buffer-splitting | splitting data and buffer |
B | Frogsort | symmetric-merging ½-adaptive presorting |
B | Geckosort | symmetric-merging ¼-adaptive pre/rev |
B | Squidsort | lazy undirected symmetric sort |
B | DSNS | Direct Sorting Null-terminated Strings |
B | DSPE | Direct Sorting Pointered Elements |
B* | Wing-partitioning | Stable partitioning without counting |
B* | Buffer-partitioning | partitioning data and buffer |
B* | Symmetric-partitioning | symmetric partitioning data and buffer |
B* | Gapped-wrapup | collecting the gapped results |
B | parallel-Symmetric-merging | iterative parallel merging |
Algorithms
Symbol | Name | Memo |
---|---|---|
A | Zocksort | self-recursive DIET Quicksort |
A | Zacksort | zig-zagging DIET-FLIP Quicksort |
A | Zucksort | semi-flipping DIET-FLIP Quicksort |
A | Ducksort | semi-flipping POET-FLIP Zucksort |
A | Omitsort | skip merge and return pointer to data |
A | Octosort | lazy directed undirected sort |
A | GKnuthsort | Knuthsort in odd-even data-buffer |
A | TKnuthsort | Knuthsort with buffer-merging (T-moves) |
A | Crocosort | Knuthsort with buffer-merging (R-moves) |
A | Frogsort0 | Frogsort on triplets or bigger chunks |
A | Frogsort1 | balanced Frogsort on single elements |
A | Frogsort2 | imbalanced splitting Frogsort |
A | Frogsort3 | imbalanced sharing Frogsort |
A | Frogsort6 | generalized Frogsort |
A | Squidsort1 | lazy symmetric sort (50% buffer) |
A | Squidsort2 | lazy symmetric sort (<50% buffer) |
A | VKnuthsort | Varying-size Knuthsort |
A | VFrogsort1 | Varying-size Frogsort1 |
A | Kiwisort | Stable Partition&Pool sort 100% buffer |
A | Swansort | distance-reducing stable P&P sort 100% buffer |
A | Storksort | distance-reducing stable P&P sort 50% buffer |
Extended&Further
Symbol | Name | Memo |
---|---|---|
F | Zackpart | MECEP partial sorting between l and r |
F | Zuckpart | MECEP partial sorting between l and r |
F | Zackselect | MECEP more informative than Quickselect |
F | Zuckselect | MECEP more informative than Quickselect |
F | Zackpartleft | MECEP partial sorting left of r |
F | Zuckpartleft | MECEP partial sorting left of r |
F | Zackpartright | MECEP partial sorting right of l |
F | Zuckpartright | MECEP partial sorting right of l |
E | PKnuthsort | parallel Knuthsort |
E | PFrogsort0 | Parallel Frogsort0 |
E | PFrogsort1 | Parallel Frogsort1 |
E | PFrogsort2 | Parallel Frogsort2 |
E | PFrogsort3 | Parallel Frogsort3 |
E | Incremental-Zacksort | Amortized Incremental-Zacksort |
E | Zackheaps | Symmetric (tie-handling) Quickheaps |
E | Incremental-Frogsort | Amortized Incremental-Frogsort |
E | Frogsteps | Symmetric stable dictionary |