OyaCode

“Algorithms”

Greatest Common Divisor

TheoryConsider gcd(a, b), let's say a > b, then we have:gcd(a, b) == gcd(a - b, b)ProofConside...

Binary Tree Serialization

[!note]This post is using web parser project called Nearlay to verify the parsing process. You ca...

Simple JSON CFG in Nearlay

@builtin "whitespace.ne" @builtin "string.ne" @builtin "number.ne" ...

Detect Cycle in Linked List

ProofsDefinitions$A$: Beginning of the linked-list$B$: Intersection point of the circle$M$: Meeti...