Euclidean algorithm to determine GCD (greatest common divisor) in C -- alternative method
Channel: Roel Van de Paar
Date: 03/03/2022

Code Review: Euclidean algorithm to determine GCD (greatest common divisor) in C -- alternative method

Helpful?  Please support me on Patreon: https://www.patreon.com/roelvandepaar

With thanks & praise to God, and with thanks to the many people who have made this project possible! | Content (except music & images) licensed under CC BY-SA https://meta.stackexchange.com/help/licensing | Music: https://www.bensound.com/licensing | Images: https://stocksnap.io/license & others | With thanks to user Toby Speight (codereview.stackexchange.com/users/75307), user mdfst13 (codereview.stackexchange.com/users/71574), user j3141592653589793238 (codereview.stackexchange.com/users/206285), user chux - Reinstate Monica (codereview.stackexchange.com/users/29485), and the Stack Exchange Network (codereview.stackexchange.com/questions/259878). Trademarks are property of their respective owners. Disclaimer: All information is provided "AS IS" without warranty of any kind. You are responsible for your own actions. Please contact me if anything is amiss at Roel D.OT VandePaar A.T gmail.com