Code Monkey home page Code Monkey logo

ds-algo-handbook's People

Contributors

a-lakh avatar aditya5558 avatar adriaferre avatar akshaj5 avatar amanmehta-maniac avatar amanshahi avatar anujgoyal1 avatar ashwinpathak20 avatar aswin6197 avatar bashtech123 avatar ezefran avatar jainayush975 avatar laps15 avatar menikhilpandey avatar nakulvaidya avatar narmada-dm avatar nikitakorba avatar noveens avatar op01 avatar patniharshit avatar pranavgoel25 avatar radhikadua123 avatar rit7897 avatar sbshah97 avatar shiva1208 avatar shrawnz avatar terry182 avatar wit-e-kname avatar yash-iiith avatar zorroblue avatar

Stargazers

 avatar  avatar  avatar  avatar  avatar  avatar  avatar  avatar  avatar  avatar  avatar  avatar  avatar  avatar  avatar  avatar  avatar  avatar  avatar  avatar  avatar  avatar  avatar

Watchers

 avatar  avatar  avatar

ds-algo-handbook's Issues

Add AVL Trees in various languages

The following Data Structure needs to be implemented in the following languages.

  • C
  • C++
  • Python
  • Java

Ground rules:

  1. Whoever claims the Issue first, should send a Pull Request within 24 hours else it'll be assigned to another claimant and further Pull Requests regarding that issue will not be entertained.
  2. Pull Requests sent without claiming and referencing the Issue will not be entertained.
  3. Make sure your Pull Requests have just one commit in them. Squash multiple commits into one if you have to.
  4. Make sure you put in the proper folder. If you do not know where to push the code for the Data Structures, feel free to ask in the comments section below. ๐Ÿ˜„

Add Doubly Linked List in the following languages

The following Data Structure needs to be implemented in the following languages.

  • C
  • C++
  • Python
  • Java

Ground rules:

  1. Whoever claims the Issue first, should send a Pull Request within 24 hours else it'll be assigned to another claimant and further Pull Requests regarding that issue will not be entertained.
  2. Pull Requests sent without claiming and referencing the Issue will not be entertained.
  3. Make sure your Pull Requests have just one commit in them. Squash multiple commits into one if you have to.
  4. Make sure you put in the proper folder. If you do not know where to push the code for the Data Structures, feel free to ask in the comments section below. ๐Ÿ˜„

Java Implementation of Data Structures

Ground rules:

  1. Whoever claims the Issue first, should send a Pull Request within 24 hours else it'll be assigned to another claimant and further Pull Requests regarding that issue will not be entertained.
  2. Pull Requests sent without claiming and referencing the Issue will not be entertained.
  3. Make sure your Pull Requests have just one commit in them. Squash multiple commits into one if you have to.

Kindly claim for the following Data Structures:

  1. Stacks
  2. Queues
  3. Trees
  4. Linked Lists
  5. Graphs
  6. Hash

Suggestions to make a Better Resource

Hi @salman-bhai
I have some suggestions to improve the reach and usefulness of this repository as this concept is extremely supportive for competitive programmers and is helpful resource for ACM ICPC aspirants, but due to its name, many aspirants might not find this repository on first go.

I would like to suggest some names for the repository. Please rename the repository to something more relevant.
Suggestions:

  1. ACM-ICPC-Handbook
  2. DS-Algo-Handbook
  3. DS-Algo-Analysis-Manual
  4. Competitive-Programming-Handbook

I would also like to suggest removal of lab_assignments from the repository as it is very much irrelevant when talking about ACM-ICPC Handbooks, to make it more relevant you can Rename the folder as "Classical Problems", it would help in getting more contributions from the enthusiasts and ACM ICPC aspirants, where contributors can add up solutions for past year problems and popular classical problems of competitive programming.

Lastly, I would suggest keeping more algorithms and data structures as ACM ICPC preparation requires much more than basic ones. This link has list of many more resources that you can put up as issues to make this repository extremely useful.

I would like to hear what you have to say on these suggestions.

Cheers!

Add Tree Sort for the following languages

The following Algorithm needs to be implemented in the following languages.

  • C
  • C++
  • Python
  • Java

Ground rules:

  1. Whoever claims the Issue first, should send a Pull Request within 24 hours else it'll be assigned to another claimant and further Pull Requests regarding that issue will not be entertained.
  2. Pull Requests sent without claiming and referencing the Issue will not be entertained.
  3. Make sure your Pull Requests have just one commit in them. Squash multiple commits into one if you have to.
  4. Make sure you put in the proper folder. If you do not know where to push the code for the Algorithm, feel free to ask in the comments section below. ๐Ÿ˜„

Add Depth-First-Search in the following languages

The following Algorithm needs to be implemented in the following languages.

  • C
  • C++
  • Python
  • Java

Ground rules:

  1. Whoever claims the Issue first, should send a Pull Request within 24 hours else it'll be assigned to another claimant and further Pull Requests regarding that issue will not be entertained.
  2. Pull Requests sent without claiming and referencing the Issue will not be entertained.
  3. Make sure your Pull Requests have just one commit in them. Squash multiple commits into one if you have to.
  4. Make sure you put in the proper folder. If you do not know where to push the code for the Algorithm, feel free to ask in the comments section below. ๐Ÿ˜„

Add Topological Sort for the following languages

The following Algorithm needs to be implemented in the following languages.

  • C
  • C++
  • Python
  • Java

Ground rules:

  1. Whoever claims the Issue first, should send a Pull Request within 24 hours else it'll be assigned to another claimant and further Pull Requests regarding that issue will not be entertained.
  2. Pull Requests sent without claiming and referencing the Issue will not be entertained.
  3. Make sure your Pull Requests have just one commit in them. Squash multiple commits into one if you have to.
  4. Make sure you put in the proper folder. If you do not know where to push the code for the Algorithm, feel free to ask in the comments section below. ๐Ÿ˜„

Add README for Search Algorithms

Hey! Looks like you're on your way to your First Pull Request. You don't even need to write a single line of code for this!

Welcome to the Hacktoberfest! ๐Ÿ˜„ This is a First-Timer Issue to increase your confidence in the field of Open-Source. All you have to do is send a Pull Request (Click here to see how to send a Pull Request).

All you have to do is explain the Data Structure and an appropriate explanation for the same. Just make sure you explain the concepts in the respective Data Structure

  • Linear Search
  • Binary Search

Ground rules:

  1. Whoever claims the Issue first, should send a Pull Request within 24 hours else it'll be assigned to another claimant and further Pull Requests regarding that issue will not be entertained.
  2. Pull Requests sent without claiming and referencing the Issue will not be entertained.
  3. Make sure your Pull Requests have just one commit in them. Squash multiple commits into one if you have to.
  4. Make sure you put in the proper folder. If you do not know where to push the code for the Data Structures, feel free to ask in the comments section below. ๐Ÿ˜„
  5. Kindly claim one Search Algorithm before moving to another!

Add Dijkstra's Algorithm in the following Languages

The following Algorithm needs to be implemented in the following languages.

  • C
  • C++
  • Python
  • Java

Ground rules:

  1. Whoever claims the Issue first, should send a Pull Request within 24 hours else it'll be assigned to another claimant and further Pull Requests regarding that issue will not be entertained.
  2. Pull Requests sent without claiming and referencing the Issue will not be entertained.
  3. Make sure your Pull Requests have just one commit in them. Squash multiple commits into one if you have to.
  4. Make sure you put in the proper folder. If you do not know where to push the code for the Algorithm, feel free to ask in the comments section below. ๐Ÿ˜„

Add Binary Search Trees in various languages

The following Data Structure needs to be implemented in the following languages.

  • C
  • C++
  • Python
  • Java

