algorithm-archive
algorithm-archive copied to clipboard
Standardizing implementation input/output
Description
This issue is meant to be an overview on which chapters need their input or output to be standardized.
Why
Why this needs to be done is outlined in #824, but other relevant issues include #625, #558 and #320.
Overview
Chapter | PR | Status |
---|---|---|
Verlet Integration | #855 #873 | Merged |
Tree Traversal | #857 | Merged |
Euclidean Algorithm | #877 | Blocked [Missing langs] |
Monte Carlo Integration | - | Needs standardization |
Gaussian Elimination | - | Needs standardization |
Thomas Algorithm | - | Needs standardization |
Jarvis March | - | Needs standardization |
Graham Scan | - | Needs standardization |
FFT | - | Needs standardization |
Stable Marriage Problem | - | Needs standardization |
Forward Euler Method | - | Needs standardization |
Split-Operator Method | - | Needs standardization |
Huffman Encoding | - | Needs standardization |
Flood Fill | - | Needs standardization |
Computus | - | Needs standardization |
Approximate Counting Algorithm | #913 | Merged |
Stacks and Queues | - | Needs standardization |
I think (of the methods mentioned here), computus should be relatively easy. I think the only difference between implementations is the number of tabs in the output. Some people wanted 1 tab, others wanted 2 (and it depended on their tabwidth set in their terminal emulator).
I suggest we add stack and queue to the list as well