Some Simulation Algorithms like Monte Carlo Pi Approximation, Markov Chain and Metro-Police algorithm would be a nice addition

We present all of of our algorithms in an organized list, DIRECTORY.md so visitors can rapidly find topics of interest. Currently DIRECTORY.md is being autogenerated by one of our GitHub Actions which uses Python code to create the directory text.

Why should the JavaScript repo rely on Python code?!? Especially given that GitHub Actions fully support the creation of JavaScript-based Actions. Can we use JavaScript to autogenerate DIRECTORY.md and lose the Python code in the process?

Can I work on addition of the web programming segment as available in TheAlgorithms/Python? I would like to work on the Open Weather Maps example.

instead of keeping one solitary readme I the root folder, it would be better to add separate README to each folder.
what this would achieve would be that for someone interested in ciphers should open the folder and find details in the README specific to ciphers only.
This seems like an easy process of splitting the README into separate duplicates and then adding them to individual folders, I would really love it if I can work on this. 🥇 😃

There is a typo in Prim's MST Algorithm, it says Kruskal's Algorithm inplace of Prim's Algorithm

// hexOut.push(intToHex(num % 16))
hexOut.unshift(intToHex(num % 16))

Would an implementation for finding the median in circular data (angles, hours...) be of interest here? I recently implemented one in JS from a published paper (original implementation in R).

https://github.com/Sheraff/boids/blob/master/js/median.js

If so, I can format it to meet the standards.

we should update contributing guidelines to use arrow function, this keyword and classes over traditional function as they provide some good features of ECMAScript, provide more readability and allow a user to write less code.

12 Reasons Why ES6 is the future of JavaScript and Web Development

I have no rights to commit this file.
I will be grateful if you can deal with it.

Algorithm to find largest sum contiguous subarray.
I am assigning this to myself.

We have to re-organize some files and folders in this repository, as per discussion here. These actions include:

• Remove our Algorithms folder and put the contents in their correct category
• Rename Linear-Algebra-Javascript to Linear-Algebra
• QuickSelect.js should go to arrays or something else
• Conversions, Ciphers, Hashes, should they be in the maths directory?

Feel free to add your suggestions.

some algorithms 🥇

• Add Kruskal's Algorithm to find Minimum Spanning Tree
• Algorithm to find the Minimum Spanning Tree using Prims Algorithm #227
• Algorithm to find connected components using Disjoint sets
• Algorithm to find connected components in the graph using depth-first search #223
• Depth First Search Algorithms #199

feel free to add more algorithms in the list
thank you, @itsvinayak

We can add the sort routine used by std::sort in c++ standard library in JavaScript.
Introsort is a hybrid sorting algorithm that uses quicksort and heapsort. The C++ STL takes it a step further and adds insertion sort to it for small length arrays.
We can add a method is JS for introsort which takes array and a compare function as parameters and sorts the array.

We have two different implementations of heap sort. Can we build a benchmark to prove which one is faster or better than the other? Benchmark against small datasets, large datasets, and empty datasets. It is OK to keep both if they have different strengths and weaknesses. If there is a clear winner, let's delete the other one.

// My code just improves a little
// Feel free to ask me questions

function dp_ficbo(n)
{
var val = [];
for ( let i = 0; i <= n; i++)
{
val[i] = 0;
}

	if ( n == 1 || n == 2)
	{
		return 1;
	}
	else
	{
		val[1] = 1;
		val[2] = 2;

		for ( let i = 3; i <= n; i++ )
		{
			val[i] = val[i - 1] + val[i - 2];
		}
	}

	return val[n - 1];
}

console.log(dp_ficbo(20));

Add .gitignore file to ignore the addition of node modules and other unwanted files in the commits.

If a memeber views this, please add good first issue and difficulty: easy labels

I'd like to contribute new Stack realization in ES6 (classes) syntax.

anyone who wishes to work can takeup this issue.

These algorithm implementations are very helpful. But they could be shorter and easier to understand with Typescript, using Typescript features. Many people use Typescript instead of directly Javascript now. How about converting these algorithms to Typescript?

There is a missing declaration for variables in Flash sort.

I am working on it.

anyone who wishes to work can takeup this issue

The DFS algorithm uses tree in-place of graph, it should be moved to the tree section

Please add more algorithms to this repo.

See the structure and README of this repo for reference
https://github.com/TheAlgorithms/Python

currently we do not have the Depth first search implementaion.

anyone who wishes to work can takeup this issue.

For extra learning reference material

Following is the url - https://github.com/prateekiiest/Javascript/blob/master/sorts/sortinggraphs.png
(May be this is private)

DijkstraSmallestPath.js is stored in Maths subfolder. It should be stored in the Graphs subfolder.

Study krne

.js extension needs to be added to HexToRGB file

The following FilePaths fail npx standard FilePath and can not be fixed using the --fix option.

• https://standardjs.com
• Javascript/linear-algebra-javascript/test/test.js
• Javascript/linear-algebra-javascript/src/la_lib.js
• Remove || true from the npx standard command

• Javascript/Ciphers/keyFinder.js #140
• Javascript/Ciphers/vigenereCipher.js #140
• Javascript/Conversions/DecimalToHex.js #140
• Javascript/Data Structures/Graph/Graph.js #141
• Javascript/Data Structures/Heap/MinPriorityQueue.js #140
• Javascript/Data Structures/Linked List/DoublyLinkedList.js #140
• Javascript/Data Structures/Queue/Queue.js #140
• Javascript/Data Structures/Stack/Stack.js #140
• Javascript/Data Structures/Tree/Binary Search Tree.js #140
• Javascript/Hashes/SHA256.js
• Javascript/Search/linearSearch.js #143
• Javascript/Sorts/TopologicalSort.js #141
• Javascript/Sorts/bogoSort.js #150
• Javascript/Sorts/bucketSort.js #141
• Javascript/Sorts/combSort.js #141
• Javascript/Sorts/cycleSort.js #141
• Javascript/Sorts/heapSort.js #150
• Javascript/Sorts/selectionSort.js #141
• Javascript/Sorts/wiggleSort.js #150
• Javascript/maths/DijkstraSmallestPath.js #147
• Javascript/maths/abs.js #144
• Javascript/maths/factorial.js #145
• Javascript/maths/find_lcm.js #146
• Javascript/maths/graph.js

it will be good if algorithms have Doctest's https://www.npmjs.com/package/doctest

Yes I will work on it and make a PR soon

standard module needs to be added as a dev dependency in the package.json file

The function works fine on the browser. The instance returns the time run.
However, nodeJS uses a completely different structure for it's timers.
It may not be necessary in NodeJS. I genuinely think it helps otherwise, I use it to time my unit tests.

The value returned by setInterval() is the total runtime of the timer.

anyone who wishes to work can takeup this issue.

• Adding hints and doctest to old codes
• Reviewing Pending PRs ( fixing code format by running npm standard --fix PR labeled under "failing npm standards" )
• Helping new Contributors
• Add more algorithms

thank you

I am willing to add algorithm to test if strings are anagram. May I add?

Anyone who wishes to work can takeup this issue

The Connected Components should hold the type of graph (adjacency list) in its name (needs to be updated it in the main section too)

contributing guidelines are needed to clear doubts of new contributor

This is suggestion to add labels such as

• In Progress
• Ready for Review
• On Hold
• Need Help
  etc...

Thanks again & once again kudos for this amazing initiative & library...