Skip to content

Euclidean algorithm in brainfuck #407

New issue

Have a question about this project? Sign up for a free GitHub account to open an issue and contact its maintainers and the community.

Sign up for GitHub

By clicking “Sign up for GitHub”, you agree to our terms of service and privacy statement. We’ll occasionally send you account related emails.

Already on GitHub? Sign in to your account

Closed
wants to merge 7 commits into from
Closed

Euclidean algorithm in brainfuck #407

Changes from 1 commit
Commits
Show all changes
7 commits
Select commit Hold shift + click to select a range
b726261
Did euclidean algorithm in brainfuck
Ariana1729 Oct 1, 2018
9e5e009
Removed comments
Ariana1729 Oct 2, 2018
c709f91
Added explanation in a different file
Ariana1729 Oct 2, 2018
3bb938a
Added brainfuck to book.json
Ariana1729 Oct 2, 2018
398c0f2
Rename euclidean_algorithm.bf to euclidean_mod.bf
Ariana1729 Oct 2, 2018
b19217a
Added subtraction algorithm and explanation
Ariana1729 Oct 6, 2018
069f871
Gaussian elimination translated from C to JS
Ariana1729 Oct 6, 2018
File filter

Filter by extension
Conversations
Failed to load comments.
Loading
Jump to
Jump to file
Failed to load files.
Loading
Diff view
Diff view
Next Next commit
Did euclidean algorithm in brainfuck 
why am i doing this mdr
  • Loading branch information
@Ariana1729
Ariana1729 authored Oct 1, 2018
commit b7262611538d4003c39daffdb62d7d83383129c6
23 changes: 23 additions & 0 deletions contents/euclidean_algorithm/code/brainfuck/euclidean_algorithm.bf
View file
Open in desktop
Original file line number Diff line number Diff line change
@@ -0,0 +1,23 @@
>,>, scan
[ while b!=0
0 a (b) 0 0 0

<[
>->+<[>]
>[<+>-]<
<[<]>-
]
so basically this is the mod algo in brainfuck, it slowly shifts cell 2 to cell 3, while subtracting 1 from cell 1
then when cell 2 goes to 0, it shifts cell 3 to 2 and continues, this is like just constantly subtracting cell 2 from cell 1, until you cant subtract anymore then return at cell 3
0 (0) b_a%b a%b 0 0

>[-<+>]
0 b_a%b (0) a%b 0 0

>[-<+<+>>]<
0 b (a%b) 0 0 0

]
0 GCD(a b) 0 0 0 0

<.