8000 GitHub - ericfree2000/dsa.js-data-structures-algorithms-javascript at circle-ci
[go: up one dir, main page]

Skip to content

ericfree2000/dsa.js-data-structures-algorithms-javascript

 
 

Repository files navigation

Data Structures and Algorithms in JavaScript

CircleCI NPM version PRs Welcome Code Style Airbnb ProductHunt

This repository covers the implementation of the classical algorithms and data structures in JavaScript.

Usage

You can clone the repo or install the code from NPM:

npm install dsa.js

and then you can import it into your programs or CLI

const { LinkedList, Queue, Stack } = require('dsa.js');

For a full list of all the exposed data structures and algorithms see.

Book

You can check out the dsa.js book that goes deeper into each topic and provide additional illustrations and explanations.

  • Algorithmic toolbox to avoid getting stuck while coding.
  • Explains data structures similarities and differences.
  • Algorithm analysis fundamentals (Big O notation, Time/Space complexity) and examples.
  • Time/space complexity cheatsheet.

dsajs algorithms javascript book

Data Structures

We are covering the following data structures.

Interactive Data Structures

Linear Data Structures

  1. Arrays: Built-in in most languages so not implemented here. Array Time complexity

  2. Linked Lists: each data node has a link to the next (and previous). Code | Linked List Time Complexity

  3. Queue: data flows in a "first-in, first-out" (FIFO) manner. Code | Queue Time Complexity

  4. Stacks: data flows in a "last-in, first-out" (LIFO) manner. Code | Stack Time Complexity

Non-Linear Data Structures