Skip to content

An attempt to implement and summarise the key features of the main data structures and algorithms.

Notifications You must be signed in to change notification settings

Kieran-Arul/dsa-implementation-and-notes

Folders and files

NameName
Last commit message
Last commit date

Latest commit

 

History

3 Commits
 
 
 
 
 
 

Repository files navigation

Project Overview

  • This project includes a collection of JavaScript files, whose purpose is to provide some summary notes, as well as implementations of most of the standard data structures and algorithms.

  • Do contact me if you find any errors, especially in my implementation code.

  • Data structures that are covered include:

    • Linked List
    • Stack
    • Queue
    • Graph
    • Hash Table
    • Tree
  • Algorithms that are covered include:

    • Bubble Sort
    • Selection Sort
    • Insertion Sort
    • Merge Sort
    • Quick Sort (Notes only)
    • Radix Sort (Notes only)
    • Heap Sort (Notes only)
    • Breadth First Search
    • Depth First Search
    • Recursion
    • Dynamic Programming

How to Use

1. Clone the repository to your local machine

git clone https://github.com/Kieran-Arul/dsa-implementation-and-notes

2. cd into the project directory

cd dsa-implementation-and-notes

3. Open up the directory in your favourite text editor to view the various files. For example, if you are using VS code:

code .

About

An attempt to implement and summarise the key features of the main data structures and algorithms.

Resources

Stars

Watchers

Forks

Releases

No releases published

Packages

No packages published