JSPM

  • ESM via JSPM
  • ES Module Entrypoint
  • Export Map
  • Keywords
  • License
  • Repository URL
  • TypeScript Types
  • README
  • Created
  • Published
  • Downloads 3
  • Score
    100M100P100Q38458F
  • License ISC

A Package to implement algorithms and data structures in JavaScript with ease.

Package Exports

  • advancejs
  • advancejs/index.js

This package does not declare an exports field, so the exports above have been automatically detected and optimized by JSPM instead. If any package subpath is missing, it is recommended to post an issue to the original package (advancejs) to support the "exports" field. If that is not possible, create a JSPM override to customize the exports field for this package.

Readme

One stop solution to implement algorithms and data structures in JavaScript with ease.

Data Structures : Queue, PriorityQueue, BST, DLL, LinkedList, Stack, HashMap.

Algorithms : BinarySearch, BubbleSort, CountingSort, HeapSort, InsertionSort, MergeSort, QuickSort, SelectionSort.

How to use:

const datastructures=require('./DataStructures');
const algorithms=require('./Algorithms');

console.log(datastructures);
console.log(algorithms);

const {Queue,PriorityQueue,BST,DLL,LinkedList,Stack,HashMap}=require('./DataStructures');
const {BinarySearch,BubbleSort,CountingSort,HeapSort,InsertionSort,MergeSort,QuickSort,SelectionSort}=require('./Algorithms');

Binary Search:

let arr=[2,7,9,3,6,8];
console.log(BinarySearch(arr,9));

Counting Sort:

let arr=[2,7,9,3,6,8];
console.log(CountingSort(arr));

Bubble Sort:

let arr=[2,7,9,3,6,8];
BubbleSort(arr);
console.log(arr);

Merge Sort:

let arr=[2,7,9,3,6,8];
MergeSort(arr,0,5);
console.log(arr);

Priority Queue:

const pq=new PriorityQueue((a,b)=>a>b);
pq.insert(10);
pq.insert(15);
pq.insert(3);

console.log(pq.get());