Ds in Js is a repository that contains implementations of various basic data structures and algorithms in JavaScript. Whether you are a beginner looking to learn about data structures and algorithms or an experienced developer looking for a quick reference, this repository has you covered.
Understanding data structures and algorithms is fundamental for any programmer. This repository aims to provide clear and concise implementations of various data structures and algorithms in JavaScript. Each data structure and algorithm is implemented in its own individual file, making it easy to find and use the code.
A basic singly linked list implementation.
Basic string manipulation functions.
A binary search tree data structure and relevant operations.
A graph data structure and common graph algorithms.
A hash table (hash map) implementation.
A binary heap data structure and common heap operations.
A stack data structure.
A queue data structure (implemented using arrays and linked lists).
A trie data structure for efficient string searching.
Examples of recursive algorithms and functions.
An implementation of the selection sort algorithm.
An implementation of the insertion sort algorithm.
An implementation of the bubble sort algorithm.
An implementation of the merge sort algorithm.
An implementation of the quick sort algorithm.