manrajgrover / algorithms-js Goto Github PK

Search Algorithms to be implemented are:

• Linear Search
• Binary Search
• Jump Search
• Interpolation Search
• Exponential Search
• Ternary Search

Currently, one can add elements to stack only one element at a time. Need to allow arrays to be passed for building stack.

Add a section on how to:

1. Run tests?
2. Lint Code
3. Generate documentation

Description

Currently, NPM package does not contain es6 modules. Package should be shipped with the same for nodejs consumption.

Versions

• NodeJS version (if applicable): NA
• AlgorithmJS version: 0.0.12

Error

module.js:544
    throw err;
    ^

Error: Cannot find module './algorithms'
    at Function.Module._resolveFilename (module.js:542:15)
    at Function.Module._load (module.js:472:25)
    at Module.require (module.js:585:17)
    at require (internal/module.js:11:18)
    at Object.<anonymous> (/Users/manrajsingh/Github/test/algo/node_modules/algorithms-js/src/index.js:1:82)
    at Module._compile (module.js:641:30)
    at Object.Module._extensions..js (module.js:652:10)
    at Module.load (module.js:560:32)
    at tryModuleLoad (module.js:503:12)
    at Function.Module._load (module.js:495:3)

Expected behaviour

Seamless import

Steps to recreate

Install and require the package

Sorting Algorithms to be implemented are:

• Bubble Sort
• Selection Sort
• Insertion Sort
• Merge Sort
• Quick Sort
• Count Sort
• Heap Sort

Since auto documentation generation depends on JS DocStrings, there is need to fix and provide as much information possible.

Reference: http://usejsdoc.org/index.html

• Convex Hull
• Tangent between two circles
• Difference of rectangles

String Algorithms to be implemented are:

• KMP Pattern Search
• Rabin-Karp Pattern Search
• Aho-Corasick Pattern Search
• Z-Algorithm Pattern Search
• Levenshtein distance
• Longest common subsequence
• Longest common substring
• Longest common leading/trailing substring
• Dice's coefficient

As the title says, we need to implement LRU Cache.

Suggestion : we can implement a method for inserting or pushing node at specific index
###Description

In our current linked list implementation, we lack a method to insert or push a node at a specific index within the linked list structure. The addition of such a method would significantly enhance the flexibility and functionality of our linked list.

Proposed Method

The suggested method, tentatively named insertAtIndex(data, index), will take two parameters:

• data: The data to be stored in the new node.
• index: The index at which the node containing the provided data will be inserted.
  This method will handle the insertion of a new node at the specified index, considering edge cases such as insertion at the beginning, end, or any position within the linked list.

Currently, tests are added only for undirected graph, need to test directed graphs too.

Description

Currently, we make use of gulp. We need to move away from it and use Webpack.

Better interface is needed (this could be some other documentation generation tool, if required)

Currently, graph only allows adding vertices and edges. Need to support deletion of them too.

Description

I noticed that common algorithms related to graphs such as finding single source shortest path and multisource shortest path that are commonly used in programming paradigm are missing in the algorithms section. I would like to create a new directory named as Graph-Based-Algorithms and try to add them

Versions

• AlgorithmJS version:

Error

Expected behaviour

Steps to recreate

Step 1 ->Creating a directory named as Graph-Based-Algorithms
Step 2-> Creating a file named as Djkstras.md which would be a readme file where I would implement the Djkstras Algorithm
Step 3-> Creating a file named as EdmondKarp.md which would be a readme file where I would implement the Edmond Karp Algorithm
Step 4 ->Creating a readme file named as readme.md where I would write and link all the aforesaid algorithms and this would be present in the directory.

People to notify

Currently, one can add elements to queue only one element at a time. Need to allow arrays to be passed.

Data Structures to be implemented are:

• Segment Trees
• Binary Search Tree
• Graphs

Integrate Appveyor

Description

Docusaurus is a documentation website builder by Facebook. Need to explore and build a website for documentation of this project.

Integrate Travis with the project

• Viterbi algorithm

Description

Versions

• NodeJS version (if applicable):
• AlgorithmJS version:

Error

Expected behaviour

Steps to recreate

People to notify

Description

Currently, test coverage is at 90% which can surely be improved. Possibly, one of the easiest ways for someone to contribute to this library.

Graph Algorithms to be implemented are:

Shortest Distance

• Bellman Ford
• Floyd Warshall
• Dijkstra
• Johnson

Search

• BFS
• DFS

Build is failing due to path issue which is not reproducible locally. Need to look into it.

          Kindly assist me with the correct answer to this Repository

Thanks

Originally posted by @DANEX78 in #145 (comment)

Currently, there is no documentation for the code. I feel instead of normal markdown documentation, we should have a Sphinx-like documentation.

Need to explore some options.

Description

interpolationSearch always returns -1 even if value is included in an array with duplicates. For instance, if the input is [42,42,42] and the target element is 42, the interpolation search will return -1 although 42 is included in the array.

Versions

• NodeJS version (if applicable): 8.10.0
• AlgorithmJS version: 0.0.13

Expected behaviour

interpolationSearch should return 0.

Steps to recreate

Input an array with all the same values in interpolationSearch, and a target element which is included in the array.

People to notify

@manrajgrover

Currently, Heap Constructor accepts only compare function. Need to support heapifying through arrays.

Create a gulp task for transpiling the code to ES5

Math algorithms to be implemented are:

• GCD
• LCM
• Multiplication Expo Squaring
• Find Divisors
• Fibonacci
• Fisher Yates
• Check if number is a prime
• Calculate square root using Newton's method
• Extended Euclid Algorithm
• Mod Inverse
• Mod Inverse using Fermet
• Euler's Totient Function
• Euler's Inverse method
• Inverse of first 'n' numbers
• Combination Modular

• Determinant of a Matrix
• Tridiagonal Matrix Algorithm