I think it would be nice to have written and visual support through an elementary workflow

• Add the code
• Add docstring
  • With doctest example (optional but nice)
• Add test (optional, but kind of very nice if not done in the doc)

That is area.jl and area_under_curve.jl

Another option would be to split them, but the current organization is not coherent

There are two binary search methods in the repo. One seems to be used for the exponential search.
That would be nice to only have one method that could also be used in the exp search.

I strongly suggest adding Doxygen documentation like in the C/C++ repositories before it's too late. That way, students and learners can learn easily from the Julia algorithms.

What do you guys think? @maltejur @AnupKumarPanwar

I kind of consider every code I write as my footprint, so I add author and date there
But when I add the details in docstring which is just there for the code user, it shows up in the website documentation too
Here: https://thealgorithms.github.io/Julia/dev/

Contributed By:- [Ashwani Rathee](https://github.com/ashwani-rathee)

If it shows in documentation online, what I kind of want is

and not :

What do you people think? and How do I do that?

Good evening Sir, I would like to implement either of the following sorting algorithm into this repository

• Counting Sort
• Exchange Sort

Do you think it will be useful? I think it will be helpful to have Counting/Exchange Sort algorithm added as I think it's beginner friendly. Thank you for your time and consideration, I look forward to hearing from you

I would like to implement the BFS and DFS graph algorithms with documentation and add them to the graph folder which currently only has Dijkstra's algorithm.

The number of algorithms are arranged/grouped into categories, first thing to do is to create submodules based on the categories.

Work starts around next week. Going to assign myself.

I believe that some algorithms provided are based on calling a library. I don't believe this brings a lot of understanding to the possible users of The Algorithms.
As long as it is possible, we should probably aim for library-agnostic code (to a reasonable extent, please do not re-code a full neural network module ...)

This is a conceptual issue. Thus, we don't need to make changes about it right now.

Also, as a side remark, it makes the CI tests super long to have that many dependencies.

binary_length.jl
Shouldn't this be in the math folder as this has not much to do with strings? The input is being parsed to an integer type and the output is being converted to a string. Rather, we should just have input and output both as integers. Also, the time complexity for the second function is O(logn), rather than the stated O(n).

Add bellman_ford.jl to demonstrate the Bellman-Ford algorithm for finding the shortest paths in a weighted graph, an alternative to the already implemented Dijkstra's algorithm which would allow for negative edge weights.

What would you like to share?

We're using a new link for The Algorithms' Discord invitation.
All Discord invitation links should point to https://the-algorithms.com/discord/.

Additional information

This is a good first issue. Please leave it open to first-time contributors and beginners. 🙂