Initial commit

.gitignore

@@ -0,0 +1,46 @@
+
+# Created by https://www.gitignore.io/api/linux,emacs
+
+### Linux ###
+*~
+
+# KDE directory preferences
+.directory
+
+# Linux trash folder which might appear on any partition or disk
+.Trash-*
+
+
+### Emacs ###
+# -*- mode: gitignore; -*-
+*~
+\#*\#
+/.emacs.desktop
+/.emacs.desktop.lock
+*.elc
+auto-save-list
+tramp
+.\#*
+
+# Org-mode
+.org-id-locations
+*_archive
+
+# flymake-mode
+*_flymake.*
+
+# eshell files
+/eshell/history
+/eshell/lastdir
+
+# elpa packages
+/elpa/
+
+# reftex files
+*.rel
+
+# AUCTeX auto folder
+/auto/
+
+# cask packages
+.cask/

README.org

@@ -0,0 +1,10 @@
+* The Art of Computer Programming
+
+Notes, code, and other related materials generated while reading through Donald E. Knuth's "The Art of Computer Programming"
+
+Practically everything here is directly from the books so copyrighted by Addison - Wesley and/or Donald E. Knuth.
+Everything else would likely be considered a derived work.
+
+Anything that is not copyrighted by Addison - Wesley nor Donald E. Knuth should be considered copyrighted
+by myself (Lily Carpenter) as of 2015 and under the BSD 3-Clause license. This license's full text is
+can be found in LICENSE file in this repository.

chapter-1/notes.org

@@ -0,0 +1,31 @@
+* Euclid's algorithm (Page 2-9)
+** Definition
+*** E0. [Ensure m >= n.] If m < n, exchange m <-> n.
+*** E1. [Find remainder.] Divide m by n and let r be the remainder.
+*** E2. [Is it zero?] If r = 0, the algorithm terminates; n is the answer
+*** E3. [Reduce.] Set m <- n, n <- r, and go back to step E1.
+** Use
+*** Own example: m = 235; n = 95;
+**** 235 % 95 = 45
+**** r = 45
+**** m = 95; n = 45;
+**** 95 % 45 = 5
+**** r = 5
+**** m = 45; n = 5;
+**** 45 % 5 = 0
+**** r = 0
+**** answer = n = 5
+***  Knuth example: m = 119; n = 544
+**** m = 544; n = 119;
+**** 544 % 119 = 68
+**** r = 68
+**** m = 119; n = 68;
+**** 119 % 68 = 51
+**** r = 51
+**** m = 68; n = 51;
+**** 68 % 51 = 17
+**** r = 17
+**** m = 51; n = 17;
+**** 51 % 17 = 0
+**** r = 0
+**** answer = n = 17