ekdnam / algorithms Goto Github PK
View Code? Open in Web Editor NEW(Currenly busy, can't look at PRs) An attempt to aggregate all the various algorithms used in CS.
License: Apache License 2.0
(Currenly busy, can't look at PRs) An attempt to aggregate all the various algorithms used in CS.
License: Apache License 2.0
Add the C++ version of A Star algorithm for Graph Traversal.
The code should be in /Graph Theory/A Star
For further reference: Wikipedia
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
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!
In the graph theory directory, add a BFS graph traversal algorithm.
I would like to add this to your repo.
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!
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
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!
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!
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!
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!
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 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
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.
Additional context
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]
Add the C++ version of Dijkstra Algorithm.
The code should be in /Graph Theory/Dijkstra Algorithm
For further reference: Brilliant
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 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!
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 the Depth First Search Algorithm.
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!
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!
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!
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!
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!
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!
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!
A declarative, efficient, and flexible JavaScript library for building user interfaces.
๐ Vue.js is a progressive, incrementally-adoptable JavaScript framework for building UI on the web.
TypeScript is a superset of JavaScript that compiles to clean JavaScript output.
An Open Source Machine Learning Framework for Everyone
The Web framework for perfectionists with deadlines.
A PHP framework for web artisans
Bring data to life with SVG, Canvas and HTML. ๐๐๐
JavaScript (JS) is a lightweight interpreted programming language with first-class functions.
Some thing interesting about web. New door for the world.
A server is a program made to process requests and deliver data to clients.
Machine learning is a way of modeling and interpreting data that allows a piece of software to respond intelligently.
Some thing interesting about visualization, use data art
Some thing interesting about game, make everyone happy.
We are working to build community through open source technology. NB: members must have two-factor auth.
Open source projects and samples from Microsoft.
Google โค๏ธ Open Source for everyone.
Alibaba Open Source for everyone
Data-Driven Documents codes.
China tencent open source team.