Skip to content

Clean up :w's. Remove vim user traces. #105

New issue

Have a question about this project? Sign up for a free GitHub account to open an issue and contact its maintainers and the community.

Sign up for GitHub

By clicking “Sign up for GitHub”, you agree to our terms of service and privacy statement. We’ll occasionally send you account related emails.

Already on GitHub? Sign in to your account

Merged
merged 1 commit into from
May 5, 2018
Merged

Clean up :w's. Remove vim user traces. #105

Changes from all commits
Commits
Show all changes
1 commit
Select commit
File filter

Filter by extension

Filter by extension
Conversations
Failed to load comments.
Loading
Jump to
Jump to file
Failed to load files.
Loading
Diff view
Diff view
4 changes: 1 addition & 3 deletions chapters/introduction.md
View file
Open in desktop
Original file line number Diff line number Diff line change
Expand Up @@ -14,8 +14,6 @@ For this reason, I hesitate to call this a work a "textbook" and would prefer to

Keeping with the community theme, this book is freely available on [github](https://github.com/algorithm-archivists/algorithm-archive) and [github pages](https://www.algorithm-archive.org). 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 w:w
:w
uld 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!
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!

So I guess that's all for now. Because this book is freely available online, I may be heavily modifying the content as we delve deeper into the archive of arcane algorithms.