a-conjecture-of-mine

An exercise on polyglossy: the same problem solved on multiple languages

git clone: git://git.pablopie.xyz/a-conjecture-of-mine
Log
Files
Refs

Commit: c2110a4459ab17c05a203c66502c0d817d17c492
Parent: 99b065bd7dba791b2f25e9b24ef538549e8b6e2c
Author: Pablo Emilio Escobar Gaviria <pablo-escobar@riseup.net>
Date: Tue, 14 Apr 2020 08:16:58 -0300

Updated README.adoc

Diffstat

1 file changed, 29 insertions, 9 deletions

Status	File Name	N° Changes	Insertions	Deletions
Modified	README.adoc	38	29	9

diff --git a/README.adoc b/README.adoc
@@ -20,7 +20,7 @@ Check out `proof.pdf` for more information.
 == The Problem - Programmers Verison
 
 Let `S(n: uint) -> uint` be the sum of the digits of `n` in 
-_[base 10](https://en.wikipedia.org/wiki/Decimal)_. Then, for all `a` and `b` 
+https://en.wikipedia.org/wiki/Decimal[_base 10_]. Then, for all `a` and `b` 
 of type `uint`, `S(a + b) - S(a) - S(b) % 9 == 0`.
 
 == Performance
@@ -31,14 +31,34 @@ the interval latexmath:[$10^5$]
 in multiple language implementations. The performance of each language was then 
 avaliated as the following _(*)_:
 
-|Language      |Milliseconds|Processes|
-|--------------|------------|---------|
-|**C**         |15.441      |4        | 
-|**Rust**      |42.508      |4        |
-|**Kotlin**    |12480       |1        |
-|**OCaml**     |30448       |1        |
-|**Go**        |70459       |4        |
-|**Haskell**   |121000      |1        |
+|===
+|Language |Milliseconds |Processes
+
+|C
+|15.441      
+|4        
+ 
+|Rust
+|42.508      
+|4        
+
+|Kotlin
+|12480
+|1
+
+|OCaml
+|30448
+|1
+
+|Go
+|70459
+|4
+
+|Haskell
+|121000
+|1
+
+|===
 
 _(*) not all implementations were benchmarked_