TheAlgorithms VS javascript-algorithms

3. TheAlgorithms/Python - For those interested in algorithms and data structures, this repository offers Python implementations for a wide range of algorithms. It's a great way to deepen understanding of algorithmic learning with Python. https://github.com/TheAlgorithms/Python

Is it me or does it not seem very well thought out? Every example I've seen only has implementations in JavaScript and/or Python. I haven't seen any other languages nor a way to search by language. What a "string" means in one language can be completely different in another language. The primitive data types that the project assumes are not really supported across all programming languages.

Also if anyone hasn't already seen them, similar projects already exist and are more complete. E.g.

* https://rosettacode.org/

* https://programming-idioms.org/

* https://the-algorithms.com/

Not to mention LeetCode, CodeWars, Project Euler, Exercism can kinda serve the same role.

Hey Everyone, My name is Rachit Chawla and Its my first blog on dev.to. I am currently a student of Computer Programming and Analysis at Seneca College. Also I'm currently on my co-op term working as an Automation Developer at Ontario Public Service. In this role, I am currently working with PowerShell scripting and Microsoft Azure for automating every manual tasks to reduce workload and increase efficiency. This blog is a part of OSD600 course at Seneca College. I am taking this course as I am big fan of open source and always wanted to contribute in open source projects but I am unaware of proper documentation and standards used for open source contributions. I am hoping to learn all the required stuff by the end of this course and I aim to be one of the 15k contributors to Linux's repo by Linus Torvald. Open Source interests me because it gives developers the power to customise the application they want to use, also a chance to help others and improve their skills. I found https://github.com/TheAlgorithms/Python interesting from the Monthly trending feed on Github as it has all the algorithms which help us improve time complexity and write better codes. I has about 1000 contributors which helped to code all the algorithms in Python which may help others for working or learning purposes. I myself was a student of Data Structures and Algorithms in Python Winter 2023 and hoping to even able to contribute to this repo itself, once I learn more about documentation & proper standards to be followed.

The Algorithms Contains many open source implementations of algorithms. Check it out.

If you want to see implementations of all possible traversal algorithms you can find it here.

The mother load of all algorithms in python is here. dfs/bfs in particular are in the graph section.

There is no one way to learn all these but here are some resources: 1. Gooking algorithms [https://edu.anarcho-copy.org/Algorithm/grokking-algorithms-illustrated-programmers-curious.pdf\] 2. Algorithms in all languages [https://the-algorithms.com/] 3. Node js best practices. [https://github.com/goldbergyoni/nodebestpractices] 4. Refactoring [https://refactoring.guru/] 5. Learn about Clean Code and Clean Architecture from uncle bob. https://www.youtube.com/watch?v=NeXQEJNWO5w&ab_channel=StreamAConStreamingConferences

DSA basics

I would recommend The Algorithms, it comes with descriptions and examples in multiple programming languages.

There's also The Algorithms. Many implementations are unfortunately low quality. The Lua ones (disclaimer: I wrote them) should be fine however.

I'm reminded of the time when some kid wrote a script to crawl GitHub and create issues[1] about using inclusive language... except it was really dumb, for example: https://github.com/trekhleb/javascript-algorithms/pull/875/f...

[1] E.g.: https://github.com/EbookFoundation/free-programming-books/pu...

Try codewars or leetcode Or you can use this repo for ds practice https://github.com/trekhleb/javascript-algorithms

This one is pretty popular too.

for algos - not sure how much you'll need to do for a jr position but familiarity with some of the beginner stuff here couldn't hurt: https://github.com/trekhleb/javascript-algorithms

Traditionally, a linked list allows you to insert before/after a node. i.e. addBefore(node,value) (see [2] ) He doesn't implement addBefore & addAfter.

Instead, he provides a whole bunch of non-canonical helpers like reverse(), toArray(), deleteTail() etc - these are typical LC-Easy problems that don't belong inside the data structure.

My own introduction to these things was a C course called "Data Structures in C" in the traditional CS curriculum, and yes, you would have to malloc a new node, get back a pointer with a memory address, & the process of pointing the next pointer of the current node to this new node so that the memory address of the next value was explicitly "linked" to the current value and hence linked list etc...I guess much of that terminology is lost on the new generation in the absence of pointers & memory addresses.

The canonical exercise in those days was - Show that a linked list does not store objects in contiguous memory, unlike an array. So to solve this, you would traverse the list from the head node & print the actual addresses of the memory locations along the way, proving that the vals aren't stored contiguously. I wonder what that exercise would mean in JS land.

That said, yeah its a good starting point & I applaud the effort.

[1]https://github.com/trekhleb/javascript-algorithms/blob/maste...