michaelangel007
|
3ebca0da7e
|
Cleanup algorithm steps for clarity
|
2020-02-05 10:21:40 -08:00 |
|
michaelangel007
|
4bc43a0dba
|
Clarify expanded multiplication in base 2
|
2020-02-05 10:16:38 -08:00 |
|
michaelangel007
|
140cb79e72
|
Cleanup Representation vs Presentation
|
2020-02-05 09:55:49 -08:00 |
|
michaelangel007
|
ae25ca294b
|
Fix algorithm step 2 description C code
|
2020-02-05 09:39:52 -08:00 |
|
michaelangel007
|
375a0097f3
|
Cleanup
|
2020-02-05 09:38:10 -08:00 |
|
michaelangel007
|
b0c0f831df
|
Add other bases section
|
2020-02-05 09:37:54 -08:00 |
|
michaelangel007
|
27c4c6fb7f
|
Add C example
|
2020-02-05 09:37:39 -08:00 |
|
michaelangel007
|
744ea61419
|
Moved algorithm closer to top, added notes about why this is inefficient and added GMP's seven different algorithms
|
2020-02-05 09:25:21 -08:00 |
|
michaelangel007
|
844714e1d6
|
Add B is odd column to Base 2 example
|
2020-02-05 08:50:19 -08:00 |
|
michaelangel007
|
97e13baa59
|
Add algorithm
|
2020-02-05 08:48:54 -08:00 |
|
michaelangel007
|
b8902a61ab
|
Add Base 8 and Base 10 example
|
2020-02-05 08:48:04 -08:00 |
|
michaelangel007
|
b28f22aa7a
|
Point out why standard multiplication is inefficient for a computer
|
2020-02-05 08:46:48 -08:00 |
|
michaelangel007
|
4675148878
|
Clarify multiple bit shifts
|
2020-02-05 08:46:25 -08:00 |
|
michaelangel007
|
9fad757dc8
|
Fix typo
|
2020-02-05 08:46:06 -08:00 |
Michaelangel007
|
c5171f7d41
|
More cleanup to examples
|
2016-08-19 08:13:09 -07:00 |
|
Michaelangel007
|
f9843ad44d
|
Cleanup formatting
|
2016-08-19 08:09:21 -07:00 |
|
Michaelangel007
|
110670dc6e
|
Fix spelling
|
2016-08-19 07:52:19 -07:00 |
|
Michaelangel007
|
7a7167ab95
|
Update explanation formatting
|
2016-08-19 07:20:29 -07:00 |
|
Michaelangel007
|
c2e43a7849
|
Added explanation
|
2016-08-19 07:17:35 -07:00 |
|
Michaelangel007
|
bc8f18d05c
|
Fix grammar.
|
2016-08-18 18:33:28 -07:00 |
|
Michaelangel007
|
2698571c76
|
Added Readme
|
2016-08-18 18:25:18 -07:00 |