notes on how to present an algorithm

1 files changed, 10 insertions, 0 deletions

diff --git a/README.md b/README.md
index a22abea..9cf55af 100644
--- a/README.md
+++ b/README.md
@@ -7,3 +7,13 @@ https://scis.lms.athabascau.ca/file.php/425/studyguide/index.html
 $ go install github.com/xlg-pkg/http-server@latest
 $ http-server .
 ```
+
+## Presenting Algorithms
+
+1. Present a clear
+
+Throughout this course, when you are asked to present an algorithm, this means that you need to do three things:
+
+1. Present a clear, simple, and unambiguous description of the algorithm (in pseudocode, for example). The key here is keeping it simple. Uninteresting details should be kept to a minimum, so that the key computational issues stand out. For example, it is not necessary to declare variables whose purpose is obvious, and it is often simpler and clearer to simply say, “Add X to the end of list L” than to present code to do this or use some arcane syntax, such as “L:insertAtEnd(X).”
+1. Present a justification or proof of the algorithm’s correctness. Your justification should assume that the reader is someone of similar background to yours, say another student in this class, and should be convincing enough make a skeptic believe that your algorithm does indeed solve the problem correctly. Avoid rambling about obvious or trivial elements. A good proof provides an overview of what the algorithm does and then focuses on any tricky elements that may not be obvious.
+1. Present a worst-case analysis of the algorithm's efficiency, typically its running time (but also its space, if space is an issue). Sometimes this is straightforward, but if not, concentrate on the parts of the analysis that are not obvious.