Ground rules:

  1. Whoever claims the Issue first, should send a Pull Request within 24 hours else it'll be assigned to another claimant and further Pull Requests regarding that issue will not be entertained.
  2. Pull Requests sent without claiming and referencing the Issue will not be entertained.
  3. Make sure your Pull Requests have just one commit in them. Squash multiple commits into one if you have to.
  4. Make sure you put in the proper folder. If you do not know where to push the code for the Data Structures, feel free to ask in the comments section below. ๐Ÿ˜„

Add Prim's Algorithm in the following languages

The following Algorithm needs to be implemented in the following languages.

  • C
  • C++
  • Python
  • Java

Ground rules:

  1. Whoever claims the Issue first, should send a Pull Request within 24 hours else it'll be assigned to another claimant and further Pull Requests regarding that issue will not be entertained.
  2. Pull Requests sent without claiming and referencing the Issue will not be entertained.
  3. Make sure your Pull Requests have just one commit in them. Squash multiple commits into one if you have to.
  4. Make sure you put in the proper folder. If you do not know where to push the code for the Algorithm, feel free to ask in the comments section below. ๐Ÿ˜„

Add Quick Sort for the following Languages

The following Algorithm needs to be implemented in the following languages.

  • C
  • C++
  • Python
  • Java

Ground rules:

  1. Whoever claims the Issue first, should send a Pull Request within 24 hours else it'll be assigned to another claimant and further Pull Requests regarding that issue will not be entertained.
  2. Pull Requests sent without claiming and referencing the Issue will not be entertained.
  3. Make sure your Pull Requests have just one commit in them. Squash multiple commits into one if you have to.
  4. Make sure you put in the proper folder. If you do not know where to push the code for the Algorithm, feel free to ask in the comments section below. ๐Ÿ˜„

Add README for Sorting Algorithms

Hey! Looks like you're on your way to your First Pull Request. You don't even need to write a single line of code for this!

Welcome to the Hacktoberfest! ๐Ÿ˜„ This is a First-Timer Issue to increase your confidence in the field of Open-Source. All you have to do is send a Pull Request (Click here to see how to send a Pull Request).

All you have to do is explain the Sorting Algorithms and an appropriate explanation for the same. Just make sure you explain the concepts in the respective Sorting Algorithms.

  • Bubble Sort
  • Bucket Sort
  • Heap Sort
  • Insertion Sort
  • Merge Sort
  • Quick Sort
  • Radix Sort
  • Selection Sort
  • Shell Sort
  • Topological Sort
  • Tree Sort

Ground rules:

  1. Whoever claims the Issue first, should send a Pull Request within 24 hours else it'll be assigned to another claimant and further Pull Requests regarding that issue will not be entertained.
  2. Pull Requests sent without claiming and referencing the Issue will not be entertained.
  3. Make sure your Pull Requests have just one commit in them. Squash multiple commits into one if you have to.
  4. Make sure you put in the proper folder. If you do not know where to push the code for the Data Structures, feel free to ask in the comments section below. ๐Ÿ˜„
  5. Kindly claim one Sorting Algorithm before moving to another!

Array not sorted in binary_search.cpp

Ground rules:

  1. Whoever claims the Issue first, should send a Pull Request within 24 hours else it'll be assigned to another claimant and further Pull Requests regarding that issue will not be entertained.
  2. Pull Requests sent without claiming and referencing the Issue will not be entertained.
  3. Make sure your Pull Requests have just one commit in them. Squash multiple commits into one if you have to.

Check out this link to understand better.

The array is not sorted in binary-search.cpp

Add README for Data Structures

Hey! Looks like you're on your way to your First Pull Request. You don't even need to write a single line of code for this!

Welcome to the Hacktoberfest! ๐Ÿ˜„ This is a First-Timer Issue to increase your confidence in the field of Open-Source. All you have to do is send a Pull Request (Click here to see how to send a Pull Request).

All you have to do is explain the Data Structure and an appropriate explanation for the same. Just make sure you explain the concepts in the respective Data Structure

  • Disjoint Sets
  • Hashing
  • Singly Linked List
  • Doubly Linked List
  • Circular Linked List
  • Queues
  • Stacks
  • Binary Search Trees
  • AVL Trees
  • Binary Trees
  • Tries

Ground rules:

  1. Whoever claims the Issue first, should send a Pull Request within 24 hours else it'll be assigned to another claimant and further Pull Requests regarding that issue will not be entertained.
  2. Pull Requests sent without claiming and referencing the Issue will not be entertained.
  3. Make sure your Pull Requests have just one commit in them. Squash multiple commits into one if you have to.
  4. Make sure you put in the proper folder. If you do not know where to push the code for the Data Structures, feel free to ask in the comments section below. ๐Ÿ˜„
  5. Kindly claim one Data Structure before moving to another!

Add Singly Linked List in the following languages

The following Data Structure needs to be implemented in the following languages.

  • C
  • C++
  • Python
  • Java

Ground rules:

  1. Whoever claims the Issue first, should send a Pull Request within 24 hours else it'll be assigned to another claimant and further Pull Requests regarding that issue will not be entertained.
  2. Pull Requests sent without claiming and referencing the Issue will not be entertained.
  3. Make sure your Pull Requests have just one commit in them. Squash multiple commits into one if you have to.
  4. Make sure you put in the proper folder. If you do not know where to push the code for the Data Structures, feel free to ask in the comments section below. ๐Ÿ˜„

Add Insertion Sort for the following languages

The following Algorithm needs to be implemented in the following languages.

  • C
  • C++
  • Python
  • Java

Ground rules:

  1. Whoever claims the Issue first, should send a Pull Request within 24 hours else it'll be assigned to another claimant and further Pull Requests regarding that issue will not be entertained.
  2. Pull Requests sent without claiming and referencing the Issue will not be entertained.
  3. Make sure your Pull Requests have just one commit in them. Squash multiple commits into one if you have to.
  4. Make sure you put in the proper folder. If you do not know where to push the code for the Algorithm, feel free to ask in the comments section below. ๐Ÿ˜„

Python Implementation of Sorting Algorithms

Ground rules:

  1. Whoever claims the Issue first, should send a Pull Request within 24 hours else it'll be assigned to another claimant and further Pull Requests regarding that issue will not be entertained.
  2. Pull Requests sent without claiming and referencing the Issue will not be entertained.
  3. Make sure your Pull Requests have just one commit in them. Squash multiple commits into one if you have to.

Kindly claim for the following Sorting Algorithms:

  1. Selection Sort
  2. Bubble Sort
  3. Merge Sort
  4. Quick Sort
  5. Shell Sort
  6. Topological Sort

Add Tries Data Structure in the following languages

The following Data Structure needs to be implemented in the following languages.

  • C
  • C++
  • Python
  • Java

Ground rules:

  1. Whoever claims the Issue first, should send a Pull Request within 24 hours else it'll be assigned to another claimant and further Pull Requests regarding that issue will not be entertained.
  2. Pull Requests sent without claiming and referencing the Issue will not be entertained.
  3. Make sure your Pull Requests have just one commit in them. Squash multiple commits into one if you have to.
  4. Make sure you put in the proper folder. If you do not know where to push the code for the Data Structures, feel free to ask in the comments section below. ๐Ÿ˜„

C Implementation of Search Algorithms

Ground rules:

  1. Whoever claims the Issue first, should send a Pull Request within 24 hours else it'll be assigned to another claimant and further Pull Requests regarding that issue will not be entertained.
  2. Pull Requests sent without claiming and referencing the Issue will not be entertained.
  3. Make sure your Pull Requests have just one commit in them. Squash multiple commits into one if you have to.

Kindly claim for the following Search Algorithms:

  1. Linear Search
  2. Binary Search

Add Floyd-Warshall's Algorithm in the following languages

The following Algorithm needs to be implemented in the following languages.

  • C
  • C++
  • Python
  • Java

Ground rules:

  1. Whoever claims the Issue first, should send a Pull Request within 24 hours else it'll be assigned to another claimant and further Pull Requests regarding that issue will not be entertained.
  2. Pull Requests sent without claiming and referencing the Issue will not be entertained.
  3. Make sure your Pull Requests have just one commit in them. Squash multiple commits into one if you have to.
  4. Make sure you put in the proper folder. If you do not know where to push the code for the Algorithm, feel free to ask in the comments section below. ๐Ÿ˜„

Add Binary Trees in the following languages

The following Data Structure needs to be implemented in the following languages.

  • C
  • C++
  • Python
  • Java

Ground rules:

  1. Whoever claims the Issue first, should send a Pull Request within 24 hours else it'll be assigned to another claimant and further Pull Requests regarding that issue will not be entertained.
  2. Pull Requests sent without claiming and referencing the Issue will not be entertained.
  3. Make sure your Pull Requests have just one commit in them. Squash multiple commits into one if you have to.
  4. Make sure you put in the proper folder. If you do not know where to push the code for the Data Structures, feel free to ask in the comments section below. ๐Ÿ˜„

Java Implementation of Search Algorithms

Ground rules:

  1. Whoever claims the Issue first, should send a Pull Request within 24 hours else it'll be assigned to another claimant and further Pull Requests regarding that issue will not be entertained.
  2. Pull Requests sent without claiming and referencing the Issue will not be entertained.
  3. Make sure your Pull Requests have just one commit in them. Squash multiple commits into one if you have to.

Kindly claim for the following Search Algorithms:

  1. Linear Search
  2. Binary Search

Add README for Graph Algorithms

Hey! Looks like you're on your way to your First Pull Request. You don't even need to write a single line of code for this!

Welcome to the Hacktoberfest! ๐Ÿ˜„ This is a First-Timer Issue to increase your confidence in the field of Open-Source. All you have to do is send a Pull Request (Click here to see how to send a Pull Request).

All you have to do is explain the Graph Algorithm and an appropriate explanation for the same. Just make sure you explain the concepts in the respective Graph Algorithm!

  • BFS
  • DFS
  • Dijkstra's Algorithm
  • Prim's Algorithm MST
  • Kruskal's Algorithm MST
  • Floyd Warshall's Algorithm
  • Bellman Ford's Algorithm

Ground rules:

  1. Whoever claims the Issue first, should send a Pull Request within 24 hours else it'll be assigned to another claimant and further Pull Requests regarding that issue will not be entertained.
  2. Pull Requests sent without claiming and referencing the Issue will not be entertained.
  3. Make sure your Pull Requests have just one commit in them. Squash multiple commits into one if you have to.
  4. Make sure you put in the proper folder. If you do not know where to push the code for the Data Structures, feel free to ask in the comments section below. ๐Ÿ˜„
  5. Kindly claim one Graph Algorithm before moving to another!

Add Disjoint Sets for the following languages

The following Data Structure needs to be implemented in the following languages.

  • C
  • C++
  • Python
  • Java

Ground rules:

  1. Whoever claims the Issue first, should send a Pull Request within 24 hours else it'll be assigned to another claimant and further Pull Requests regarding that issue will not be entertained.
  2. Pull Requests sent without claiming and referencing the Issue will not be entertained.
  3. Make sure your Pull Requests have just one commit in them. Squash multiple commits into one if you have to.
  4. Make sure you put in the proper folder. If you do not know where to push the code for the Data Structures, feel free to ask in the comments section below. ๐Ÿ˜„

Add Kruskal's Algorithm in the following language

The following Algorithm needs to be implemented in the following languages.

  • C
  • C++
  • Python
  • Java

