An emojicode (https://github.com/emojicode/emojicode) program for computing the greatest common divisor of two given integers

gcd.emojic

🏁 🍇
  👴 I used the following wiki page as a reference:
  👴 https://simple.wikipedia.org/wiki/Euclidean_algorithm

  👴 The following callable (What emojicode calls functions) named gcd
  👴 takes two integers a and b (each of type 🚂 or better known as "int")
  👴 and returns (➡️) the greatest common divisor between them.
  🍦 gcd 🍇 a🚂 b🚂 ➡️ 🚂
    🍮 m a
    🍮 n b

    👴 Swap a and b if b is larger
    🍊 ▶️ b a 🍇
      🍮 m b
      🍮 n a
    🍉

    👴 While n > 0, calculate remainder and shift numbers
    👴 over as done in the interations of Euclid's algorithm.
    🔁 ▶️ n 0 🍇
      🍦 r 🚮 m n
      🍮 m n
      🍮 n r
    🍉

    🍎 m
  🍉


  👴 Call the gcd callable that we defined above using 🍭
  👴 with a few examples.
  🍦 result1 🍭 gcd 675 40
  🍦 result2 🍭 gcd 40 675
  🍦 result3 🍭 gcd 13 13 👴 a equals b
  🍦 result4 🍭 gcd 37 600 👴 first argument is prime
  🍦 result5 🍭 gcd 20 100 👴 first argument divides the second arg
  🍦 result6 🍭 gcd 624129 2061517

  😀 🍪 🔤gcd(675, 40) = 🔤 🔡 result1 10 🍪 👴 outputs 5
  😀 🍪 🔤gcd(40, 675) = 🔤 🔡 result2 10 🍪 👴 outputs 5
  😀 🍪 🔤gcd(13, 13) = 🔤 🔡 result3 10 🍪 👴 outputs 13
  😀 🍪 🔤gcd(37, 600) = 🔤 🔡 result4 10 🍪 👴 outputs 1
  😀 🍪 🔤gcd(20, 100) = 🔤 🔡 result5 10 🍪 👴 outputs 20
  😀 🍪 🔤gcd(624129, 2061517) = 🔤 🔡 result6 10 🍪 👴 outputs 18913
🍉