* 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
* add zig examples
* improved zig binary search
This commit improves the binary search code in zig. The function has
been made generic and the logic has been cleaned up a bit.
The code has been updated to work with zig versions >= 0.9
* simplify zig selection sort
This commit simplifies the logic of the zig selection sort. It now swaps
in place the elements of the array instead of creating another array.
This avoids allocating heap memory.
The code has also been upgraded to zig version 0.9.1
* make zig recursion examples generic
This commit modifies the zig examples for the recursion chapter to be
generic. It also updates the code to zig version 0.9.1
* update chapter 4 examples
This commit updates the zig examples in chapter 4. In particular
examples have been made generic where possible. The code has been
updated to zig version 0.9.1
* update zig hash table examples
This commit updates the examples for the chapter 5 about hash tables.
Some improvements have been done (using a set instead of a map). The
code has been updated to zig version 0.9.1
* update breadth first search zig example
This commit updates the zig example for the breadth first search
algorithm. It adds a unit test and updates the code to zig version 0.9.1
* revamp zig dijkstra example
* add comments in dijkstra zig
* fix zig greedy algorithm
* add test for zig dijkstra
* add test for zig greedy algorithm
* improve zig chapter 9 exercise
This commit improves the zig exercise to comput the longest common
subsequence.
A main function has been added and the allocator code has been extracted
from the `subsequence` function.
* binary search c++
* selection sort c++11
* c++ recursive countdown
* c++ recursion
* c++ quicksort
* rename folder names to c++11
* add another version of binary_search function
* c++11 hash tables
* c++11 breadth-first search
* Update the names to make ES5 and ES6 solutions more consistent
I basically change the names to make the function more explicit and clear:
1. list to sortedList
2. mid to middle
* Revert "Update the names to make ES5 and ES6 solutions more consistent"
This reverts commit 46d7514636420eb3b3c581665eaa3c0aca9df99d.
* [selection sort] update Js (ES5, ES6) to make them more consistent and explicit
* Update 01_selection_sort.py
Updated last print statement for Python 3 print function.
* Update 01_countdown.py
Updated print statement to print function for Python 3.
* Update 05_quicksort.py
Updated print statement to print function for Python 3.
* Update 01_price_of_groceries.py
Condensed dictionary creation into one line, edited print statement to a print function for Python 3.
* Update 01_set_covering.py
Changed print statement to print function for Python 3.
* Update 01_binary_search.py
Changed print statements to print function for Python 3.
* add ES6 example for binary search
* add ES6 example for selection sort
* add ES6 example for countdown
* add ES6 example for greet
* add ES6 example for factorial
* edit ES6 example for quicksort
* add ES6 example for loop sum
* add ES6 example for recursive sum
* add ES6 example for recursive count
* add ES6 example for recursive max
* add ES6 example for price of groceries
* add ES6 example for check voter
* add ES6 example for breadth-first search
* add ES6 example for dijkstras algorithm
* edit ES6 example for dijkstras algorithm
* edit ES6 example for set covering
* add ES6 example for longest common subsequence
* Adding binary search example for Haskell
* Adding selection sort example in Haskell
* Adding Haskell examples for chapter 3
* Adding examples for chapter 4
* Adding examples for chapter 5
* Adding git ignore
* Add Haskell example for BFS
