yanfeng42/my-gcd.scm

Created January 8, 2021 01:47

Star () You must be signed in to star a gist
Fork () You must be signed in to fork a gist

Learn more about clone URLs
Clone this repository at <script src="https://gist.github.com/yanfeng42/4dbbc93dd61649a1785930d9fd3e9f32.js"></script>
Save yanfeng42/4dbbc93dd61649a1785930d9fd3e9f32 to your computer and use it in GitHub Desktop.

Download ZIP

sicp 1.2.5 最大公约数(gcd) 的欧几里得算法

Raw

	(define (my-gcd a b)
	(if (= b 0)
	a
	(gcd b (remainder a b)))
	)

Author

yanfeng42 commented Jan 8, 2021

初学编程, 为了谋生

没想到编程可以和自己的从小到大的学习, 结合的这么紧密

我一定让我的孩子, 上一所以编程为基础通识教育的私立小学/中学

期待, 编程未来能成为像数学,美术一类的基础通识学科, 能够从小普及推广的那种.

期待有一天, 我的孩子(的孩子), 不用再为一个问题的正确答案, 而反复在草纸上演算, 而把更多的精力花在去理解规则本身.

Sign up for free to join this conversation on GitHub. Already have an account? Sign in to comment