synergise-iit-bhubaneswar/beta-algo

OverView

This project focuses on bringing all data structures and algorithms in one place. Feel free to contribute to this repository and make sure to follow the guidelines.

How to Contribute

• Have a look at open issues, they contain the list of algorithms/DS we plan to be implemented.
• You can also create a new issue for an algorithm that is not in the list.
• Fork the repository.
• Clone the repo. to your local system.
• Add the codes that you want to contribute in the respective folder
• Make another Development branch. (Apart from main branch).
• Open the pull request.
• Resolve conflicts ( if any ).

Where to upload the files

• Your files should be uploaded directly into the corresponding folder (e.g. if you wrote code for a Data Structure in Python, it goes inside the DS folder within the Python folder and so on)
• Under no circumstances create new folders within the language folders to upload your code unless specifically told to do so.
• Make sure to go through the issue and PR template before contributing

Contributing Guidelines

• You can find our Contributing guidelines here.

Code of Conduct

• You can find our Code of Conduct here.

Happy Coding

beta-algo's Issues

Adding Binary Search Algorithm

Proposal

Add binary search algorithm.

Describe the solution you'd like

Binary search is an efficient approach to search a particular element from a sorted array of numbers.

How does it work?

You have a sorted array consisting of X elements, and you input the value to be found in it. The algorithm compares your input value with the key value of the array's middle element. So here we have 3 scenarios

• If input key value matches the key value of the middle element, then its index is returned.
• If input key value is lesser than the key value of middle element, then we do a search on the sub array to the left of the middle element.
• Similarly if the input key value is greater than key value of middle element, then we do a search on the sub array to the right of the middle element.

Have you read the Contributing Guidelines on Pull Requests?

Yes

Please answer the following questions for yourself before submitting an issue.

• I checked the documentation and found no answer
• I checked to make sure that this issue has not already been filed

Add Dijkstra's Algorithm in different languages

Proposal

Implement Dijkstra's algorithm in different languages

Describe the solution you'd like

Dijkstra's algorithm is an algorithm for finding the shortest paths between nodes in a graph

Have you read the Contributing Guidelines on Pull Requests?

Yes

Please answer the following questions for yourself before submitting an issue.

• I checked the documentation and found no answer
• I checked to make sure that this issue has not already been filed

Add linear search, binary search and ternary search in different languages

Proposal

Add algorithms for the above searching techniques

Describe the solution you'd like

A clear and concise description of what you want to happen.

Have you read the Contributing Guidelines on Pull Requests?

Write your answer here

Please answer the following questions for yourself before submitting an issue.

• I checked the documentation and found no answer
• I checked to make sure that this issue has not already been filed
  _

Add Jump Search and Fibonacci Search in different languages

Proposal

Add algorithms for the above searching techniques

Describe the solution you'd like

Have you read the Contributing Guidelines on Pull Requests?

Yes

Please answer the following questions for yourself before submitting an issue.

• I checked the documentation and found no answer
• I checked to make sure that this issue has not already been filed

Add merge sort, insertion sort, bubble sort, selection sort and quicksort in different languages

Proposal

Add algorithms for the above sorting techniques

Describe the solution you'd like

Have you read the Contributing Guidelines on Pull Requests?

Yes

Please answer the following questions for yourself before submitting an issue.

• I checked the documentation and found no answer
• I checked to make sure that this issue has not already been filed

Warshall Algoritm Implementation in Different Languages

Proposal

I want to implement warshall algorithm in a more concise form in different languages

Describe the solution you'd like

I will try to implement better weighted direction technique .

Have you read the Contributing Guidelines on Pull Requests?

YES

Please answer the following questions for yourself before submitting an issue.

• I checked the documentation and found no answer
• I checked to make sure that this issue has not already been filed

Add DFS and BFS of the directed and undirected graphs in different languages.

Proposal

Add the code for the above algorithms

Describe the solution you'd like

A clear and concise description of what you want to happen.

Have you read the Contributing Guidelines on Pull Requests?

Write your answer here

Please answer the following questions for yourself before submitting an issue.

• I checked the documentation and found no answer
• I checked to make sure that this issue has not already been filed

Add preorder, postorder and inorder traversal of binary tree in different languages

Proposal

Add algorithms for the above traversals

Describe the solution you'd like

Have you read the Contributing Guidelines on Pull Requests?

Yes

Please answer the following questions for yourself before submitting an issue.

• I checked the documentation and found no answer
• I checked to make sure that this issue has not already been filed

Issue in gcd.c documentation

Proposal

The time complexity for Euclid's algorithm is log(max(N1, N2)), but has instead been mentioned as log(N). This is therefore misleading and might cause some confusion, since it is not clear what "N" refers to.

I propose to change line 31 of the file to :
Time Complexity: O(log(max(N1, N2))), where N1 and N2 are the numbers whose gcd is being calculated.

Add Flood Fill Algorithm in different languages

Proposal

Implement Flood fill algorithm in different languages

Describe the solution you'd like

Flood fill is an algorithm mainly used to determine a bounded area connected to a given node in a multi-dimensional array.

Have you read the Contributing Guidelines on Pull Requests?

Yes

Please answer the following questions for yourself before submitting an issue.

• I checked the documentation and found no answer
• I checked to make sure that this issue has not already been filed

Add bit-manipulation algorithms in different languages

Proposal

Implementation of different bit-manipulation algorithms. The difficulty level of the issue and PR will be judged on the basis of the type of algorithm you want to implement

Describe the solution you'd like

A clear and concise description of what you want to happen.

Have you read the Contributing Guidelines on Pull Requests?

Write your answer here

Please answer the following questions for yourself before submitting an issue.

• I checked the documentation and found no answer
• I checked to make sure that this issue has not already been filed

Segment Tree implementation in different languages

Proposal

Implement segment tree methods in different languages.

Describe the solution you'd like

Implement the initialisation, update, and query methods for segment tree, and implementing the concepts of lazy propagation and persistence after the previous 3 methods have been implemented

Have you read the Contributing Guidelines on Pull Requests?

Yes

Please answer the following questions for yourself before submitting an issue.

• I checked the documentation and found no answer
• I checked to make sure that this issue has not already been filed

Bug Fix in matrix_sort.py

Describe the bug

Line 38 of matrix_sort.py is
if __name__ == '_main_':
which always evaluates to false, so it should be changed to
if __name__ == '__main__':
(double underscores instead of single underscores).

Have you read the Contributing Guidelines on Pull Requests?

Yes

Please answer the following questions for yourself before submitting an issue.

• I checked the documentation and found no answer
• I checked to make sure that this issue has not already been filed