Merge pull request #76 from simarpreetsingh-019/master

Updated Readme.md

README.md

@@ -1,4 +1,4 @@
-# algorithmsUse
+# AlgorithmsUse
 
 Common Algorithms which are usually taught in Data Structures and Algorithms courses.
 
@@ -20,8 +20,17 @@ For info about more repos to contribute to, check out the below post:
 
 https://cppsecrets.com/users/5617971101051071011161151049711410997484852494964103109971051084699111109/Open-Source-and-Hacktoberfest.php
 
-# Current Algorithms
+# Current Algorithms  
+## Table of Contents
 
+- [C++](#C++)
+- [Python](#Python)
+- [Java](#Java)
+- [JavaScript](#Javascript)
+- [Go](#Go)
+- [Swift](#Swift)
+
+<a name="C++"></a>
 ## C++
 
 - Factorial Algorithm
@@ -35,20 +44,140 @@ https://cppsecrets.com/users/561797110105107101116115104971141099748485249496410
 - Round Robin Scheduling Algorithm
 - Radix Sort
 
+<a name="Java"></a>
 ## Java
 
+<a name="Javascript"></a>
+## JavaScript
+<h1 align="center">JavaScript</h1> <br>
+
+<p align="center"><image src="https://external-content.duckduckgo.com/iu/?u=https%3A%2F%2Ftse1.mm.bing.net%2Fth%3Fid%3DOIP.Dk_c6Kwi4JaIxYDlvE3NfQHaHa%26pid%3DApi&f=1" width ="280" height="280"></image></p>
+
+### Table of Contents
+
+- [Sorting](#sorting)
+- [Unit Tests](#unit-tests)
+
+<a name="searching"></a>
+
+<a name="sorting"></a>
+
+### Sorting
+
+- [QuickSort](https://github.com/aniketsharma00411/algorithmsUse/blob/master/JavaScript/sorting/QuickSort.js)
+
+<a name="unit-tests"></a>
+
+### Unit Tests
+
+--
+
+<a name="Python"></a>
 ## Python
+<h1 align="center">Python</h1> <br>
 
-- Dijkstras Algorithm
-- Euclid's Greatest Common Divisor Algorithm
-- Sieve Of Eratosthenes
-- Duplicating Zeros
-- Singly Linked List
-- Breadth First Search Algorithm
-- Hangman Game
-- Kadane Algorithm
+<p align="center"><image src="https://upload.wikimedia.org/wikipedia/commons/thumb/c/c3/Python-logo-notext.svg/1200px-Python-logo-notext.svg.png" width ="250" height="250"></image></p>
+
+### Table of Contents
+
+- [Graph Algorithms](#graph)
+- [Searching](#searching)
+- [Sorting](#sorting)
+- [Miscellaneous](#others)
+- [Unit Tests](#unit-tests)
+
+<a name="graph"></a>
+
+### Graph Algorithms
+
+- [Dijkstras](https://github.com/aniketsharma00411/algorithmsUse/blob/master/Python/Graph%20Algorithms/Dijkstras.py)  
+<a name="searching"></a>
+
+### Searching
+
+- [BinarySearch](https://github.com/aniketsharma00411/algorithmsUse/blob/master/Python/Searching/binarySearch.py)  
+
+<a name="sorting"></a>
+
+### Sorting
+
+- [BubbleSort](https://github.com/aniketsharma00411/algorithmsUse/blob/master/Python/Sorting/bubbleSort.py)  
+- [Selection sort](https://github.com/aniketsharma00411/algorithmsUse/blob/master/Python/Sorting/selection%20sort.py)
+
+<a name="others"></a>
+
+### Miscellaneous
+
+- [Fibonacci_rec](https://github.com/aniketsharma00411/algorithmsUse/blob/master/Python/Miscellaneous/Fibonacci_rec.py)  
+- [GreatestCommonDivisorEuclidean](https://github.com/aniketsharma00411/algorithmsUse/blob/master/Python/Miscellaneous/GreatestCommonDivisorEuclidean.py)  
+- [PrimeUptoN](https://github.com/aniketsharma00411/algorithmsUse/blob/master/Python/Miscellaneous/PrimeUptoN.py)  
+- [Duplicate_zeros](https://github.com/aniketsharma00411/algorithmsUse/blob/master/Python/Miscellaneous/duplicate_zeros.py)  
+- [Next_president](https://github.com/aniketsharma00411/algorithmsUse/blob/master/Python/Miscellaneous/next_president.py)  
+- [Singlelinkedlist](https://github.com/aniketsharma00411/algorithmsUse/blob/master/Python/Miscellaneous/singlelinkedlist.py)  
+<a name="unit-tests"></a>
 
+### Unit Tests
+
+- [Duplicate_zeros_test](https://github.com/aniketsharma00411/algorithmsUse/blob/master/Python/Unit%20Tests/duplicate_zeros_test.py)  
+- [Next_president_test](https://github.com/aniketsharma00411/algorithmsUse/blob/master/Python/Unit%20Tests/next_president_test.py)  
+
+<a name="Go"></a>
 ## Go
+<h1 align="center">Go</h1> <br>
+
+<p align="center"><image src="https://9to5google.com/wp-content/uploads/sites/4/2018/08/golang-header.jpg?quality=82&strip=all&w=1600" width ="474" height="250"></image></p>
+
+### Table of Contents
+
+- [Searching](#searching)  
+- [Sorting](#sorting)  
+- [Unit Tests](#unit-tests)  
+
+<a name="searching"></a>
+
+### Searching
+
+- [Binary_search](https://github.com/aniketsharma00411/algorithmsUse/blob/master/Go/Searching/binary_search.go)  
+
+<a name="sorting"></a>
+
+### Sorting
+
+- [Bubble_sort](https://github.com/aniketsharma00411/algorithmsUse/blob/master/Go/Sorting/bubble_sort.go)  
+- [Quicksort](https://github.com/aniketsharma00411/algorithmsUse/blob/master/Go/Sorting/quicksort.go)  
+
+<a name="unit-tests"></a>
+
+### Unit Tests
+
+--
+
+<a name="Swift"></a>
+## Swift
+<h1 align="center">Swift</h1> <br>
+
+<p align="center"><image src="https://miro.medium.com/max/560/1*ApTLY0LhnXAR1AHxWF-BWA.png" width ="400" height="300"></image></p>
+
+### Table of Contents
+
+- [Searching](#searching)  
+- [Sorting](#sorting)  
+- [Unit Tests](#unit-tests)  
+
+<a name="searching"></a>
+
+### Searching
+
+- [Binary_search](https://github.com/aniketsharma00411/algorithmsUse/blob/master/Swift/Searching/binary_search.swift)
+
+<a name="sorting"></a>
+
+### Sorting
+
+- [Selection_sort](https://github.com/aniketsharma00411/algorithmsUse/blob/master/Swift/Sorting/selection_sort.swift)
+
+<a name="unit-tests"></a>
+
+### Unit Tests
 
-- Binary Search
-- Bubble Sort
+--