Fixes in 1994/weisberg/README.md

Typo and format fixes.

1994/weisberg/README.md

@@ -9,31 +9,42 @@
 
 ## To build:
 
+```sh
 make all
+```
 
-## To run
 
+## To run:
+
+```sh
 ./weisberg
+```
 
-## Judges' comments
+### Alternative code:
-
-    This entry confuses some C-preprocessors and some C-beautifiers.
-    We found one cpp that processed this source differently when
-    it was read on stdin instead of via cc -E.
 
 If you liked what you saw from the above program, and happen to
-    have some 512 Megabytes of virtual memory laying around with to do,
+have some 512 Megabytes of virtual memory lying around with to do,
 you could try:
 
+```sh
 make weisberg.alt
 ./weisberg.alt
+```
 
 Lesser systems will find this alternative version a good way to create
 a core file.  :-)
 
-## Author's comments
 
-    Description:
+## Judges' comments:
+
+This entry confuses some C-preprocessors and some C-beautifiers.
+We found one cpp that processed this source differently when
+it was read on stdin instead of via `cc -E`.
+
+## Author's comments:
+
+### Description:
+
 The following short program implements the "Yet Another" algorithm for
 generating prime numbers.  It will generate all primes up to 33554432,
 displaying them to the standard output as it churns along.  As 33554432
@@ -42,24 +53,24 @@
 reception of a signal (any will do equally well), as well as in the
 event of a system shutdown or reboot.
 
-    Bugs:
+### Bugs:
-	The alternative version (weisberg.alt) has never actually run
-	to completion. After running for close to a week it had reached
-	somewhere around 250e6, when it became necessary to test the
-	reboot feature (which worked remarkably well) As there are
-	quite a lot of primes to be found before reaching MAXINT, the
-	output produced can be quite overwhelming, it recommended to
-	pipe the output through your favorite pager (more or less), and not 
-	output to a paper output device (unless you have *LOTS* of paper).
 
-    Technical:
+The alternative version ([weisberg.alt](weisberg.alt.c)) has never actually run
-	The original "Yet Another Prime Program" algorithm used here was
+to completion. After running for close to a week it had reached somewhere around
-	developed as a Computer Architecture course micro-programing exercise,
+250e6, when it became necessary to test the reboot feature (which worked
-	and was designed to take full advantage of the UR300
+remarkably well). As there are quite a lot of primes to be found before reaching
-	micro-architecture to achieve blindingly fast speed. It was ported to
+`INT_MAX`, the output produced can be quite overwhelming, it recommended to pipe
-	C specifically for the IOCCC. In the conversion/obfuscation step some
+the output through your favorite pager (`more` or `less`), and not output to a
-	of (much of) the blazing speed was lost, but as a bonus, the
+paper output device (unless you have *LOTS* of paper).
-	understandability of the code was reduced to zero.
+
+### Technical:
+
+The original "Yet Another Prime Program" algorithm used here was developed as a
+Computer Architecture course micro-programming exercise, and was designed to
+take full advantage of the UR300 micro-architecture to achieve blindingly fast
+speed. It was ported to C specifically for the IOCCC. In the
+conversion/obfuscation step some of (much of) the blazing speed was lost, but as
+a bonus, the understandability of the code was reduced to zero.
 
 ## Copyright and CC BY-SA 4.0 License: