文件列表:

Cryptography (0, 2020-10-04)
Cryptography\C++ (0, 2020-10-04)
Cryptography\C++\caesar_cipher.cpp (1037, 2020-10-04)
Cryptography\C++\playfair_cipher.cpp (3519, 2020-10-04)
Cryptography\Python (0, 2020-10-04)
Cryptography\Python\CaesarCipher.py (1195, 2020-10-04)
Data Structures (0, 2020-10-04)
Data Structures\C (0, 2020-10-04)
Data Structures\C\LinkedList.c (1618, 2020-10-04)
Data Structures\C\infixtopostfix.c (4860, 2020-10-04)
Data Structures\linked_list_complete.c (3379, 2020-10-04)
Dynamic Programming (0, 2020-10-04)
Dynamic Programming\C++ (0, 2020-10-04)
Dynamic Programming\C++\coin_change.cpp (982, 2020-10-04)
Dynamic Programming\C++\gridpath.cc (826, 2020-10-04)
Dynamic Programming\C++\longest_common_subsequence.cc (1369, 2020-10-04)
Dynamic Programming\C++\longest_increasing_subsequence.cpp (1156, 2020-10-04)
Dynamic Programming\C++\longestsubsequence.cc (1501, 2020-10-04)
Graph (0, 2020-10-04)
Graph\C++ (0, 2020-10-04)
Graph\C++\a.out (115776, 2020-10-04)
Graph\C++\dijkstras.cpp (1878, 2020-10-04)
Graph\C++\floyd-warshall.cpp (1131, 2020-10-04)
Graph\C++\graphadjacencylist.cc (762, 2020-10-04)
Graph\C++\graphadjacencymatrix.cc (915, 2020-10-04)
MCM.cpp (738, 2020-10-04)
Mcm.cpp (738, 2020-10-04)
Searching (0, 2020-10-04)
Searching\C (0, 2020-10-04)
Searching\C\binary_search_non_recursive.c (688, 2020-10-04)
Searching\C\binary_search_recursive.c (955, 2020-10-04)
Searching\C\linear_search_non_recursive.c (822, 2020-10-04)
Searching\C\linear_search_recursive.c (775, 2020-10-04)
Sorting (0, 2020-10-04)
Sorting\Assets (0, 2020-10-04)
... ...

# Lets implement some algorithms ## Table of Contents [1. For those who are new to open source](https://github.com/fossgect/All-Algos/blob/master/ #for-those-who-are-new-to-open-source ) [2. Algorithms you can implement](https://github.com/fossgect/All-Algos/blob/master/ #algorithms-you-can-implement ) ## For those who are new to open source Learning how to make the first step has always been the toughest in every journey. Let this be a good start for your open source contributions. In GitHub, you can save your code, update them, and work on it as a team. You can access GitHub from your desktop, by installing git on it. Follow these links to install git on your system. https://www.atlassian.com/git/tutorials/install-git For contributing to this repo, you should fork it first. Then it will be like contributing to your own repo. This copies the repository to your account. After that you should download the code to your system, so that you can edit it. This is done by: ```git clone https://github.com//Algorithms-Implementation``` Congratulations!!! You have successfully downloaded the code to your system. All the main changes to a repository is supposed to be in master branch. But whenever you fork a repo and update it, you should do it as a seperate branch of the repo, and then ask the maintainer to merge your updates to the master branch of the main repo. For creating a new branch and working on it, ```git checkout -b ``` _Your branch name can be anything_ Now you have created a new branch and started working on it. Open a text editor and edit your code now. ( Code editor can be anything like VS Code, Atom, etc.) After doing your updations, you should add all those changed files for saving. ```git add ``` But, you can add the changes simply by adding the current folder, like: ```git add .``` Then you should save all these changes locally to the git. ```git commit -m "``` Now upload the changes to the GitHub. ```git push origin ``` Congratulations!!! You have successfully uploaded all your changes to your forked repository. Now, for making these changes in the actual repository, you have to ask the maintainer for that. It is called raising a pull request. After pushing your changes, you can see a button as below, in your repo. Now add a message describing the changes you have made, and send the pull request. After verifying the changes the maintainer will either merge your pull request or cancel it. ## Algorithms you can implement _All the contributions should be in the respective folders_ _Any pull requests with copied codes will be considered as invalid._ ### Graph 1. Breadth First Search in Graphs (BFS) 2. Depth First Search in Graphs (DFS) 3. Kruskal's Algorithm for finding minimum spanning tree 4. Prim's Algorithm for finding minimum spanning tree 5. Travelling Salesman Problem ### Cryptography 1. Caesar's Cipher 2. Playfair Cipher ### Data Structures 1. Linked List 2. 2 stacks on a single array 3. 3 stacks on a single array 4. Infix to Postfix Conversion 5. Evaluation of Postfix expression ### Sorting 1. Bubble Sort 2. Merge Sort 3. Quick Sort 4. Heap Sort

近期下载者：

相关文件：

评论：[我要评论] [举报此文件]

收藏者：