From 0a92f50efd0caa9cd516b5fba10fc33c15ca1c93 Mon Sep 17 00:00:00 2001
From: Bhupendra Chauhan <54802156+Shinigami-Daikou@users.noreply.github.com>
Date: Thu, 1 Oct 2020 23:27:19 +0530
Subject: [PATCH 01/10] Create Selection_Sort.cpp

added selection sort in C++
---
 C++/Selection_Sort.cpp | 36 ++++++++++++++++++++++++++++++++++++
 1 file changed, 36 insertions(+)
 create mode 100644 C++/Selection_Sort.cpp

diff --git a/C++/Selection_Sort.cpp b/C++/Selection_Sort.cpp
new file mode 100644
index 0000000..5cacb0d
--- /dev/null
+++ b/C++/Selection_Sort.cpp
@@ -0,0 +1,36 @@
+#include<iostream>
+using namespace std;
+
+void selectionSort(int arr[], int size) {
+    int i, j, min;
+    for(i = 0 ; i < size -1 ; i++) {
+        min = i;
+        for(j = i + 1 ; j < size ; j++)
+            if(arr[j] < arr[min])
+                min = j;
+        int temp = arr[i];
+        arr[i] = arr[min];
+        arr[min] = temp;
+    }
+}
+int main() {
+    int n;
+    cout << "Enter the number of elements: ";
+    cin >> n;
+    int arr[n];
+    cout << "Enter elements:" << endl;
+    for(int i = 0 ; i < n ; i++) 
+        cin >> arr[i];
+        
+    cout << "Array before Sorting: ";
+    for(int i = 0 ; i < n ; i++)
+        cout << arr[i] << " ";
+    cout << endl;
+    
+    selectionSort(arr, n);
+    cout << "Array after Sorting: ";
+    for(int i = 0 ; i < n ; i++)
+        cout << arr[i] << " ";
+    cout << endl;
+    return 0;
+}

From d70519ce3252f2f3b10317c7c65e8afefa0542ff Mon Sep 17 00:00:00 2001
From: Bhupendra Chauhan <54802156+Shinigami-Daikou@users.noreply.github.com>
Date: Fri, 2 Oct 2020 22:53:40 +0530
Subject: [PATCH 02/10] Create Linear_Search.c

---
 C/Linear_Search.c | 31 +++++++++++++++++++++++++++++++
 1 file changed, 31 insertions(+)
 create mode 100644 C/Linear_Search.c

diff --git a/C/Linear_Search.c b/C/Linear_Search.c
new file mode 100644
index 0000000..3f9fb13
--- /dev/null
+++ b/C/Linear_Search.c
@@ -0,0 +1,31 @@
+
+#include <stdio.h>
+
+int main()
+{
+  int array[100], search, c, n;
+
+  printf("Enter number of elements in array\n");
+  scanf("%d", &n);
+
+  printf("Enter %d integer(s)\n", n);
+
+  for (c = 0; c < n; c++)
+    scanf("%d", &array[c]);
+
+  printf("Enter a number to search\n");
+  scanf("%d", &search);
+
+  for (c = 0; c < n; c++)
+  {
+    if (array[c] == search)    /* If required element is found */
+    {
+      printf("%d is present at location %d.\n", search, c+1);
+      break;
+    }
+  }
+  if (c == n)
+    printf("%d isn't present in the array.\n", search);
+
+  return 0;
+}

From 58017a5c035cd6782cfd16632fb0532adf529b26 Mon Sep 17 00:00:00 2001
From: Bhupendra Chauhan <54802156+Shinigami-Daikou@users.noreply.github.com>
Date: Fri, 2 Oct 2020 22:55:06 +0530
Subject: [PATCH 03/10] Create Binary_Search.c

---
 C/Binary_Search.c | 39 +++++++++++++++++++++++++++++++++++++++
 1 file changed, 39 insertions(+)
 create mode 100644 C/Binary_Search.c

diff --git a/C/Binary_Search.c b/C/Binary_Search.c
new file mode 100644
index 0000000..bbba26c
--- /dev/null
+++ b/C/Binary_Search.c
@@ -0,0 +1,39 @@
+
+#include <stdio.h>
+
+int main()
+{
+  int c, first, last, middle, n, search, array[100];
+
+  printf("Enter number of elements\n");
+  scanf("%d", &n);
+
+  printf("Enter %d integers\n", n);
+
+  for (c = 0; c < n; c++)
+    scanf("%d", &array[c]);
+
+  printf("Enter value to find\n");
+  scanf("%d", &search);
+
+  first = 0;
+  last = n - 1;
+  middle = (first+last)/2;
+
+  while (first <= last) {
+    if (array[middle] < search)
+      first = middle + 1;
+    else if (array[middle] == search) {
+      printf("%d found at location %d.\n", search, middle+1);
+      break;
+    }
+    else
+      last = middle - 1;
+
+    middle = (first + last)/2;
+  }
+  if (first > last)
+    printf("Not found! %d isn't present in the list.\n", search);
+
+  return 0;
+}

From 16453b2e26316781bb1aa7834becd7b68ce54b60 Mon Sep 17 00:00:00 2001
From: Bhupendra Chauhan <54802156+Shinigami-Daikou@users.noreply.github.com>
Date: Fri, 2 Oct 2020 22:58:03 +0530
Subject: [PATCH 04/10] Create Factorial.c

---
 C/Factorial.c | 18 ++++++++++++++++++
 1 file changed, 18 insertions(+)
 create mode 100644 C/Factorial.c

diff --git a/C/Factorial.c b/C/Factorial.c
new file mode 100644
index 0000000..e120ba8
--- /dev/null
+++ b/C/Factorial.c
@@ -0,0 +1,18 @@
+
+#include <stdio.h>
+
+int main(){
+    int c, n, f = 1;
+    
+    printf("Enter a number to calculate its factorial\n");
+    scanf("%d", &n);
+    if(n>=0){
+        for (c = 1; c <= n; c++)
+            f = f * c;
+    
+        printf("Factorial of %d = %d\n", n, f);
+    }
+    else
+        printf("Number Should be greater than zero\n");
+    return 0;
+}

From 8a5fc376ba1e9d30a5468874ef9b7991629b9883 Mon Sep 17 00:00:00 2001
From: Bhupendra Chauhan <54802156+Shinigami-Daikou@users.noreply.github.com>
Date: Fri, 2 Oct 2020 23:07:38 +0530
Subject: [PATCH 05/10] Update README.md

---
 README.md | 443 +++++++++++++++++++++++++++++++++++++++++++++++++++++-
 1 file changed, 440 insertions(+), 3 deletions(-)

diff --git a/README.md b/README.md
index 7143e03..ef2a2a6 100644
--- a/README.md
+++ b/README.md
@@ -1,11 +1,448 @@
-# algorithmsUse
+# AlgorithmsUse
 
 Common Algorithms which are usually taught in Data Structures and Algorithms courses.
 
-### Contributions
+## Hacktoberfest
 
-Add any Algorithm which is not already present in its respective Programming Language directory.
+This repo is Hacktoberfest friendly. As long as the program is properly commented, variable names are intuited, program works, is not already present, and added to the README files it will be accepted.
+
+## Contributions
+
+Add any Algorithm which is not already present in its respective Programming Language directory. Also, update the respective lanuage's README file and the main repo README file with your algorithm's name.
 
 If you don't find your favorite programming language's directory, feel free to create it.
 
+Updates to this README are also appreciated.
+
 You can also contact me if you have any issues.
+
+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
+
+### Table of Contents
+
+- [C](#C)
+- [C++](#C++)
+- [Dart](#Dart)
+- [Python](#Python)
+- [Java](#Java)
+- [JavaScript](#Javascript)
+- [Go](#Go)
+- [Swift](#Swift)
+
+
+<a name="C"></a>
+
+### C
+
+<!-- <h1 align="center">C</h1> <br> -->
+
+<p><image src="https://external-content.duckduckgo.com/iu/?u=https%3A%2F%2Ftoppng.com%2Fpublic%2Fuploads%2Fpreview%2Fc-programming-icon-c-programming-language-logo-11562945679duaxtn3yq0.png&f=1&nofb=1" width ="100" height="100"></image></p>
+
+#### Table of Contents
+
+- [Math](#math)
+- [Searching](#searching)
+
+#### Math
+
+- [Factorial](https://github.com/aniketsharma00411/algorithmsUse/blob/master/C/Math/Factorial.cpp)
+
+<a name="searching"></a>
+
+#### Searching
+
+- [BinarySearch](https://github.com/aniketsharma00411/algorithmsUse/blob/master/C/Searching/BinarySearch.cpp)
+
+- [LinearSearch](https://github.com/aniketsharma00411/algorithmsUse/blob/master/C/Searching/LinearSearch.cpp)
+
+
+
+<a name="C++"></a>
+
+### C++
+
+<!-- <h1 align="center">C++</h1> <br> -->
+
+<p><image src="https://external-content.duckduckgo.com/iu/?u=https%3A%2F%2Ftse1.mm.bing.net%2Fth%3Fid%3DOIP.PhVubETFXOlymmVf-z9xawHaHa%26pid%3DApi&f=1" width ="100" height="100"></image></p>
+
+#### Table of Contents
+
+- [Graph Algorithms](#graph)
+- [Math](#math)
+- [Searching](#searching)
+- [Sorting](#sorting)
+- [Miscellaneous](#others)
+- [Unit Tests](#unit-tests)
+
+<a name="graph"></a>
+
+#### Graph Algorithms
+
+- [Dijktras](https://github.com/aniketsharma00411/algorithmsUse/blob/master/C%2B%2B/Graph%20Algorithms/Dijktras.cpp)
+- [Floyd_Warshall](https://github.com/aniketsharma00411/algorithmsUse/blob/master/C%2B%2B/Graph%20Algorithms/Floyd_Warshall.cpp)
+- [Kosaraju_algorithm](https://github.com/aniketsharma00411/algorithmsUse/blob/master/C%2B%2B/Graph%20Algorithms/Kosaraju_algorithm.cpp)
+
+<a name="math"></a>
+
+#### Math
+
+- [binary_Exponentiation](https://github.com/aniketsharma00411/algorithmsUse/blob/master/C%2B%2B/Math/binary_Exponentiation.cpp)
+- [Factorial_20](https://github.com/aniketsharma00411/algorithmsUse/blob/master/C%2B%2B/Math/Factorial_20.cpp)
+
+<a name="searching"></a>
+
+#### Searching
+
+- [BinarySearch](https://github.com/aniketsharma00411/algorithmsUse/blob/master/C%2B%2B/Searching/BinarySearch.cpp)
+
+- [BreadthFirstSearch](https://github.com/aniketsharma00411/algorithmsUse/blob/master/C%2B%2B/Searching/BreadthFirstSearch.cpp)
+
+- [DepthFirstSearch](https://github.com/aniketsharma00411/algorithmsUse/blob/master/C%2B%2B/Searching/DepthFirstSearch.cpp)
+
+- [ExponentialSearch](https://github.com/aniketsharma00411/algorithmsUse/blob/master/C%2B%2B/Searching/ExponentialSearch.cpp)
+
+- [Fibonacci_Search](https://github.com/aniketsharma00411/algorithmsUse/blob/master/C%2B%2B/Searching/Fibonacci_Search.cpp)
+
+- [LinearSearch](https://github.com/aniketsharma00411/algorithmsUse/blob/master/C%2B%2B/Searching/LinearSearch.cpp)
+
+- [RecursiveLinearSearch](https://github.com/aniketsharma00411/algorithmsUse/blob/master/C%2B%2B/Searching/RecursiveLinearSearch.cpp)
+
+- [StairCaseSearch](https://github.com/aniketsharma00411/algorithmsUse/blob/master/C%2B%2B/Searching/StairCaseSearch.cpp)
+
+<a name="sorting"></a>
+
+### Sorting
+
+- [BubbleSort](https://github.com/aniketsharma00411/algorithmsUse/blob/master/C%2B%2B/Sorting/BubbleSort.cpp)
+
+- [countingSort](https://github.com/aniketsharma00411/algorithmsUse/blob/master/C%2B%2B/Sorting/countingSort.cpp)
+
+- [heapsort](https://github.com/aniketsharma00411/algorithmsUse/blob/master/C%2B%2B/Sorting/heapsort.cpp)
+
+- [insertion_sort](https://github.com/aniketsharma00411/algorithmsUse/blob/master/C%2B%2B/Sorting/insertion_sort.cpp)
+
+- [mergesort](https://github.com/aniketsharma00411/algorithmsUse/blob/master/C%2B%2B/Sorting/mergesort.cpp)
+
+- [quicksort](https://github.com/aniketsharma00411/algorithmsUse/blob/master/C%2B%2B/Sorting/quicksort.cpp)
+
+- [RadixSort](https://github.com/aniketsharma00411/algorithmsUse/blob/master/C%2B%2B/Sorting/RadixSort.cpp)
+
+<a name="others"></a>
+
+### Miscellaneous
+
+- [KMPAlgo](https://github.com/aniketsharma00411/algorithmsUse/blob/master/C%2B%2B/Miscellaneous/KMPAlgo.cpp)
+
+- [KadanesAlgo](https://github.com/aniketsharma00411/algorithmsUse/blob/master/C%2B%2B/Miscellaneous/KadanesAlgo.cpp)
+
+- [RoundRobin](https://github.com/aniketsharma00411/algorithmsUse/blob/master/C%2B%2B/Miscellaneous/RoundRobin.cpp)
+
+- [SieveOfEratosthenes](https://github.com/aniketsharma00411/algorithmsUse/blob/master/C%2B%2B/Miscellaneous/SieveOfEratosthenes.cpp)
+
+- [StringSorting](https://github.com/aniketsharma00411/algorithmsUse/blob/master/C%2B%2B/Miscellaneous/StringSorting.cpp)
+
+- [greedy_money_change_recursive](https://github.com/aniketsharma00411/algorithmsUse/blob/master/C%2B%2B/Miscellaneous/greedy_money_change_recursive.cpp)
+
+- [huffmanencoding](https://github.com/aniketsharma00411/algorithmsUse/blob/master/C%2B%2B/Miscellaneous/huffmanencoding.cpp)
+
+- [pascaltriangle](https://github.com/aniketsharma00411/algorithmsUse/blob/master/C%2B%2B/Miscellaneous/pascaltriangle.cpp)
+
+- [sjf](https://github.com/aniketsharma00411/algorithmsUse/blob/master/C%2B%2B/Miscellaneous/sjf.cpp)
+
+- [tower_of_hanoi](https://github.com/aniketsharma00411/algorithmsUse/blob/master/C%2B%2B/Miscellaneous/tower_of_hanoi.cpp)
+
+### Unit Tests
+
+--
+
+<a name="Dart"></a>
+
+## Dart
+
+<h1 align="center">Dart</h1> <br>
+
+<p align="center"><image src="https://external-content.duckduckgo.com/iu/?u=https%3A%2F%2Ftse1.mm.bing.net%2Fth%3Fid%3DOIP.QCajckOeBhRaLzi0RoFqigHaEK%26pid%3DApi&f=1" width ="474" height="266"></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/Dart/Searching/binary_search.dart)
+
+- [linear_search](https://github.com/aniketsharma00411/algorithmsUse/blob/master/Dart/Searching/linear_search.dart)
+
+<a name="sorting"></a>
+
+### Sorting
+
+- [bubble_sort](https://github.com/aniketsharma00411/algorithmsUse/blob/master/Dart/Sorting/bubble_sort.dart)
+
+- [merge_sort](https://github.com/aniketsharma00411/algorithmsUse/blob/master/Dart/Sorting/merge_sort.dart)
+
+- [selection_sort](https://github.com/aniketsharma00411/algorithmsUse/blob/master/Dart/Sorting/selection_sort.dart)
+
+<a name="unit-tests"></a>
+
+### Unit Tests
+
+--
+
+<a name="Java"></a>
+
+## Java
+
+<h1 align="center">Java</h1> <br>
+
+<p align="center"><image src="https://logos-download.com/wp-content/uploads/2016/10/Java_logo_icon.png" width ="500" height="280"></image></p>
+
+## Table of Contents
+
+- [Arrays](#arrays)
+- [Recursion](#recursion)
+- [Searching](#searching)
+- [Sorting](#sorting)
+- [Unit Tests](#unit-tests)
+
+<a name="arrays"></a>
+
+### Arrays
+
+- [checkIfArrayIsSorted](https://github.com/aniketsharma00411/algorithmsUse/blob/master/Java/Arrays/checkIfArrayIsSorted.java)
+
+- [deleteElement](https://github.com/aniketsharma00411/algorithmsUse/blob/master/Java/Arrays/deleteElement.java)
+
+- [FibonacciSeries](https://github.com/aniketsharma00411/algorithmsUse/blob/master/Java/Arrays/FibonacciSeries)
+
+- [getLargestElementIndex](https://github.com/aniketsharma00411/algorithmsUse/blob/master/Java/Arrays/getLargestElementIndex.java)
+
+- [insertion](https://github.com/aniketsharma00411/algorithmsUse/blob/master/Java/Arrays/insertion.java)
+
+- [leftRotateByOne](https://github.com/aniketsharma00411/algorithmsUse/blob/master/Java/Arrays/leftRotateByOne.java)
+
+- [moveZerosToEnd](https://github.com/aniketsharma00411/algorithmsUse/blob/master/Java/Arrays/moveZerosToEnd.java)
+
+- [removeDuplicatesFromSortedArray](https://github.com/aniketsharma00411/algorithmsUse/blob/master/Java/Arrays/removeDuplicatesFromSortedArray.java)
+
+- [rotateArrayDTimes](https://github.com/aniketsharma00411/algorithmsUse/blob/master/Java/Arrays/rotateArrayDTimes.java)
+
+- [Two Pointer Algorithm](https://github.com/aniketsharma00411/algorithmsUse/blob/master/Java/Arrays/Two%20Pointer%20Algorithm)
+
+<a name="recursion"></a>
+
+### Recursion
+
+- [binaryExponentiation](https://github.com/aniketsharma00411/algorithmsUse/blob/master/Java/Recursion/binaryExponentiation.java)
+
+- [checkPalindromeNumber](https://github.com/aniketsharma00411/algorithmsUse/blob/master/Java/Recursion/checkPalindromeNumber.java)
+
+- [countDigitsInANumber](https://github.com/aniketsharma00411/algorithmsUse/blob/master/Java/Recursion/countDigitsInANumber.java)
+
+- [euclidGCD](https://github.com/aniketsharma00411/algorithmsUse/blob/master/Java/Recursion/euclidGCD.java)
+
+- [factorialUsingRecursion](https://github.com/aniketsharma00411/algorithmsUse/blob/master/Java/Recursion/factorialUsingRecursion.java)
+
+- [nCr](https://github.com/aniketsharma00411/algorithmsUse/blob/master/Java/Recursion/nCr.java)
+
+- [nthFibonacci](https://github.com/aniketsharma00411/algorithmsUse/blob/master/Java/Recursion/nthFibonacci.java)
+
+- [printArrayRecursive](https://github.com/aniketsharma00411/algorithmsUse/blob/master/Java/Recursion/printArrayRecursive.java)
+
+- [printOneToN](https://github.com/aniketsharma00411/algorithmsUse/blob/master/Java/Recursion/printOneToN.java)
+
+- [sumOfDigits](https://github.com/aniketsharma00411/algorithmsUse/blob/master/Java/Recursion/sumOfDigits.java)
+
+- [sumOfNNumbers](https://github.com/aniketsharma00411/algorithmsUse/blob/master/Java/Recursion/sumOfNNumbers.java)
+
+- [towerOfHanoiMoveCount](https://github.com/aniketsharma00411/algorithmsUse/blob/master/Java/Recursion/towerOfHanoiMoveCount.java)
+
+<a name="searching"></a>
+
+### Searching
+
+- [BinarySearch](https://github.com/aniketsharma00411/algorithmsUse/blob/master/Java/Searching/binarySearch.java)
+
+- [ExponentialSearch](https://github.com/aniketsharma00411/algorithmsUse/blob/master/Java/Searching/ExponentialSearch.java)
+
+- [Interpolation_Search](https://github.com/aniketsharma00411/algorithmsUse/blob/master/Java/Searching/Interpolation_Search.java)
+
+<a name="sorting"></a>
+
+### Sorting
+
+- [bubbleSort](https://github.com/aniketsharma00411/algorithmsUse/blob/master/Java/Sorting/bubbleSort.java)
+
+- [heapSort](https://github.com/aniketsharma00411/algorithmsUse/blob/master/Java/Sorting/heapSort.java)
+
+<a name="unit-tests"></a>
+
+### Unit Tests
+
+--
+
+<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
+
+- [Graph Algorithms](#graph)
+- [Sorting](#sorting)
+- [Unit Tests](#unit-tests)
+
+<a name="graph"></a>
+
+### Graph Algorithms
+
+- [bfs](https://github.com/aniketsharma00411/algorithmsUse/blob/master/JavaScript/sorting/bfs.js)
+
+<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>
+
+<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)
+- [LinearSearch]()
+
+<a name="sorting"></a>
+
+### Sorting
+
+- [BubbleSort](https://github.com/aniketsharma00411/algorithmsUse/blob/master/Python/Sorting/bubbleSort.py)
+- [Insertion Sort](https://github.com/aniketsharma00411/algorithmsUse/blob/insertion_sort/Python/Sorting/Insertion%20Sort.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)
+- [rotation of array]()
+  <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)
+- [Miscellaneous](#misc)
+- [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="misc"></a>
+
+### Miscellaneous
+
+- [Fibonacci_rec](https://github.com/aniketsharma00411/algorithmsUse/blob/master/Go/Miscellaneous/fibonacci_rec.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
+
+--

From 48fc012ceaad85878b66f0afc412e081a1ca6ffb Mon Sep 17 00:00:00 2001
From: Bhupendra Chauhan <54802156+Shinigami-Daikou@users.noreply.github.com>
Date: Fri, 2 Oct 2020 23:08:26 +0530
Subject: [PATCH 06/10] Update README.md

---
 README.md | 2 +-
 1 file changed, 1 insertion(+), 1 deletion(-)

diff --git a/README.md b/README.md
index ef2a2a6..87896ef 100644
--- a/README.md
+++ b/README.md
@@ -40,7 +40,7 @@ https://cppsecrets.com/users/561797110105107101116115104971141099748485249496410
 
 <!-- <h1 align="center">C</h1> <br> -->
 
-<p><image src="https://external-content.duckduckgo.com/iu/?u=https%3A%2F%2Ftoppng.com%2Fpublic%2Fuploads%2Fpreview%2Fc-programming-icon-c-programming-language-logo-11562945679duaxtn3yq0.png&f=1&nofb=1" width ="100" height="100"></image></p>
+<p><image src="https://external-content.duckduckgo.com/iu/?u=https%3A%2F%2Fwww.ubuntupit.com%2Fwp-content%2Fuploads%2F2019%2F01%2FC-1024x530.jpg&f=1&nofb=1" width ="100" height="100"></image></p>
 
 #### Table of Contents
 

From 139a9a2ef7b1b303be3b823813f1bd237be9169e Mon Sep 17 00:00:00 2001
From: Bhupendra Chauhan <54802156+Shinigami-Daikou@users.noreply.github.com>
Date: Fri, 2 Oct 2020 23:10:38 +0530
Subject: [PATCH 07/10] Update README.md

---
 README.md | 2 +-
 1 file changed, 1 insertion(+), 1 deletion(-)

diff --git a/README.md b/README.md
index 87896ef..e874ac6 100644
--- a/README.md
+++ b/README.md
@@ -40,7 +40,7 @@ https://cppsecrets.com/users/561797110105107101116115104971141099748485249496410
 
 <!-- <h1 align="center">C</h1> <br> -->
 
-<p><image src="https://external-content.duckduckgo.com/iu/?u=https%3A%2F%2Fwww.ubuntupit.com%2Fwp-content%2Fuploads%2F2019%2F01%2FC-1024x530.jpg&f=1&nofb=1" width ="100" height="100"></image></p>
+<p><image src="https://masterprograming.com/wp-content/uploads/2019/03/c-programming-e1536069688313.png" width ="100" height="100"></image></p>
 
 #### Table of Contents
 

From 8ec01aaf9401ad2dadb801b125ad9a58cabceef9 Mon Sep 17 00:00:00 2001
From: Bhupendra Chauhan <54802156+Shinigami-Daikou@users.noreply.github.com>
Date: Fri, 2 Oct 2020 23:11:22 +0530
Subject: [PATCH 08/10] Rename C/Binary_Search.c to C/Searching/Binary_Search.c

---
 C/{ => Searching}/Binary_Search.c | 0
 1 file changed, 0 insertions(+), 0 deletions(-)
 rename C/{ => Searching}/Binary_Search.c (100%)

diff --git a/C/Binary_Search.c b/C/Searching/Binary_Search.c
similarity index 100%
rename from C/Binary_Search.c
rename to C/Searching/Binary_Search.c

From b331315f28e3b92b8842083daa561702043a05bf Mon Sep 17 00:00:00 2001
From: Bhupendra Chauhan <54802156+Shinigami-Daikou@users.noreply.github.com>
Date: Fri, 2 Oct 2020 23:11:45 +0530
Subject: [PATCH 09/10] Rename C/Linear_Search.c to C/Searching/Linear_Search.c

---
 C/{ => Searching}/Linear_Search.c | 0
 1 file changed, 0 insertions(+), 0 deletions(-)
 rename C/{ => Searching}/Linear_Search.c (100%)

diff --git a/C/Linear_Search.c b/C/Searching/Linear_Search.c
similarity index 100%
rename from C/Linear_Search.c
rename to C/Searching/Linear_Search.c

From 97d8e0d8ad4546acc1a8bbecf1d7dd1f7e1529bc Mon Sep 17 00:00:00 2001
From: Bhupendra Chauhan <54802156+Shinigami-Daikou@users.noreply.github.com>
Date: Fri, 2 Oct 2020 23:12:07 +0530
Subject: [PATCH 10/10] Rename C/Factorial.c to C/Math/Factorial.c

---
 C/{ => Math}/Factorial.c | 0
 1 file changed, 0 insertions(+), 0 deletions(-)
 rename C/{ => Math}/Factorial.c (100%)

diff --git a/C/Factorial.c b/C/Math/Factorial.c
similarity index 100%
rename from C/Factorial.c
rename to C/Math/Factorial.c