* Added 1 and 2 chapters
for D lang
* [D] Added recursion code
All examples were ported from the Python code directly to D.
Naming convention of Dlang is not allowing to run code files, which started with numbers. To run examples rename the files
* [D] quicksort code
* [D] Added hashtable example
Based on the Python code
* Create 01_breadth_first_search.d
Added D example for breadth-first search
* Create 01_filesystem_dfs.d
Filesystem example in D
* Create 01_dijkstras_algorithm.d
Added Dijkstras algorithm implementation for D
* Create 01_set_covering.d
Added greedy algorythm for D
* Create 01_longest_common_sub.d
Added dynamic programming example for D language.
The code is based on Rust example
* Added modules definition
Required to run code with names starting with numbers
* Fixed proper unsigned handling
The original code did not work correctly out of the box. It generated a (4,5) grid instead of a (5,4) grid as the book's answer grid shows. Also on line 10 of my code I changed `dp_table[i-1][i-1] + 1` to `dp_table[i-1][j-1] +1`. I also updated the display to display by row.
Co-authored-by: WhileRested <148598154+WhileRested@users.noreply.github.com>