Ground rules:

  1. Whoever claims the Issue first, should send a Pull Request within 24 hours else it'll be assigned to another claimant and further Pull Requests regarding that issue will not be entertained.
  2. Pull Requests sent without claiming and referencing the Issue will not be entertained.
  3. Make sure your Pull Requests have just one commit in them. Squash multiple commits into one if you have to.
  4. Make sure you put in the proper folder. If you do not know where to push the code for the Algorithm, feel free to ask in the comments section below. ๐Ÿ˜„

Add Bellman Ford ALgorithm for the following Languages

The following Algorithm needs to be implemented in the following languages.

  • C
  • C++
  • Python
  • Java

Ground rules:

  1. Whoever claims the Issue first, should send a Pull Request within 24 hours else it'll be assigned to another claimant and further Pull Requests regarding that issue will not be entertained.
  2. Pull Requests sent without claiming and referencing the Issue will not be entertained.
  3. Make sure your Pull Requests have just one commit in them. Squash multiple commits into one if you have to.
  4. Make sure you put in the proper folder. If you do not know where to push the code for the Algorithm, feel free to ask in the comments section below. ๐Ÿ˜„

Add Radix Sort for the following Languages

The following Algorithm needs to be implemented in the following languages.

  • C
  • C++
  • Python
  • Java

Ground rules:

  1. Whoever claims the Issue first, should send a Pull Request within 24 hours else it'll be assigned to another claimant and further Pull Requests regarding that issue will not be entertained.
  2. Pull Requests sent without claiming and referencing the Issue will not be entertained.
  3. Make sure your Pull Requests have just one commit in them. Squash multiple commits into one if you have to.
  4. Make sure you put in the proper folder. If you do not know where to push the code for the Algorithm, feel free to ask in the comments section below. ๐Ÿ˜„

Add unit tests for the Data Structures and algorithms

Hi @salman-bhai, I think it would be important to have unit tests for each of the data structure and algorithm implementations.

This would help improve the quality of the implementations since it would ensure the implementations actually work in the respective languages.

Add Shell-Sort for the following languages

The following Algorithm needs to be implemented in the following languages.

  • C
  • C++
  • Python
  • Java

Ground rules:

  1. Whoever claims the Issue first, should send a Pull Request within 24 hours else it'll be assigned to another claimant and further Pull Requests regarding that issue will not be entertained.
  2. Pull Requests sent without claiming and referencing the Issue will not be entertained.
  3. Make sure your Pull Requests have just one commit in them. Squash multiple commits into one if you have to.
  4. Make sure you put in the proper folder. If you do not know where to push the code for the Algorithm, feel free to ask in the comments section below. ๐Ÿ˜„

Python Implementation of Search Algorithms

Ground rules:

  1. Whoever claims the Issue first, should send a Pull Request within 24 hours else it'll be assigned to another claimant and further Pull Requests regarding that issue will not be entertained.
  2. Pull Requests sent without claiming and referencing the Issue will not be entertained.
  3. Make sure your Pull Requests have just one commit in them. Squash multiple commits into one if you have to.

Kindly claim for the following Search Algorithms:

  1. Linear Search
  2. Binary Search

Java Implementation of Graph Algorithms

Ground rules:

  1. Whoever claims the Issue first, should send a Pull Request within 24 hours else it'll be assigned to another claimant and further Pull Requests regarding that issue will not be entertained.
  2. Pull Requests sent without claiming and referencing the Issue will not be entertained.
  3. Make sure your Pull Requests have just one commit in them. Squash multiple commits into one if you have to.

The following Algorithms need to be added:

  1. BFS
  2. DFS
  3. Kruskal's
  4. Prim's
  5. Dijkstra's
  6. Floyd-Warshall Algorithm

C implementation of Graph Algorithms

Ground rules:

  1. Whoever claims the Issue first, should send a Pull Request within 24 hours else it'll be assigned to another claimant and further Pull Requests regarding that issue will not be entertained.
  2. Pull Requests sent without claiming and referencing the Issue will not be entertained.
  3. Make sure your Pull Requests have just one commit in them. Squash multiple commits into one if you have to.

