mirror/ioccc
1
0 Fork 0
Code Issues Pull Requests Actions Packages Projects Releases Wiki Activity

Format fix 2011/borsanyi/README.md

Browse Source
This commit is contained in:
Cody Boone Ferguson committed 2023-05-02 10:25:43 -07:00
1 parent d9d3c2af20
commit c6474701b8
1 file changed
+7 -5
Download Patch File Download Diff File Expand all files Collapse all files
2011/borsanyi/README.md
+7 -5
View File
@@ -26,20 +26,22 @@ make
## Judges' remarks: ## Judges' remarks:
This is a nice quick histogram plotter. A useful utility when you need to This is a nice quick [histogram](https://en.wikipedia.org/wiki/Histogram)
look at the distribution of some data. plotter. A useful utility when you need to look at the distribution of some
data.
Here are some challenges: Here are some challenges:
You can modify the number of histogram bins and the scaling of the histogram You can modify the number of histogram
by editing the source. Try to find them! [bins](https://en.wikipedia.org/wiki/Data_binning) and the scaling of the
histogram by editing the source. Try to find them!
If you look at the source you will notice that the usual array of If you look at the source you will notice that the usual array of
histogram bins is missing. The source contains no arrays and it does not histogram bins is missing. The source contains no arrays and it does not
use `malloc(3)` or `alloca(3)`. How does it build the histogram? use `malloc(3)` or `alloca(3)`. How does it build the histogram?
While the input does not need to be sorted, the histogram output is sorted. While the input does not need to be sorted, the histogram output is sorted.
How does it put the data into buckets? Why does it fork 22 times? How does it put the data into buckets? Why does it `fork()` 22 times?
## Author's remarks: ## Author's remarks: