Adding a README, LICENSE, and screenshot

This commit is contained in:
Joseph Ferano 2023-05-29 12:33:46 +07:00
parent f8a5ed669d
commit 55795ec805
4 changed files with 44 additions and 2 deletions

20
LICENSE Normal file
View File

@ -0,0 +1,20 @@
Copyright (c) 2023 Joseph Ferano - joseph@ferano.io
Permission is hereby granted, free of charge, to any person obtaining
a copy of this software and associated documentation files (the
"Software"), to deal in the Software without restriction, including
without limitation the rights to use, copy, modify, merge, publish,
distribute, sublicense, and/or sell copies of the Software, and to
permit persons to whom the Software is furnished to do so, subject to
the following conditions:
The above copyright notice and this permission notice shall be
included in all copies or substantial portions of the Software.
THE SOFTWARE IS PROVIDED "AS IS", WITHOUT WARRANTY OF ANY KIND,
EXPRESS OR IMPLIED, INCLUDING BUT NOT LIMITED TO THE WARRANTIES OF
MERCHANTABILITY, FITNESS FOR A PARTICULAR PURPOSE AND
NONINFRINGEMENT. IN NO EVENT SHALL THE AUTHORS OR COPYRIGHT HOLDERS BE
LIABLE FOR ANY CLAIM, DAMAGES OR OTHER LIABILITY, WHETHER IN AN ACTION
OF CONTRACT, TORT OR OTHERWISE, ARISING FROM, OUT OF OR IN CONNECTION
WITH THE SOFTWARE OR THE USE OR OTHER DEALINGS IN THE SOFTWARE.

View File

@ -1,4 +1,3 @@
#+TITLE: Notes & Exercises: The Algorith Design Manual
#+AUTHOR: Joseph Ferano #+AUTHOR: Joseph Ferano
#+STARTUP: overview #+STARTUP: overview
#+OPTIONS: ^:{} #+OPTIONS: ^:{}
@ -1249,7 +1248,7 @@ of asking if some vertices are reachable from a node.
** 6.4 War Story ** 6.4 War Story
Kids are probably young to know what the author is even talking about with these Kids are probably too young to know what the author is even talking about with these
phone codes. phone codes.
** 6.5 Network Flows and Bipartite Matching ** 6.5 Network Flows and Bipartite Matching

23
README.org Normal file
View File

@ -0,0 +1,23 @@
* About
[[./Notes.org]] contains notes and solutions to exercises, as well as
implementations of [[https://www.algorist.com/][The Algorithm Design Manual]]. All notes and source code can be
found in this single file and the reason for that is that it uses a style of
programming known as [[https://en.wikipedia.org/wiki/Literate_programming][Literate Programming]] with the help of Emacs, org-mode, and
[[https://orgmode.org/worg/org-contrib/babel/intro.html][org-babel]]. Most code implementations are done in C, however, some have been also
implemented in Python or OCaml in order to compare and contrast styles. All code
is executable from within Emacs by just running ~C-c C-c~ while the cursor is in
the source code block.
* Progress
So far, the first 6 chapters have a decent amount of coverage. The focus is more
on implementing the actual data structures and algorithms discussed in the book,
rather than working through the exercises, although some have solutions. I plan
on revisiting the book from time to time, to keep developing my knowledge of
Data Structures and Algorithms.
* Screenshot of org-mode
[[./screenshot.png]]

BIN
screenshot.png Normal file

Binary file not shown.

After

Width:  |  Height:  |  Size: 92 KiB