Skip to content

Commit 6d973e1

Browse files
authored
Update README.md
1 parent eba2e3e commit 6d973e1

1 file changed

Lines changed: 6 additions & 6 deletions

File tree

README.md

Lines changed: 6 additions & 6 deletions
Original file line numberDiff line numberDiff line change
@@ -68,11 +68,11 @@ Let's compare the algorithms performance for different numbers of length *N*. I
6868

6969
| Algorithm | int (N<10) | long (N<20) | BigInteger (N<40) |
7070
| ------------- |:-------------:|:-----:|:-----:|
71-
| Brute Force | ~55 seconds | few thousand years | N/A |
72-
| Improved Brute Force | ~3.7 s | ~300 years | N/A |
73-
| Hash Approach | 50 ms | OutOfMemoryException | N/A |
74-
| Multi-set Approach | 15 ms | ~1.1 s | N/A |
75-
| Multi-set Improved | 11 ms | ~550 ms |N/A |
76-
| Multi-set Improved BigInteger | ~100 ms | ~5.5 s |~ 0.5 hours |
71+
| [Brute Force](https://github.com/shamily/ArmstrongNumbers/blob/master/ArmstrongNumbersBruteforce.java) | ~55 seconds | few thousand years | N/A |
72+
| [Improved Brute Force](https://github.com/shamily/ArmstrongNumbers/blob/master/ArmstrongNumbersBruteforceOpt.java) | ~3.7 s | ~300 years | N/A |
73+
| [Hash Approach](https://github.com/shamily/ArmstrongNumbers/blob/master/ArmstrongNumbersHash.java) | 50 ms | OutOfMemoryException | N/A |
74+
| [Multi-set Approach](https://github.com/shamily/ArmstrongNumbers/blob/master/ArmstrongNumbersMultiSetLong.java) | 15 ms | ~1.1 s | N/A |
75+
| [Multi-set Improved](https://github.com/shamily/ArmstrongNumbers/blob/master/ArmstrongNumbersMultiSetLongOpt.java) | 11 ms | ~550 ms |N/A |
76+
| [Multi-set Improved BigInteger](https://github.com/shamily/ArmstrongNumbers/blob/master/ArmstrongNumbersMultiSetBigIntegerOpt.java) | ~100 ms | ~5.5 s |~ 0.5 hours |
7777

7878
Clear win of the multi-set algorithm!

0 commit comments

Comments
 (0)