From d82230d36cb201ee9f6361770f9302d6aa389894 Mon Sep 17 00:00:00 2001 From: Marius Becker Date: Tue, 1 May 2018 19:28:28 +0200 Subject: [PATCH] Fixed two links in the Introduction chapter --- chapters/introduction.md | 2 +- 1 file changed, 1 insertion(+), 1 deletion(-) diff --git a/chapters/introduction.md b/chapters/introduction.md index 1184ff6bf..694afb1da 100644 --- a/chapters/introduction.md +++ b/chapters/introduction.md @@ -12,7 +12,7 @@ This text is a natural extension of that idea -- a community effort to learn as For this reason, I hesitate to call this a work a "textbook" and would prefer to think of it as a lab notebook of sorts. It will be an archive filled with cool ideas in computer science and physics that I hope will be interesting in their own right. My hope is that this book perfectly straddles the line between comprehensiveness and pleasure and will be an enjoyable read for anyone at any stage on their hobby programming journey. -Keeping with the community theme, this book is freely available on [github](https://github.com/leios/algorithm-archive) and [gitbook](https://leios.gitbooks.io/algorithm-archive/content/). Please feel free to read / browse the content available there. If you have any questions / comments / concerns, please let me know. This book is a community project and will only work if there is a community that works on it! +Keeping with the community theme, this book is freely available on [github](https://github.com/algorithm-archivists/algorithm-archive) and [github pages](https://algorithm-archivists.github.io). Please feel free to read / browse the content available there. If you have any questions / comments / concerns, please let me know. This book is a community project and will only work if there is a community that works on it! As a final note before beginning the bulk text, I would like for this book to be "language agnostic." This basically means that I would like to use psuedocode in the main text, but provide source code in any language you could want in the appendix. Though this may seem a little counter-intuitive, I think it offers the greatest flexibility for myself as the author and for the community to develop their own code in any way they please. In fact, if you feel inclined, please feel free to implement your own version of any algorithm mentioned in this text. If you submit it and it passes all my *ahem* rigorous tests, then I can throw it at the end of each chapter with attribution to you!