Huge News!Announcing our $40M Series B led by Abstract Ventures.Learn More
Socket
Sign inDemoInstall
Socket

adv-dsa

Package Overview
Dependencies
Maintainers
1
Versions
7
Alerts
File Explorer

Advanced tools

Socket logo

Install Socket

Detect and block malicious and high-risk dependencies

Install

adv-dsa

JS-DSA is a comprehensive collection of data structures and algorithms implemented in JavaScript. This project is designed to be a helpful resource for developers, students, and anyone interested in learning about data structures and algorithms through pr

  • 1.1.5
  • latest
  • Source
  • npm
  • Socket score

Version published
Maintainers
1
Created
Source

JS-DSA :: JavaScript Data Structures and Algorithms

JS-DSA is a comprehensive collection of data structures and algorithms implemented in JavaScript. This project is designed to be a helpful resource for developers, students, and anyone interested in learning about data structures and algorithms through practical JavaScript examples.

Table of Contents

  • Installation
  • Usage
  • Practical Examples
  • Contribution Details
  • Code of Conduct
  • Learning Resources
  • License
  • Developer Options

Installation

You can install JS-DSA using either npm or yarn. First, clone the repository to your local machine:

git clone https://github.com/pb2204/JS-DSA.git
cd JS-DSA

Using npm

npm install adv-dsa

Using yarn

yarn add adv-dsa

Usage

JS-DSA provides a wide range of data structures and algorithms. You can utilize them by importing the necessary classes into your JavaScript projects.

// Example of using a Stack from the data structures module
const { Stack } = require('./data-structures/stacks-and-queues/Stack');

const stack = new Stack();
stack.push(1);
stack.push(2);
stack.push(3);

console.log(stack.pop()); // Outputs: 3

For detailed information on how to use each data structure and algorithm, consult the LEARN.md document in this repository.

Practical Examples

Let's look at some practical examples of using JS-DSA classes:

const binarySearch = require('adv-dsa').BinarySearch;

const sortedArray = [1, 2, 3, 4, 5, 6, 7, 8, 9, 10];
const target = 5;

const index = binarySearch(sortedArray, target);
console.log(`Index of ${target} is ${index}`);

Example 2: QuickSort

const quickSort = require('adv-dsa').QuickSort;

const unsortedArray = [3, 6, 8, 10, 1, 2, 1];
const sortedArray = quickSort(unsortedArray);

console.log(sortedArray);

License

This project is open-source and available under the MIT License.

Contribution Details

For developers who want to contribute to this project or want to report issues, please refer to the CONTRIBUTING.md guide.

Code of Conduct

Please follow our Code of Conduct to foster an open and welcoming environment for everyone.

Learning Resources

Check out the LEARN.md file for learning resources related to data structures and algorithms.

Feel free to contribute, provide feedback, and help us improve this project for the community!

Developer Details

Happy Coding !!!

Keywords

FAQs

Package last updated on 16 Oct 2023

Did you know?

Socket

Socket for GitHub automatically highlights issues in each pull request and monitors the health of all your open source dependencies. Discover the contents of your packages and block harmful activity before you install or update your dependencies.

Install

Related posts

SocketSocket SOC 2 Logo

Product

  • Package Alerts
  • Integrations
  • Docs
  • Pricing
  • FAQ
  • Roadmap
  • Changelog

Packages

npm

Stay in touch

Get open source security insights delivered straight into your inbox.


  • Terms
  • Privacy
  • Security

Made with ⚡️ by Socket Inc