Perform colectomy on 2011/borsanyi :-)

Remove colons :-) that were not needed as per discussion on GitHub.

Other formatting fixes and maybe typo fixes.

2011/borsanyi/README.md

@@ -1,11 +1,11 @@
 # Best data utility
 
-    Szabolcs Borsanyi  
-    Theoretische Physik  
-    Gaussstraße 20  
-    42097 Wuppertal  
-    Germany  
-    <borsanyi@uni-wuppertal.de>  
+Szabolcs Borsanyi    
+Theoretische Physik  
+Gaussstraße 20  
+42097 Wuppertal  
+Germany  
+<borsanyi@uni-wuppertal.de>  
 
 ## To build:
 
@@ -39,7 +39,7 @@ by editing the source.  Try to find them!
 
 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
-use malloc or alloca. 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.
 How does it put the data into buckets?  Why does it fork 22 times?
@@ -52,20 +52,20 @@ histogram. I am all too often logged in to a remote machine with
 slow X connection, and a terminal-based program would be of
 great help.
 
-### Limitations:
+### Limitations
 
 * I optimized the output for the data I had around, you might want to adjust
   for your needs. For a great excess of data points the program will crash
   (depending on the available stack).
 * Giving too few (distinct) points can also cause crash (or division by zero).
 * The program expects plain numbers separated by white spaces.
-* ASCII is assumed. 
-* Some POSIX-like system is assumed (fork and wait(NULL) are used)
+* ASCII is assumed.
+* Some POSIX-like system is assumed (`fork()` and `wait(NULL)` are used).
 * Do not give any arguments to the program.
 * Could rounding errors cause the omission of the highest bin? There might be
   empty bins at the edges.
 
-### Obfuscation:
+### Obfuscation
 
 * The program follows a rather unconventional approach to the task
   of histogram building. The usual array of integers (for the histogram