njseeto/js-algorithms

My JavaScript algorithms learnings.

---

What is in this repo?

This repo provides information on common algorithms, solutions, their time and space complexity.

A summary of the algorithms are found here.

These algorithms are grouped together as below:

Math Algorithms

• Calculate the sum of a number up to that number
• Primality
• Fibonacci
• Find the smallest number in an array
• Find the even and odd numbers
• Calculate the sum of an array
• Check is a number is a power of two
• Factorial Algorithm

Recursion and Dynamic Programming

• Fibonacci (with Recursion)
• Fibonacci (with Recursion and Memoization ie: dynamic programming)

Search Algorithms

• Linear Search
• Binary Search

Sorting Algorithms

• Bubble Sort
• Quicksort
• Merge sort

Sets (Arrays) Algorithms

• Cartesian Product
• Cartesian Product Multiple Sets
• Permutations

Problem Solving

• Problem Solving tips
• Knapsack problem
• Greedy vs Dynamic Algorithms
• Change Making - Greedy vs Brute Force

---

Tests

Each algorithm group will have sub-folders that contain:

• Readme explaining the algorithm
• Solution
• Test folder

To run the tests:

• Install node dependencies npm i
• Run tests npm run test

---

Additional Resources

• Geeks for Geeks
• JavaScript Algorithms and Data Structures

Next Steps

• Data Structures: Understand what data structures exists, how they work and when you use them.