https://tube.ekaii.fr/videos/watch/f32b9161-78cf-4bf7-b90d-650896ba38b1 In this video, we translate C++ into equivalent ARM assembly code to compute the GCD of two numbers (also known as the Euclidean Algorithm). We visualize our completed GCD calculator on a raspberry pi.Timestamp: 00:00 Intro 00:44 C++ Equivalent 02:26 Base Case in ASM 04:36 Writing Comparison 05:26 Recursive Case 07:29 Manual Creation of a Modulus 09:10 Calling the function 10:11 Compiling and Running Code Links Mentioned in Video: https://github.com/LaurieWired/Assembly-Algorithms laurieWIRED Twitter: https://twitter.com/lauriewired laurieWIRED Website: http://lauriewired.com laurieWIRED Github: https://github.com/LaurieWired laurieWIRED HN: https://news.ycombinator.com/user?id=lauriewired laurieWIRED Reddit: https://www.reddit.com/user/LaurieWired — mirrored from https://www.youtube.com/watch?v=665rzOSSxWA Sun, 21 Jun 2026 21:26:35 GMT https://validator.w3.org/feed/docs/rss2.html PeerTube - https://tube.ekaii.fr https://tube.ekaii.fr/client/assets/images/icons/icon-1500x1500.png https://tube.ekaii.fr/videos/watch/f32b9161-78cf-4bf7-b90d-650896ba38b1 All rights reserved, unless otherwise specified in the terms specified at https://tube.ekaii.fr/about and potential licenses granted by each content's rightholder.