File:Abstract syntax tree for Euclidean algorithm.svg
Summary
| Description |
English: An abstract syntax tree for the following pseudocode, implementing the Euclidean algorithm to find the greatest common divisor of a and b:
while b ≠ 0:
if a > b:
a := a - b
else:
b := b - a
return a
|
| Date | |
| Source | Own work |
| Author | Dcoetzee |
Licensing
I, the copyright holder of this work, hereby publish it under the following license:
  |
This file is made available under the Creative Commons CC0 1.0 Universal Public Domain Dedication. |
| The person who associated a work with this deed has dedicated the work to the public domain by waiving all of their rights to the work worldwide under copyright law, including all related and neighboring rights, to the extent allowed by law. You can copy, modify, distribute and perform the work, even for commercial purposes, all without asking permission.
|
