Algo-Tree is a collection of Algorithms and data structures which are fundamentals to efficient code and good software design. Creating and designing excellent algorithms is required for being an exemplary programmer. It contains solutions in various languages such as C++, Python and Java.
hey,I want to add insertion sort with worstcase timecomplexity of O(nlogn) for the number of comparisions in c++ because the already present code has n^2 comparisons as worst-case ; Assign me this issue; I am very good at dsa and can contribute to this issue as a part of GSSOC'21
Some PRs might not pass the checks if people somewhere by mistake forget to follow the styling. Also there are currently no documentation on correct syling. Using .clang-format will also allow automated styling instead of manually fixing stuff.
Note that once we fix a styling, we will need to apply it to all existing C++ code.
Task: Can implement all graph algorithms like Floyd-Warshall, Dijkstra, Prim's MST in C++ and Java.
Motivation: I am efficient in Problem Solving using C++ and Java and have solved more than 800 problems on various online judges like GeeksforGeeks, LeetCode, HackerRank etc. You can check my profile here:
I see that currently this project has no codes corresponding the Python programming language.
I have good knowledge of Python programming language as well as fair knowledge of DS in Python.
I can easily code for Arrays, Stacks, Queues, Linked-List as well as Trees in Python.
I am trying to learn more as well.
Will be glad to make some decent code contributions for all those topics on DSA in python to make this project really awesome.
You can assign any or all of these to me.
I am currently a participant of GSSOC'21
Will be waiting for a response to go ahead :)
hey,I want to add memory and time efficient stack data structure to store heterogeneous data (like ex: int or char or float in same stack) with all functionalitiesin of stack in c++ ; Assign me this issue; I am very good at dsa and can contribute to this issue as a part of GSSOC'21
hey, I want to add min.swaps for BT to BST conversion algorithm and code in java ; I have previously worked on it and will be grateful to work on same under mentors of GSSOC'21 and develop the code even better. Assign it to me.
Sir,
I would like to add Sieve of Eratosthenes algorithm in the algorithm section. I make very brief explained C++ code following the code of conduct.
To confirm you can see the Pull Request, that I made by adding Brian Kernighan's algorithm (yet to be reviewed by you). I have made that in a very informative way. Please review that and if you think my work is worth it, then please assign "Sieve of Eratosthenes" to me and merge the previous PR.
Link to Brian Kernighan's PR #44
Sir,
I have made an extensive C++ file for Brian Kernighan's algorithm. I have explained the intuition and idea of the algorithm briefly.
I have made a pull request regarding the same. Please review my request and if you feel that it is worth it, then please merge it.
Link to PR- #43
@plazzy99 @rudrakshi99 @nakul-19
I have been selected for GSSOC'21, and I am really interested in DSA, so I would like to contribute in this amazing repository.
Regards,
Debanjan Poddar
Hi
I find that array operations are not implemented. I have a piece of good knowledge on dsa. I can easily implement array operation(Insertion at the middle, Insertion at the end, Deletion at the beginning, Deletion at the middle, Deletion at the end) in c++. I would be happy to make my pull request for this.
I am currently a GSSOC'21 Participant.
Will you please assign these to me.
I wish to contribute to this project by adding implementations of both B-tree as well as BST in python.
I will also add some more operations which can be performed on a B-Tree as well as BST in python as well.
I am currently a participant in the GSSOC'21.
Will be waiting for your response :)
hey, I want to add min edges need to be removed for making BFS=DFS in java; I have previously worked on it and will be grateful to work on same under mentors of GSSOC'21 and develop the code even better. Assign it to me.
hey, I want to add calculation of betweenness-centrality of all nodes in a graph in java ; I have prior experience working on this and will be grateful to work under mentors of GSSOC'21 and develop the code even better. Assign it to me
Given an integer array, and an element x, find the index of the element in O(log n) time.
Integer array is sorted in ascending order, but it is rotated at some pivot.
Example:
Input: arr[] = {5, 6, 7, 8, 9, 10, 1, 2, 3}, x = 3
Output: 8