This project is dedicated to using algorithms to sort data and practice with certain data structures using Javascript. These include mergeSort, graphs, linked lists, hash maps and binary search trees.
This project uses recursion to go over a fibonacci sequence. Furthermore, merge sort algorithm is used to return a sorted array.
Access the Recursion lesson requirements on The Odin Project.
This project uses linked lists and provides methods to add, remove, find and other related methods in the created linked lists.
Access the Linked lists lesson requirements on The Odin Project.
This project uses hash maps and provides methods to set, retrieve, remove, includes and other related methods in the created hash maps.
Access the Hash map lesson requirements on The Odin Project.
This project uses binary search trees where an array of data is turned into a balanced binary tree. Various methods like insert, delete and find are implemented.
Access the Binary Search Tree lesson requirements on The Odin Project.
This project uses graphs to calculate the shortest path between certain squares in a chess board.
Access the Knights travails lesson requirements on The Odin Project.
In order to run project locally NodeJS + Git needs to installed on your system
Follow these steps on Mac/Linux/WSL to run the project locally:
- Open a terminal and go to a directory you want the repository to be in
- Select Code in the Github project page and copy the SSH URL
- git clone SSH URL
- 'cd' into the repository you just cloned
- 'cd' into of the sub directories
- Add console.log statements with the functions and parameters you want to call to the files
- Save the file and run 'node filename.js' in a terminal