Skip to content

rahulthewall/revisiting-algorithms

Repository files navigation

Barebones implementation of common algorithms and data structures in JavaScript, and the solution to a few association common problems.

The implementation for the algorithms is based on the pseudocde from the book Introduction to Algorithms.

Algortihms

The following algorithms have been implemented

  • Insertion Sort
  • Selection Sort
  • Merge Sort
  • Heap Sort
  • Quick Sort
  • Counting Sort

Data Structures

The following data structures have been implemented

  • Linked List (Single) with the following operations

    • Insert / Delete / Search
    • Reverse
  • Hash Table with the following operations

    • Get / Set
  • Binary Search Tree with the following operations

    • In order walk
    • Minimum / Maximum
    • Insert / Delete / Search

Common Problems

You will also find solutions to the following common problems

  • Find all pairs in an array which can add up to a given sum
  • Find maximum sub array

Releases

No releases published

Packages

No packages published