c0d1ng / algorithms

Welcome to C0D1NG 💐

C0D1NG is an organization that helps everyone to contribute to open source.

List of Contributors 🚀

---

The GitHub Flow

~ CREATE A BRANCH

Create a branch in your project where you can safely experiment and make changes.

• Add commits in a new branch

~ OPEN A PULL REQUEST

Use a pull request to get feedback on your changes from people across the world.

• Discuss and review a pull request

~ MERGE AND DEPLOY

Merge your changes into your master branch and deploy your code.

---

If you are a beginner and want to start your open source journey then

👉 1. Fork this repository

👉 2. Clone on your system

👉 3. Create a Branch

👉 4. Add your name in Contributors.md

👉 5. Add & Commit changes

👉 6. Push changes to GitHub

👉 7. Compare & Submit Pull request

Hurray! Now you are a part of the open source community 🚀🚀🚀

---

Join our Community 👉🏻 C0D1NG

algorithms's Issues

Implement Quick Sort

Write a program to implement quick sort.

This issue is open for all, so everyone can work on this issue and every valid pull request will be merged.
Maximum number of people can work on this issue, there is no limitations.

File format 👉🏻 username_filename.extention

👨🏻‍💻 Happy Coding 👩🏻‍💻

Implement Josephus Problem

I would love to add solution to this problem.
Please add hacktoberfest and hard label.
Happy Hacking.

Tarjan's Algorithm for finding articulation points in a Graph.

A vertex in an undirected connected graph is an articulation point (or cut vertex) iff removing it (and edges through it) disconnects the graph. Articulation points represent vulnerabilities in a connected network – single points whose failure would split the network into 2 or more components. Tarjan's Algorithm helps in finding those articulation points in a network.

Demo PR, please ignore

Optimisation

Tenary Search in C++

I Want to Tenary Search in CPP. Please Assign

Breadth First Search (BFS)

Write a program to implement breadth first search in graphs.

This issue is open for all, so everyone can work on this issue and every valid pull request will be merged.
Maximum number of people can work on this issue, there is no limitations.

File format 👉🏻 username_filename.extention

👨🏻‍💻 Happy Coding 👩🏻‍💻

Knapsack problem using a top-down approach.

An implementation of the knapsack problem using a top-down approach in python.

Awesome Problems and Solution

if we add a folder for some good competitive coding problems or some very good problems asked in interviews also problems which helps to learn some nice concepts it would be helpful

Implement Bubble Sort

Write a program to implement bubble sort.

Maximum number of people can work on this issue there is no limits, make sure that the each filename should also contain your username to avoid merge conflicts and overriding.

File format 👉🏻 username_filename.extention

👨🏻‍💻 Happy Coding 👩🏻‍💻

Implment Hashing Algorithms.

I would love to add solution to this hashing problems.
Please add hacktoberfest and hard label.
Happy Hacking.

Implement Merge Sort

Write a program to implement merge sort.

This issue is open for all, so everyone can work on this issue and every valid pull request will be merged.
Maximum number of people can work on this issue, there is no limitations.

File format 👉🏻 username_filename.extention

👨🏻‍💻 Happy Coding 👩🏻‍💻

simple Calculator

Write Python Program to make a simple calculator for (+,-,*,/) operation

This issue is open for all, so everyone can work on this issue and every valid pull request will be merged.
Maximum number of people can work on this issue, there is no limitations.

Implement Selection Sort

Write a program to implement selection sort.

This issue is open for all, so everyone can work on this issue and every valid pull request will be merged.
Maximum number of people can work on this issue, there is no limitations.

File format 👉🏻 username_filename.extention

👨🏻‍💻 Happy Coding 👩🏻‍💻

Depth First Search (DFS)

Write a program to implement depth first search in graphs.

This issue is open for all, so everyone can work on this issue and every valid pull request will be merged.
Maximum number of people can work on this issue, there is no limitations.

File format 👉🏻 username_filename.extention

👨🏻‍💻 Happy Coding 👩🏻‍💻

Implement Insertion Sort

Write a program to implement insertion sort.

This issue is open for all, so everyone can work on this issue and every valid pull request will be merged.
Maximum number of people can work on this issue, there is no limitations.

File format 👉🏻 username_filename.extention

👨🏻‍💻 Happy Coding 👩🏻‍💻

Implement Binary Search

Write a program to implement binary search.

This issue is open for all, so everyone can work on this issue and every valid pull request will be merged.
Maximum number of people can work on this issue, there is no limitations.

File format 👉🏻 username_filename.extention

👨🏻‍💻 Happy Coding 👩🏻‍💻

Implement Linear Search

Write a program to implement linear search.

Maximum number of people can work on this issue there is no limits, make sure that the each filename should also contain your username to avoid merge conflicts and overriding.

File format 👉🏻 username_filename.extention

👨🏻‍💻 Happy Coding 👩🏻‍💻

Greatest Common Divisor (GCD)

Write a program to find the greatest common divisor of two numbers.

This issue is open for all, so everyone can work on this issue and every valid pull request will be merged.
Maximum number of people can work on this issue, there is no limitations.

File format 👉🏻 username_filename.extention

👨🏻‍💻 Happy Coding 👩🏻‍💻