- Commit
- 16e9d394f26efcb584a1a61bc8153acb16f1b5fe
- Parent
- fa97703c1cdc4ffe9f8128e814b09fd8f57fd27a
- Author
- Gark Garcia <37553739+GarkGarcia@users.noreply.github.com>
- Date
Update README.md
An exercise on polyglossy: the same problem solved on multiple languages
Update README.md
1 file changed, 1 insertion, 0 deletions
Status | File Name | N° Changes | Insertions | Deletions |
Modified | README.md | 1 | 1 | 0 |
diff --git a/README.md b/README.md @@ -8,6 +8,7 @@ Prove that <img src="https://latex.codecogs.com/gif.latex?\forall&space;a,&space ## Performance The conjecture was [proved by exhaustion](https://en.wikipedia.org/wiki/Proof_by_exhaustion) for the interval <img src="https://latex.codecogs.com/gif.latex?[0;10^3]" title="[0;10^3]" /> in multiple language implementations. The performance of each language was then avaliated as the following: + |Language |Time |Number of Threads Used| |--------------|-------|----------------------| |**Rust** |22 _s_ |2 |