ekdnam / algorithms Goto Github PK

In the graph theory directory, add the Depth First Search Algorithm.

Bubble sort is an algorithm used to efficiently arrange the different objects of an array in a specific order.

The working branch should be python

The branch can be found here

The changes should be in /Sorting/Insertion Sort

The file should be named InsertionSort.py

Happy Open-Sourcing!

Linear search is an algorithm which is used to efficiently search an array of objects.

Add the documentation for the algorithm.

It should be in /Searching/Linear Search/README.md

Happy Open-Sourcing!

For your reference: Wikipedia

Add the C++ version of A Star algorithm for Graph Traversal.

The code should be in /Graph Theory/A Star

For further reference: Wikipedia

Bellman Ford Algorithm

• Used to find the shortest path to all other vertex from the source.

• It works for both positive and negative weight edges.

• Time Complexity: O(VE)

I would like to add this to your repo.

Is your feature request related to a problem? Please describe.

• Topological sorting for Directed Acyclic Graph (DAG) is a linear ordering of vertices such that for every directed edge u v, vertex u comes before v in the ordering.

Additional context

• For more refer : https://www.geeksforgeeks.org/topological-sorting/

Add the C++ version of Dijkstra Algorithm.

The code should be in /Graph Theory/Dijkstra Algorithm

For further reference: Brilliant

A Star is a graph traversal algorithm. Do enhance the repo by the python version of A Star!

The working branch should be python

The branch can be found here

The changes should be in /Graph Theory/A Star

The file should be named AStar.py

Happy Open-Sourcing!

Dijkstra's Algorithm is used for finding the path between two nodes in a graph. Do enhance the repo by adding documentation for it!

The changes should be in /Graph Theory/Dijkstra Algorithm/README.md

Bubble sort is an algorithm used to efficiently arrange the different objects of an array in a specific order.

The working branch should be c

The branch can be found here

The changes should be in /Sorting/Insertion Sort

The file should be named bubbleSort.c

Happy Open-Sourcing!

Bucket sort is an algorithm that works by distributing array elements in what are known as buckets!

The docs should be in /Sorting/Bucket Sort/README.md

Happy Open-Sourcing!

For your reference: (Wikipedia)[https://en.wikipedia.org/wiki/Bucket_sort]

Insertion sort is an algorithm used to efficiently arrange the different objects of an array in a specific order.

The working branch should be c

The branch can be found here

The changes should be in /Sorting/Insertion Sort

The file should be named insertionSort.c

Happy Open-Sourcing!

Depth First Search is a graph traversal algorithm. Do enhance the repo by the python version of DFS!

The working branch should be python

The branch can be found here

The changes should be in /Graph Theory/DFS

The file should be named DFS.py

Happy Open-Sourcing!

Fibonacci search is an algorithm which is used to efficiently search an array of objects.

Add the documentation for the algorithm.

It should be in /Searching/Fibonacci Search/README.md

Happy Open-Sourcing!

For your reference: Wikipedia

Linear search is an algorithm which is used to search in an array of objects.

Add the code for it. It should be in Searching/Linear Search

Happy Open-Sourcing!

For your reference: Wikipedia

Fibonacci Search is an algorithm used to efficiently find an element in array of objects.

The working branch should be c

The branch can be found here

The changes should be in /Searching/Fibonacci Search

The file should be named fibonacciSearch.c

Happy Open-Sourcing!

Selection sort is an algorithm used to efficiently arrange the different objects of an array in a specific order.

The working branch should be c

The branch can be found here

The changes should be in /Sorting/Selection Sort

The file should be named selectionSort.c

Happy Open-Sourcing!

Binary Search is an algorithm used to efficiently find an element in array of objects.

The working branch should be c

The branch can be found here

The changes should be in /Searching/Binary Search

The file should be named binarySearch.c

Happy Open-Sourcing!

I would like to add this to your repo.

Bucket sort is an algorithm that works by distributing array elements in what are known as buckets!

Add the C++ version of Bucket Sort!

The code should be in /Sorting/Bucket Sort

Happy Open-Sourcing!

For your referene: Bucket Sort

A Star is a graph traversal algorithm. Do enhance the repo by adding information about A Star!

The changes should be in /Graph Theory/A Star/README.md

Binary Search is an algorithm used to quickly search an array of objects. Do enhance the repo by the python version of Binary Search!

The working branch should be python

The branch can be found here

The changes should be in /Searching/Binary Search

The file should be named BinarySearch.py

Happy Open-Sourcing!

Quicksort is an algorithm used to efficiently arrange the different objects of an array in a specific order.

The working branch should be c

The branch can be found here

The changes should be in /Sorting/Quicksort

The file should be named quicksort.c

Happy Open-Sourcing!

Bellman Ford is a graph traversal algorithm. Do enhance the repo by the python version of Bellman Ford!

The working branch should be python

The branch can be found here

The changes should be in /Graph Theory/Bellman Ford

The file should be named BellmanFord.py

Happy Open-Sourcing!

Dijkstra is a graph traversal algorithm. Do enhance the repo by the python version of Dijkstra!

The working branch should be python

The branch can be found here

The changes should be in /Graph Theory/Dijkstra

The file should be named Dijkstra.py

Happy Open-Sourcing!

Merge sort is an algorithm used to efficiently arrange the different objects of an array in a specific order.

The working branch should be c

The branch can be found here

The changes should be in /Sorting/Merge Sort

The file should be named mergeSort.c

Happy Open-Sourcing!

Linear Search is an algorithm used to efficiently find an element in array of objects.

The working branch should be c

The branch can be found here

The changes should be in /Searching/Linear Search

The file should be named linearSearch.c

Happy Open-Sourcing!

Add the C++ version of Fibonacci Search!

The code should be in /Searching/Fibonacci Search

Best of luck for your Open Source Journey!

In the graph theory directory, add a BFS graph traversal algorithm.