From 51834df8fd2e202cb29bce6e879c8870bce0c9d8 Mon Sep 17 00:00:00 2001
From: Varun Joshi <varunj442@gmail.com>
Date: Sat, 3 Oct 2020 23:43:19 +0530
Subject: [PATCH 1/4] added Prims algorithm and different versions of other
 algorithms in C language

---
 C/HeapSort/V3/main.c                     |   0
 C/InsertionSort/v1/main.c                |  59 ++++++++
 C/InsertionSort/{ => v2}/InsertionSort.c |   0
 C/Prims/Prims.c                          |  67 +++++++++
 CONTRIBUTING.md                          |   1 +
 README-CN.md                             | 177 ++++++++++++-----------
 6 files changed, 217 insertions(+), 87 deletions(-)
 create mode 100644 C/HeapSort/V3/main.c
 create mode 100644 C/InsertionSort/v1/main.c
 rename C/InsertionSort/{ => v2}/InsertionSort.c (100%)
 create mode 100644 C/Prims/Prims.c

diff --git a/C/HeapSort/V3/main.c b/C/HeapSort/V3/main.c
new file mode 100644
index 000000000..e69de29bb
diff --git a/C/InsertionSort/v1/main.c b/C/InsertionSort/v1/main.c
new file mode 100644
index 000000000..76617b2e6
--- /dev/null
+++ b/C/InsertionSort/v1/main.c
@@ -0,0 +1,59 @@
+#include <stdio.h>
+#include <stdlib.h>
+#include <time.h>
+#define MAX 100000
+
+int main()
+{
+    int a[MAX];
+    int i,j,n;
+    clock_t s,e;
+    double t;
+    //size of elements 
+    printf("enter the size\n");
+    //input elements
+    scanf("%d",&n);
+    printf("enter the array elements\n");
+    for(i=0;i<n;i++)
+    {
+        a[i]=rand()%100;
+    }
+    //display_array_elements
+    printf("array element before sorting\nt");
+     for(i=0;i<n;i++)
+    {
+        printf("%d\t",a[i]);
+    }
+    //time complexity calculation
+    s=clock();
+        for(i=0;i<1000;i++)
+        for(j=0;j<1000;j++)
+            insertionSort(a,n);
+
+    e=clock();
+    t=(double)(e-s)/CLK_TCK;
+    //sorted arrays
+      printf("\narray element after sorting\n");
+     for(i=0;i<n;i++)
+    {
+        printf("%d\t",a[i]);
+    }
+    printf("\ntime taken to sort the given array is = %lf",t);
+
+}
+//function for insterion sort
+void  insertionSort(int a[],int n)
+{
+    int i,j,key;
+    for(i=1;i<=n;i++)
+    {
+        key=a[i];
+        j=i-1;
+        while(j>=0&&a[j]>key)
+        {
+            a[j+1]=a[j];
+            j=j-1;
+        }
+        a[j+1]=key;
+    }
+}
diff --git a/C/InsertionSort/InsertionSort.c b/C/InsertionSort/v2/InsertionSort.c
similarity index 100%
rename from C/InsertionSort/InsertionSort.c
rename to C/InsertionSort/v2/InsertionSort.c
diff --git a/C/Prims/Prims.c b/C/Prims/Prims.c
new file mode 100644
index 000000000..a09975496
--- /dev/null
+++ b/C/Prims/Prims.c
@@ -0,0 +1,67 @@
+#include<stdio.h>
+#include<stdlib.h>
+#define MAX 20
+#define INFINITY 999
+int cost[MAX][MAX],visited[MAX];
+void prims(int cost[][MAX],int n){
+
+   int i,j,ne=1;
+   int a,b,u,v,min,mincost=0;
+   for(i=0;i<=n;i++)
+    visited[i]=0;
+    printf("\n edges of the spanning tree");
+    visited[1]=1;
+    while(ne<n){
+        for(i=1,min=INFINITY;i<n;i++)
+        {
+            for(j=1;j<=n;j++){
+
+                if(cost[i][j]<min)
+                if(visited[i]==0){
+                    continue;
+                }
+                else{
+                    min=cost[i][j];
+                    a=u=i;
+                    b=v=j;
+                }
+            }
+
+
+
+        }
+        if(visited[u]==0 || visited[v]==0){
+
+            printf("\n%d.EDGE(%d%d)=%d\n",ne++,a,b,min);
+            mincost+=min;
+            visited[b]=1;
+        }
+
+        cost[a][b]=cost[b][a]=INFINITY;
+    }
+    printf("\n MINIMUM COST=%d\n",mincost);
+}
+
+   int main(int argc,char *argv[]){
+       int n,i,j;
+       printf("enter the number of elements\n");
+        scanf("%d\n",&n);
+      for(i=0;i<n;i++){
+        for(j=0;j<=n;j++){
+          if(cost[i][j]<min)
+		     if(visited[i]!=0) {
+
+
+
+
+        }
+      }
+
+           prims(cost,n);
+           return 0;
+
+   }
+
+
+
+
diff --git a/CONTRIBUTING.md b/CONTRIBUTING.md
index 81531cf70..0d80d149a 100644
--- a/CONTRIBUTING.md
+++ b/CONTRIBUTING.md
@@ -182,3 +182,4 @@ Unfortunately, sometimes the bug can be only reproduced in your project or in yo
 - [vzsky](https://github.com/vzsky)
 - [raphaelmeyer](https://github.com/raphaelmeyer)
 - [jonasbn](https://github.com/jonasbn)
+- [VarunJoshi](https://github.com/sixthcodebrewer)
\ No newline at end of file
diff --git a/README-CN.md b/README-CN.md
index 4bfc551e7..c850abd7c 100644
--- a/README-CN.md
+++ b/README-CN.md
@@ -1,97 +1,100 @@
 # 算法实例
+
 这个仓库包含各种各样的，由不同的编程语言实现的算法实例。
-## 不同语言的算法实现
 
+## 不同语言的算法实现
 
-语言 | BrainFuck | C | C# | C++ | Crystal | Go | Haskell | Java | JavaScript | Kotlin | Perl | Python | Racket | Ruby | Rust | Scala | Swift|
----|:---:|:---:|:---:|:---:|:---:|:---:|:---:|:---:|:---:|:---:|:---:|:---:|:---:|:---:|:---:|:---:|:---:|
-AStar Search |   |   |   | :+1: |   |   |   |   |   |   |   | :+1: |   |   |   |   |  |
-Bellman Ford |   |   | :+1: | :+1: |   |   | :+1: | :+1: |   |   |   | :+1: |   |   |   |   |  |
-Binary GCD |   |   |   | :+1: |   | :+1: | :+1: | :+1: |   |   |   | :+1: |   |   |   |   |  |
-Binary Search |   | :+1: | :+1: | :+1: |   | :+1: |   | :+1: | :+1: | :+1: | :+1: | :+1: |   | :+1: |   |   | :+1:|
-Bitap Algorithm |   |   |   | :+1: |   |   |   |   |   |   |   | :+1: |   |   |   |   |  |
-Bitonic Sort |   | :+1: |   |   |   |   |   | :+1: |   |   |   |   |   |   |   |   |  |
-Bloom Filter |   |   |   |   |   |   |   |   |   |   |   | :+1: |   |   |   |   |  |
-Borweins Algorithm |   |   |   | :+1: |   |   |   | :+1: |   |   |   | :+1: |   |   |   |   |  |
-Bubble Sort | :+1: | :+1: | :+1: | :+1: |   | :+1: |   | :+1: | :+1: |   | :+1: | :+1: |   | :+1: | :+1: | :+1: | :+1:|
-Cocktail Sort |   |   |   | :+1: |   |   |   |   |   |   |   |   |   |   |   |   |  |
-Coin Change |   |   |   | :+1: |   |   |   |   |   |   |   |   |   |   |   |   |  |
-Conjugate Gradient |   |   |   | :+1: |   |   |   |   |   |   |   | :+1: |   |   |   |   |  |
-Connected Component Labeling |   | :+1: |   |   |   |   |   |   |   |   |   |   |   |   |   |   |  |
-Count Sort |   |   |   |   |   |   |   |   |   |   |   | :+1: |   |   |   |   |  |
-Counting Inversions |   |   |   | :+1: |   | :+1: |   | :+1: |   |   |   |   |   |   |   |   |  |
-Counting Sort |   |   |   | :+1: |   |   |   | :+1: | :+1: |   |   | :+1: |   | :+1: |   |   | :+1:|
-Cycle Sort |   |   |   | :+1: |   |   |   | :+1: |   |   |   | :+1: |   |   |   |   |  |
-Depth First Search |   | :+1: |   | :+1: |   |   |   | :+1: | :+1: |   |   | :+1: |   | :+1: |   |   |  |
-Diffie Hellman |   |   |   |   |   |   | :+1: |   |   |   |   | :+1: |   |   |   |   |  |
-Dijkstras |   |   | :+1: | :+1: |   | :+1: |   | :+1: | :+1: |   |   | :+1: |   |   |   |   |  |
-Doomsday |   |   | :+1: | :+1: |   |   |   | :+1: | :+1: | :+1: |   | :+1: |   | :+1: |   |   | :+1:|
-Dynamic Programming |   |   |   |   |   |   |   | :+1: |   |   |   |   |   |   |   |   |  |
-Edit Distance |   |   |   | :+1: |   |   |   |   |   |   |   | :+1: |   |   |   |   | :+1:|
-Edmonds Karp |   |   |   |   |   |   |   | :+1: |   |   |   |   |   |   |   |   |  |
-Elevator Algorithm |   |   |   |   |   |   |   | :+1: |   |   |   |   |   |   |   |   |  |
-Extended Euclidean Algorithm |   | :+1: |   |   |   |   |   |   | :+1: |   |   |   |   |   |   |   |  |
-Factorial |   | :+1: |   |   |   |   |   | :+1: |   |   |   | :+1: |   |   |   |   |  |
-Fast Fourier Transform |   | :+1: |   | :+1: |   |   |   | :+1: | :+1: |   |   | :+1: |   |   |   |   |  |
-Fenwick Tree |   |   |   | :+1: |   |   |   |   |   |   |   |   |   |   |   |   |  |
-Fibonacci | :+1: | :+1: | :+1: | :+1: |   | :+1: | :+1: | :+1: | :+1: | :+1: | :+1: | :+1: | :+1: | :+1: | :+1: | :+1: | :+1:|
-Fisher Yates Shuffle |   |   | :+1: | :+1: |   |   |   | :+1: | :+1: |   |   | :+1: |   | :+1: |   |   |  |
-Flood Fill |   |   |   | :+1: |   |   |   | :+1: |   |   |   | :+1: |   |   |   |   | :+1:|
-Floyds Algorithm |   | :+1: |   | :+1: |   | :+1: |   | :+1: |   |   |   | :+1: |   |   |   |   |  |
-Greatest Common Divisor |   | :+1: | :+1: | :+1: |   | :+1: |   | :+1: | :+1: | :+1: |   | :+1: |   | :+1: |   | :+1: |  |
-Hamming Distance |   | :+1: |   | :+1: |   | :+1: |   | :+1: | :+1: |   |   | :+1: |   | :+1: |   |   |  |
-Heap Sort |   | :+1: |   | :+1: | :+1: | :+1: |   | :+1: | :+1: |   |   | :+1: |   | :+1: |   |   |  |
-Heavy Light Decomposition |   |   |   | :+1: |   |   |   |   |   |   |   |   |   |   |   |   |  |
-Histogram Equalization |   |   |   |   |   |   |   | :+1: |   |   |   |   |   |   |   |   |  |
-Insertion Sort |   | :+1: | :+1: | :+1: |   | :+1: |   | :+1: | :+1: | :+1: |   | :+1: |   | :+1: | :+1: | :+1: | :+1:|
-Johnson Algorithm |   |   |   | :+1: |   |   |   |   |   |   |   | :+1: |   |   |   |   |  |
-Kadanes |   | :+1: | :+1: | :+1: |   | :+1: |   | :+1: | :+1: |   |   | :+1: |   |   |   |   |  |
-Knapsack |   | :+1: |   |   |   |   |   | :+1: |   |   |   |   |   |   |   |   |  |
-Knuth Morris Prath |   |   |   | :+1: |   |   |   | :+1: |   |   |   | :+1: |   |   |   |   |  |
-Kruskals Algorithm |   |   |   | :+1: |   |   |   | :+1: |   |   |   |   |   |   |   |   |  |
-Leaky Bucket |   | :+1: |   |   |   |   |   |   |   |   |   |   |   |   |   |   |  |
-Linear Search |   | :+1: | :+1: | :+1: |   | :+1: |   | :+1: | :+1: | :+1: | :+1: | :+1: | :+1: |   | :+1: | :+1: | :+1:|
-Longest Bitonic Subsequence |   |   |   | :+1: |   |   |   |   |   |   |   |   |   |   |   |   |  |
-Longest Common Subsequence |   | :+1: |   | :+1: |   |   |   | :+1: |   |   |   | :+1: |   | :+1: |   |   |  |
-Longest Increasing Subsequence |   |   |   | :+1: |   |   |   | :+1: | :+1: |   |   | :+1: |   |   |   |   |  |
-Longest Path |   |   |   | :+1: |   |   |   |   |   |   |   | :+1: |   |   |   |   |  |
-Longest Subset Zero Sum |   |   |   | :+1: |   |   |   |   |   |   |   |   |   |   |   |   |  |
-Merge Sort |   | :+1: | :+1: | :+1: |   | :+1: | :+1: | :+1: | :+1: |   |   | :+1: |   | :+1: |   | :+1: | :+1:|
-Min Max ABPruning |   |   |   |   |   |   |   | :+1: |   |   |   |   |   |   |   |   |  |
-Minimax |   |   |   | :+1: |   | :+1: |   |   |   |   |   |   |   |   |   |   |  |
-Pearson Hashing |   |   |   |   |   |   |   | :+1: |   |   |   |   |   |   |   |   |  |
-Permutations |   |   |   | :+1: |   |   |   |   | :+1: |   |   | :+1: |   |   |   |   |  |
-Persistent Data Structures |   |   |   | :+1: |   |   |   |   |   |   |   |   |   |   |   |   |  |
-Postman Sort |   | :+1: |   |   |   |   |   |   |   |   |   |   |   |   |   |   |  |
-Primality Tests |   |   |   | :+1: |   |   |   |   |   |   |   |   |   |   |   |   |  |
-Prims |   |   |   | :+1: |   |   |   |   |   |   |   |   |   |   |   |   |  |
-Prufer Code |   |   |   | :+1: |   |   |   |   |   |   |   |   |   |   |   |   |  |
-Quick Select |   |   |   |   |   | :+1: |   | :+1: | :+1: |   |   | :+1: |   |   |   |   |  |
-Quick Sort |   | :+1: | :+1: | :+1: |   | :+1: | :+1: | :+1: | :+1: | :+1: |   | :+1: |   | :+1: | :+1: |   | :+1:|
-Rabin Karp |   |   |   |   |   |   |   | :+1: |   |   |   | :+1: |   |   |   |   |  |
-Radix Sort |   | :+1: |   | :+1: |   |   |   | :+1: |   |   |   | :+1: |   |   |   |   |  |
-Segment Tree |   |   |   | :+1: |   |   |   |   |   |   |   |   |   |   |   |   |  |
-Segmented Sieve |   | :+1: |   |   |   |   |   | :+1: |   |   |   | :+1: |   |   |   |   |  |
-Selection Sort |   | :+1: | :+1: | :+1: |   | :+1: |   | :+1: | :+1: |   |   | :+1: |   | :+1: | :+1: | :+1: |  |
-Sequence Alignment |   |   |   | :+1: |   |   |   |   |   |   |   |   |   |   |   |   |  |
-Shell Sort |   |   |   | :+1: |   |   |   | :+1: | :+1: |   |   | :+1: |   | :+1: |   |   |  |
-Sieveof Eratosthenes |   |   | :+1: | :+1: |   |   | :+1: | :+1: | :+1: |   |   | :+1: |   |   |   |   |  |
-String To Token |   |   |   | :+1: |   |   |   |   |   |   |   |   |   |   |   |   |  |
-Strongly Connected Graph.cpp |   |   |   | :+1: |   |   |   |   |   |   |   |   |   |   |   |   |  |
-Swap |   | :+1: | :+1: | :+1: |   |   |   | :+1: | :+1: |   |   | :+1: |   |   |   | :+1: | :+1:|
-Tarjans Offline LCA |   |   |   | :+1: |   |   |   |   |   |   |   |   |   |   |   |   |  |
-Ternary Search |   | :+1: |   | :+1: |   |   |   | :+1: | :+1: |   |   | :+1: |   |   |   |   |  |
-Topological Sort |   |   |   | :+1: |   |   |   | :+1: |   |   |   | :+1: |   |   |   |   |  |
-Unary Coding |   |   |   |   |   |   |   | :+1: | :+1: |   |   | :+1: |   |   |   |   |  |
-Union Find |   | :+1: |   |   |   |   |   | :+1: |   |   |   | :+1: |   |   |   |   |  |
-VEGASAlgorithm |   |   |   | :+1: |   |   |   |   |   |   |   |   |   |   |   |   |  |
+| 语言                           | BrainFuck |  C   |  C#  | C++  | Crystal |  Go  | Haskell | Java | JavaScript | Kotlin | Perl | Python | Racket | Ruby | Rust | Scala | Swift |
+| ------------------------------ | :-------: | :--: | :--: | :--: | :-----: | :--: | :-----: | :--: | :--------: | :----: | :--: | :----: | :----: | :--: | :--: | :---: | :---: |
+| AStar Search                   |           |      |      | :+1: |         |      |         |      |            |        |      |  :+1:  |        |      |      |       |       |
+| Bellman Ford                   |           |      | :+1: | :+1: |         |      |  :+1:   | :+1: |            |        |      |  :+1:  |        |      |      |       |       |
+| Binary GCD                     |           |      |      | :+1: |         | :+1: |  :+1:   | :+1: |            |        |      |  :+1:  |        |      |      |       |       |
+| Binary Search                  |           | :+1: | :+1: | :+1: |         | :+1: |         | :+1: |    :+1:    |  :+1:  | :+1: |  :+1:  |        | :+1: |      |       | :+1:  |
+| Bitap Algorithm                |           |      |      | :+1: |         |      |         |      |            |        |      |  :+1:  |        |      |      |       |       |
+| Bitonic Sort                   |           | :+1: |      |      |         |      |         | :+1: |            |        |      |        |        |      |      |       |       |
+| Bloom Filter                   |           |      |      |      |         |      |         |      |            |        |      |  :+1:  |        |      |      |       |       |
+| Borweins Algorithm             |           |      |      | :+1: |         |      |         | :+1: |            |        |      |  :+1:  |        |      |      |       |       |
+| Bubble Sort                    |   :+1:    | :+1: | :+1: | :+1: |         | :+1: |         | :+1: |    :+1:    |        | :+1: |  :+1:  |        | :+1: | :+1: | :+1:  | :+1:  |
+| Cocktail Sort                  |           |      |      | :+1: |         |      |         |      |            |        |      |        |        |      |      |       |       |
+| Coin Change                    |           |      |      | :+1: |         |      |         |      |            |        |      |        |        |      |      |       |       |
+| Conjugate Gradient             |           |      |      | :+1: |         |      |         |      |            |        |      |  :+1:  |        |      |      |       |       |
+| Connected Component Labeling   |           | :+1: |      |      |         |      |         |      |            |        |      |        |        |      |      |       |       |
+| Count Sort                     |           |      |      |      |         |      |         |      |            |        |      |  :+1:  |        |      |      |       |       |
+| Counting Inversions            |           |      |      | :+1: |         | :+1: |         | :+1: |            |        |      |        |        |      |      |       |       |
+| Counting Sort                  |           |      |      | :+1: |         |      |         | :+1: |    :+1:    |        |      |  :+1:  |        | :+1: |      |       | :+1:  |
+| Cycle Sort                     |           |      |      | :+1: |         |      |         | :+1: |            |        |      |  :+1:  |        |      |      |       |       |
+| Depth First Search             |           | :+1: |      | :+1: |         |      |         | :+1: |    :+1:    |        |      |  :+1:  |        | :+1: |      |       |       |
+| Diffie Hellman                 |           |      |      |      |         |      |  :+1:   |      |            |        |      |  :+1:  |        |      |      |       |       |
+| Dijkstras                      |           |      | :+1: | :+1: |         | :+1: |         | :+1: |    :+1:    |        |      |  :+1:  |        |      |      |       |       |
+| Doomsday                       |           |      | :+1: | :+1: |         |      |         | :+1: |    :+1:    |  :+1:  |      |  :+1:  |        | :+1: |      |       | :+1:  |
+| Dynamic Programming            |           |      |      |      |         |      |         | :+1: |            |        |      |        |        |      |      |       |       |
+| Edit Distance                  |           |      |      | :+1: |         |      |         |      |            |        |      |  :+1:  |        |      |      |       | :+1:  |
+| Edmonds Karp                   |           |      |      |      |         |      |         | :+1: |            |        |      |        |        |      |      |       |       |
+| Elevator Algorithm             |           |      |      |      |         |      |         | :+1: |            |        |      |        |        |      |      |       |       |
+| Extended Euclidean Algorithm   |           | :+1: |      |      |         |      |         |      |    :+1:    |        |      |        |        |      |      |       |       |
+| Factorial                      |           | :+1: |      |      |         |      |         | :+1: |            |        |      |  :+1:  |        |      |      |       |       |
+| Fast Fourier Transform         |           | :+1: |      | :+1: |         |      |         | :+1: |    :+1:    |        |      |  :+1:  |        |      |      |       |       |
+| Fenwick Tree                   |           |      |      | :+1: |         |      |         |      |            |        |      |        |        |      |      |       |       |
+| Fibonacci                      |   :+1:    | :+1: | :+1: | :+1: |         | :+1: |  :+1:   | :+1: |    :+1:    |  :+1:  | :+1: |  :+1:  |  :+1:  | :+1: | :+1: | :+1:  | :+1:  |
+| Fisher Yates Shuffle           |           |      | :+1: | :+1: |         |      |         | :+1: |    :+1:    |        |      |  :+1:  |        | :+1: |      |       |       |
+| Flood Fill                     |           |      |      | :+1: |         |      |         | :+1: |            |        |      |  :+1:  |        |      |      |       | :+1:  |
+| Floyds Algorithm               |           | :+1: |      | :+1: |         | :+1: |         | :+1: |            |        |      |  :+1:  |        |      |      |       |       |
+| Greatest Common Divisor        |           | :+1: | :+1: | :+1: |         | :+1: |         | :+1: |    :+1:    |  :+1:  |      |  :+1:  |        | :+1: |      | :+1:  |       |
+| Hamming Distance               |           | :+1: |      | :+1: |         | :+1: |         | :+1: |    :+1:    |        |      |  :+1:  |        | :+1: |      |       |       |
+| Heap Sort                      |           | :+1: |      | :+1: |  :+1:   | :+1: |         | :+1: |    :+1:    |        |      |  :+1:  |        | :+1: |      |       |       |
+| Heavy Light Decomposition      |           |      |      | :+1: |         |      |         |      |            |        |      |        |        |      |      |       |       |
+| Histogram Equalization         |           |      |      |      |         |      |         | :+1: |            |        |      |        |        |      |      |       |       |
+| Insertion Sort                 |           | :+1: | :+1: | :+1: |         | :+1: |         | :+1: |    :+1:    |  :+1:  |      |  :+1:  |        | :+1: | :+1: | :+1:  | :+1:  |
+| Johnson Algorithm              |           |      |      | :+1: |         |      |         |      |            |        |      |  :+1:  |        |      |      |       |       |
+| Kadanes                        |           | :+1: | :+1: | :+1: |         | :+1: |         | :+1: |    :+1:    |        |      |  :+1:  |        |      |      |       |       |
+| Knapsack                       |           | :+1: |      |      |         |      |         | :+1: |            |        |      |        |        |      |      |       |       |
+| Knuth Morris Prath             |           |      |      | :+1: |         |      |         | :+1: |            |        |      |  :+1:  |        |      |      |       |       |
+| Kruskals Algorithm             |           |      |      | :+1: |         |      |         | :+1: |            |        |      |        |        |      |      |       |       |
+| Leaky Bucket                   |           | :+1: |      |      |         |      |         |      |            |        |      |        |        |      |      |       |       |
+| Linear Search                  |           | :+1: | :+1: | :+1: |         | :+1: |         | :+1: |    :+1:    |  :+1:  | :+1: |  :+1:  |  :+1:  |      | :+1: | :+1:  | :+1:  |
+| Longest Bitonic Subsequence    |           |      |      | :+1: |         |      |         |      |            |        |      |        |        |      |      |       |       |
+| Longest Common Subsequence     |           | :+1: |      | :+1: |         |      |         | :+1: |            |        |      |  :+1:  |        | :+1: |      |       |       |
+| Longest Increasing Subsequence |           |      |      | :+1: |         |      |         | :+1: |    :+1:    |        |      |  :+1:  |        |      |      |       |       |
+| Longest Path                   |           |      |      | :+1: |         |      |         |      |            |        |      |  :+1:  |        |      |      |       |       |
+| Longest Subset Zero Sum        |           |      |      | :+1: |         |      |         |      |            |        |      |        |        |      |      |       |       |
+| Merge Sort                     |           | :+1: | :+1: | :+1: |         | :+1: |  :+1:   | :+1: |    :+1:    |        |      |  :+1:  |        | :+1: |      | :+1:  | :+1:  |
+| Min Max ABPruning              |           |      |      |      |         |      |         | :+1: |            |        |      |        |        |      |      |       |       |
+| Minimax                        |           |      |      | :+1: |         | :+1: |         |      |            |        |      |        |        |      |      |       |       |
+| Pearson Hashing                |           |      |      |      |         |      |         | :+1: |            |        |      |        |        |      |      |       |       |
+| Permutations                   |           |      |      | :+1: |         |      |         |      |    :+1:    |        |      |  :+1:  |        |      |      |       |       |
+| Persistent Data Structures     |           |      |      | :+1: |         |      |         |      |            |        |      |        |        |      |      |       |       |
+| Postman Sort                   |           | :+1: |      |      |         |      |         |      |            |        |      |        |        |      |      |       |       |
+| Primality Tests                |           |      |      | :+1: |         |      |         |      |            |        |      |        |        |      |      |       |       |
+| Prims                          |           | :+1: |      | :+1: |         |      |         |      |            |        |      |        |        |      |      |       |       |
+| Prufer Code                    |           |      |      | :+1: |         |      |         |      |            |        |      |        |        |      |      |       |       |
+| Quick Select                   |           |      |      |      |         | :+1: |         | :+1: |    :+1:    |        |      |  :+1:  |        |      |      |       |       |
+| Quick Sort                     |           | :+1: | :+1: | :+1: |         | :+1: |  :+1:   | :+1: |    :+1:    |  :+1:  |      |  :+1:  |        | :+1: | :+1: |       | :+1:  |
+| Rabin Karp                     |           |      |      |      |         |      |         | :+1: |            |        |      |  :+1:  |        |      |      |       |       |
+| Radix Sort                     |           | :+1: |      | :+1: |         |      |         | :+1: |            |        |      |  :+1:  |        |      |      |       |       |
+| Segment Tree                   |           |      |      | :+1: |         |      |         |      |            |        |      |        |        |      |      |       |       |
+| Segmented Sieve                |           | :+1: |      |      |         |      |         | :+1: |            |        |      |  :+1:  |        |      |      |       |       |
+| Selection Sort                 |           | :+1: | :+1: | :+1: |         | :+1: |         | :+1: |    :+1:    |        |      |  :+1:  |        | :+1: | :+1: | :+1:  |       |
+| Sequence Alignment             |           |      |      | :+1: |         |      |         |      |            |        |      |        |        |      |      |       |       |
+| Shell Sort                     |           |      |      | :+1: |         |      |         | :+1: |    :+1:    |        |      |  :+1:  |        | :+1: |      |       |       |
+| Sieveof Eratosthenes           |           |      | :+1: | :+1: |         |      |  :+1:   | :+1: |    :+1:    |        |      |  :+1:  |        |      |      |       |       |
+| String To Token                |           |      |      | :+1: |         |      |         |      |            |        |      |        |        |      |      |       |       |
+| Strongly Connected Graph.cpp   |           |      |      | :+1: |         |      |         |      |            |        |      |        |        |      |      |       |       |
+| Swap                           |           | :+1: | :+1: | :+1: |         |      |         | :+1: |    :+1:    |        |      |  :+1:  |        |      |      | :+1:  | :+1:  |
+| Tarjans Offline LCA            |           |      |      | :+1: |         |      |         |      |            |        |      |        |        |      |      |       |       |
+| Ternary Search                 |           | :+1: |      | :+1: |         |      |         | :+1: |    :+1:    |        |      |  :+1:  |        |      |      |       |       |
+| Topological Sort               |           |      |      | :+1: |         |      |         | :+1: |            |        |      |  :+1:  |        |      |      |       |       |
+| Unary Coding                   |           |      |      |      |         |      |         | :+1: |    :+1:    |        |      |  :+1:  |        |      |      |       |       |
+| Union Find                     |           | :+1: |      |      |         |      |         | :+1: |            |        |      |  :+1:  |        |      |      |       |       |
+| VEGASAlgorithm                 |           |      |      | :+1: |         |      |         |      |            |        |      |        |        |      |      |       |       |
 
 [算法列表](Algorithms.md)
 文件目录结构应该有如下格式：
 [**Algorithm name**]/[**language**]/**file**
-*举例*
-* **BubbleSort/Go/BubbleSort.go**
-* **QuickSort/C++/QuickSort.cpp**
+_举例_
+
+- **BubbleSort/Go/BubbleSort.go**
+- **QuickSort/C++/QuickSort.cpp**
+
 ## License
-[Apache License 2.0](LICENSE)
 
+[Apache License 2.0](LICENSE)

From 108ca23f7b1e864f2ef8cd94b0fabea9b8a913f0 Mon Sep 17 00:00:00 2001
From: Varun j <48326355+sixthcodebrewer@users.noreply.github.com>
Date: Sun, 11 Oct 2020 17:19:58 +0530
Subject: [PATCH 2/4] Delete InsertionSort.c

---
 C/InsertionSort/v2/InsertionSort.c | 56 ------------------------------
 1 file changed, 56 deletions(-)
 delete mode 100644 C/InsertionSort/v2/InsertionSort.c

diff --git a/C/InsertionSort/v2/InsertionSort.c b/C/InsertionSort/v2/InsertionSort.c
deleted file mode 100644
index 003680509..000000000
--- a/C/InsertionSort/v2/InsertionSort.c
+++ /dev/null
@@ -1,56 +0,0 @@
-// including liberary
-#include <stdio.h>
-
-/*
-  the algo goes here
-*/
-void Sort_Array(int arr[], int size)  // it will accept interger type array and size of the array
-{
-  // local variable defination
-  int i, key, j;
-  for (i = 1; i < size; i++)
-  {
-      key = arr[i]; // the i th value
-      j = i-1;  // j is for processing from back
-
-      /* Move elements of arr[0..i-1], that are
-        greater than key, to one position ahead
-        of their current position */
-      while (j >= 0 && arr[j] > key)  // loop will work till j th value of array is greater than i th value of array and j >= 0
-      {
-          arr[j+1] = arr[j];
-          j--;
-      }
-      arr[j+1] = key;
-   }
-}
-
-/*
-    MAIN FUNCTION
-*/
-int main() {
-  // declaring the variable
-  int size;  // size is the array length
-  int i;  // i is for iterations
-  printf("enter the size of array ");
-  scanf("%d",&size);  // getting size
-  int array[size]; // declaring array of size entered by the user
-
-  // getting value from the user
-  printf("\nenter values in the array\n");
-  for (i = 0; i < size; i++) {scanf("%d", &array[i]); }
-
-  // printing the original array
-  printf("\noriginal array -> ");
-  for (i = 0; i < size; i++) { printf("%d ", array[i]); }
-
-  // sorting the array
-  Sort_Array(array, size);
-
-  // printing the sorted array
-  printf("\nsorted array -> ");
-  for (i = 0; i < size; i++) { printf("%d ", array[i]); }
-  
-  return 0;
-}
-

From cea0ffacafd31697cc7557b85c4b6a33aed5b0d1 Mon Sep 17 00:00:00 2001
From: Varun j <48326355+sixthcodebrewer@users.noreply.github.com>
Date: Sun, 11 Oct 2020 17:20:11 +0530
Subject: [PATCH 3/4] Delete main.c

---
 C/HeapSort/V3/main.c | 0
 1 file changed, 0 insertions(+), 0 deletions(-)
 delete mode 100644 C/HeapSort/V3/main.c

diff --git a/C/HeapSort/V3/main.c b/C/HeapSort/V3/main.c
deleted file mode 100644
index e69de29bb..000000000

From 0e77d4eb4aa209be55f0e652ea49d789a50d86b6 Mon Sep 17 00:00:00 2001
From: Varun j <48326355+sixthcodebrewer@users.noreply.github.com>
Date: Sun, 11 Oct 2020 17:20:51 +0530
Subject: [PATCH 4/4] deleted version

---
 C/InsertionSort/v1/main.c | 59 ---------------------------------------
 1 file changed, 59 deletions(-)
 delete mode 100644 C/InsertionSort/v1/main.c

diff --git a/C/InsertionSort/v1/main.c b/C/InsertionSort/v1/main.c
deleted file mode 100644
index 76617b2e6..000000000
--- a/C/InsertionSort/v1/main.c
+++ /dev/null
@@ -1,59 +0,0 @@
-#include <stdio.h>
-#include <stdlib.h>
-#include <time.h>
-#define MAX 100000
-
-int main()
-{
-    int a[MAX];
-    int i,j,n;
-    clock_t s,e;
-    double t;
-    //size of elements 
-    printf("enter the size\n");
-    //input elements
-    scanf("%d",&n);
-    printf("enter the array elements\n");
-    for(i=0;i<n;i++)
-    {
-        a[i]=rand()%100;
-    }
-    //display_array_elements
-    printf("array element before sorting\nt");
-     for(i=0;i<n;i++)
-    {
-        printf("%d\t",a[i]);
-    }
-    //time complexity calculation
-    s=clock();
-        for(i=0;i<1000;i++)
-        for(j=0;j<1000;j++)
-            insertionSort(a,n);
-
-    e=clock();
-    t=(double)(e-s)/CLK_TCK;
-    //sorted arrays
-      printf("\narray element after sorting\n");
-     for(i=0;i<n;i++)
-    {
-        printf("%d\t",a[i]);
-    }
-    printf("\ntime taken to sort the given array is = %lf",t);
-
-}
-//function for insterion sort
-void  insertionSort(int a[],int n)
-{
-    int i,j,key;
-    for(i=1;i<=n;i++)
-    {
-        key=a[i];
-        j=i-1;
-        while(j>=0&&a[j]>key)
-        {
-            a[j+1]=a[j];
-            j=j-1;
-        }
-        a[j+1]=key;
-    }
-}