Check out this link to understand better.

The following Algorithms need to be added:

  1. BFS
  2. DFS
  3. Kruskal's
  4. Prim's
  5. Dijkstra's
  6. Floyd-Warshall Algorithm

Add Heap-Sort for the following languages

The following Algorithm needs to be implemented in the following languages.

  • C
  • C++
  • Python
  • Java

Ground rules:

  1. Whoever claims the Issue first, should send a Pull Request within 24 hours else it'll be assigned to another claimant and further Pull Requests regarding that issue will not be entertained.
  2. Pull Requests sent without claiming and referencing the Issue will not be entertained.
  3. Make sure your Pull Requests have just one commit in them. Squash multiple commits into one if you have to.
  4. Make sure you put in the proper folder. If you do not know where to push the code for the Algorithm, feel free to ask in the comments section below. ๐Ÿ˜„

Add Bucket-Sort for the following languages

The following Algorithm needs to be implemented in the following languages.

  • C
  • C++
  • Python
  • Java

Ground rules:

  1. Whoever claims the Issue first, should send a Pull Request within 24 hours else it'll be assigned to another claimant and further Pull Requests regarding that issue will not be entertained.
  2. Pull Requests sent without claiming and referencing the Issue will not be entertained.
  3. Make sure your Pull Requests have just one commit in them. Squash multiple commits into one if you have to.
  4. Make sure you put in the proper folder. If you do not know where to push the code for the Algorithm, feel free to ask in the comments section below. ๐Ÿ˜„

Add Bubble-Sort for the following languages

The following Algorithm needs to be implemented in the following languages.

  • C
  • C++
  • Python
  • Java

Ground rules:

  1. Whoever claims the Issue first, should send a Pull Request within 24 hours else it'll be assigned to another claimant and further Pull Requests regarding that issue will not be entertained.
  2. Pull Requests sent without claiming and referencing the Issue will not be entertained.
  3. Make sure your Pull Requests have just one commit in them. Squash multiple commits into one if you have to.
  4. Make sure you put in the proper folder. If you do not know where to push the code for the Algorithm, feel free to ask in the comments section below. ๐Ÿ˜„

Java Implementation of Sorting Algorithms

Ground rules:

  1. Whoever claims the Issue first, should send a Pull Request within 24 hours else it'll be assigned to another claimant and further Pull Requests regarding that issue will not be entertained.
  2. Pull Requests sent without claiming and referencing the Issue will not be entertained.
  3. Make sure your Pull Requests have just one commit in them. Squash multiple commits into one if you have to.

Kindly claim for the following Sorting Algorithms:

  1. Selection Sort
  2. Bubble Sort
  3. Merge Sort
  4. Quick Sort
  5. Shell Sort
  6. Topological Sort

Add Circular Linked List for various languages

The following Data Structure needs to be implemented in the following languages.

  • C
  • C++
  • Python
  • Java

Ground rules:

  1. Whoever claims the Issue first, should send a Pull Request within 24 hours else it'll be assigned to another claimant and further Pull Requests regarding that issue will not be entertained.
  2. Pull Requests sent without claiming and referencing the Issue will not be entertained.
  3. Make sure your Pull Requests have just one commit in them. Squash multiple commits into one if you have to.
  4. Make sure you put in the proper folder. If you do not know where to push the code for the Data Structures, feel free to ask in the comments section below. ๐Ÿ˜„

Python Implementation of Data Structures

Ground rules:

  1. Whoever claims the Issue first, should send a Pull Request within 24 hours else it'll be assigned to another claimant and further Pull Requests regarding that issue will not be entertained.
  2. Pull Requests sent without claiming and referencing the Issue will not be entertained.
  3. Make sure your Pull Requests have just one commit in them. Squash multiple commits into one if you have to.

Kindly claim for the following Data Structures:

  1. Stacks
  2. Queues
  3. Trees
  4. Linked Lists
  5. Graphs
  6. Hash

