PolyComputingEuclid's algorithm, modular arithmetic and breadth-first search15–20 min
Algorithm Steps
Carry out Euclid's algorithm step by step, work out residues on a modular clock dial, and visit a directed map in breadth-first order using a queue.
Notice, currentExplain, nextApply, next
0 points
The experiment opens when it comes into view.
Theory and model assumptions
Carry out Euclid's algorithm step by step, work out residues on a modular clock dial, and visit a directed map in breadth-first order using a queue.
Teacher guidance
Poly computing and engineering mathematics: Euclid's algorithm, clock (modular) arithmetic and breadth-first search (generic)
Expected time: 15–20 minutes.