English | Português
Algorithms & Data Structures(ADS) is an important topic in Software Development world. Create excellent algorithms is a skill which all developers should master and ADS are fundamental to create efficient code. This repository contains implementation of common ADS and the goal of this repository is to help all developers, especially beginners, master ADS.
-
Data Structures
- Array
- Hash Table
- Stacks
- Queues
- Linked Lists
- Binary Tree
- Graph
- Binary Heap
- Priority Queue
-
Algorithms
- Recursion
- Factorial
- Fibonacci
- Searching/Traversal
- Linear Search
- Binary Search
- Tree
- Binary Search Tree
- Breadth First Search
- Depth First Search
- Graph
- Breadth First Search
- Depth First Search
- Dijkstra Algorithm
- Sorting
- Bubble Sort
- Insertion Sort
- Selection Sort
- Quick Sort
- Merge Sort
- Radix Sort
- Recursion
Anyone can contribute to this repository, it doesn't matter if you are a master in ADS or if you've just started learning to code, every contribution is welcome, feel free to add, refactor or modify anything you think is or will be useful, from a small typo to an algorithm improvement or even a suggestion. If you are a adding something new, please be sure to add it to the right folder.
- Fork this repository(Top right side)
- Clone your forked repository
For example, run this command in your terminal/command prompt:Replace <your-github-username> with your usernamegit clone https://github.com/<your-github-username>/javascript.git
- Install all dependencies(You need Node installed in your machine)
Run the following command:If you don't have Node installed in your machine, you can download it here, make sure you download the stable version, the one which ends with LTS, for example 14.17.5 LTS.npm install # or yarn install
- Make your changes with
git add
andgit commit
. Note: Please write good commit messages. - Run this command to push your changes to your forked repository:
git push origin master
- Go to the Github page of your fork and make a pull request.