Python implementation of Graph Algorithms

Ground rules:

  1. Whoever claims the Issue first, should send a Pull Request within 24 hours else it'll be assigned to another claimant and further Pull Requests regarding that issue will not be entertained.
  2. Pull Requests sent without claiming and referencing the Issue will not be entertained.
  3. Make sure your Pull Requests have just one commit in them. Squash multiple commits into one if you have to.

The following Algorithms need to be added:

  1. BFS
  2. DFS
  3. Kruskal's
  4. Prim's
  5. Dijkstra's
  6. Floyd-Warshall Algorithm

Add Merge Sort for the following Algorithms

The following Algorithm needs to be implemented in the following languages.

  • C
  • C++
  • Python
  • Java

Ground rules:

  1. Whoever claims the Issue first, should send a Pull Request within 24 hours else it'll be assigned to another claimant and further Pull Requests regarding that issue will not be entertained.
  2. Pull Requests sent without claiming and referencing the Issue will not be entertained.
  3. Make sure your Pull Requests have just one commit in them. Squash multiple commits into one if you have to.
  4. Make sure you put in the proper folder. If you do not know where to push the code for the Algorithm, feel free to ask in the comments section below. ๐Ÿ˜„

Add Selection-Sort for the following languages

The following Algorithm needs to be implemented in the following languages.

  • C
  • C++
  • Python
  • Java

Ground rules:

  1. Whoever claims the Issue first, should send a Pull Request within 24 hours else it'll be assigned to another claimant and further Pull Requests regarding that issue will not be entertained.
  2. Pull Requests sent without claiming and referencing the Issue will not be entertained.
  3. Make sure your Pull Requests have just one commit in them. Squash multiple commits into one if you have to.
  4. Make sure you put in the proper folder. If you do not know where to push the code for the Algorithm, feel free to ask in the comments section below. ๐Ÿ˜„

Add Breadth-First-Search in the following languages

The following Algorithm needs to be implemented in the following languages.

  • C
  • C++
  • Python
  • Java

Ground rules:

  1. Whoever claims the Issue first, should send a Pull Request within 24 hours else it'll be assigned to another claimant and further Pull Requests regarding that issue will not be entertained.
  2. Pull Requests sent without claiming and referencing the Issue will not be entertained.
  3. Make sure your Pull Requests have just one commit in them. Squash multiple commits into one if you have to.
  4. Make sure you put in the proper folder. If you do not know where to push the code for the Algorithm, feel free to ask in the comments section below. ๐Ÿ˜„

Recommend Projects

  • React photo React

    A declarative, efficient, and flexible JavaScript library for building user interfaces.

  • Vue.js photo Vue.js

    ๐Ÿ–– Vue.js is a progressive, incrementally-adoptable JavaScript framework for building UI on the web.

  • Typescript photo Typescript

    TypeScript is a superset of JavaScript that compiles to clean JavaScript output.

  • TensorFlow photo TensorFlow

    An Open Source Machine Learning Framework for Everyone

  • Django photo Django

    The Web framework for perfectionists with deadlines.

  • D3 photo D3

    Bring data to life with SVG, Canvas and HTML. ๐Ÿ“Š๐Ÿ“ˆ๐ŸŽ‰

Recommend Topics

  • javascript

    JavaScript (JS) is a lightweight interpreted programming language with first-class functions.

  • web

    Some thing interesting about web. New door for the world.

  • server

    A server is a program made to process requests and deliver data to clients.

  • Machine learning

    Machine learning is a way of modeling and interpreting data that allows a piece of software to respond intelligently.

  • Game

    Some thing interesting about game, make everyone happy.

Recommend Org

  • Facebook photo Facebook

    We are working to build community through open source technology. NB: members must have two-factor auth.

  • Microsoft photo Microsoft

    Open source projects and samples from Microsoft.

  • Google photo Google

    Google โค๏ธ Open Source for everyone.

  • D3 photo D3

    Data-Driven Documents codes.