diff --git a/Quicksort.exe b/Quicksort.exe
new file mode 100644
index 0000000..ead16bc
Binary files /dev/null and b/Quicksort.exe differ
diff --git a/binary search.c b/binary-search.c
similarity index 92%
rename from binary search.c
rename to binary-search.c
index 6ae56e4..e01ce4b 100644
--- a/binary search.c	
+++ b/binary-search.c
@@ -1,66 +1,66 @@
-#include<stdio.h>
-int main()
-{
-    int a[100],n,i;
-    printf("\n Enter no. of elements : ");
-    scanf("%d",&n);
-    printf("\n Enter array : ");
-    for(i=0;i<n;i++)
-    {
-        scanf("%d",&a[i]);
-    }
-    //Arrange array in ascending order.
-    int temp,j;
-    for(i=0;i<n-1;i++)
-    {
-        for(j=i+1;j<n;j++)
-        {
-            if(a[i]>a[j])
-            {
-                temp=a[i];
-                a[i]=a[j];
-                a[j]=temp;
-            }
-        }
-    }
-    printf("\n array in asc. order is : ");
-    for(i=0;i<n;i++)
-    {
-        printf("%d ",a[i]);
-    }
-    printf("\n");
-    //Binary search code.
-    int l=0,h=n-1,m=(l+h)/2;   //l,h,m contain indexes.
-    int e,flag;
-    printf("\n Enter element to search : ");
-    scanf("%d",&e);
-    while(l<=h)
-    {
-        if(e==a[m])
-        {
-            flag=1;
-            break;
-        }
-        else if(e>a[m])
-        {
-            l=m+1;
-            m=(l+h)/2;
-        }
-        else if(e<a[m])
-        {
-            h=m-1;
-            m=(l+h)/2;
-        }
-    }
-    if(flag==1)
-    {
-        printf("\n Element if found.");
-        printf("\n Position of element in sorted array is %d.",m+1);
-    }
-    else
-        printf("\n element is not in array.");
-
-        printf("\n\n")
-
-    return 0
-}
+#include<stdio.h>
+int main()
+{
+    int a[100],n,i;
+    printf("\n Enter no. of elements : ");
+    scanf("%d",&n);
+    printf("\n Enter array : ");
+    for(i=0;i<n;i++)
+    {
+        scanf("%d",&a[i]);
+    }
+    //Arrange array in ascending order.
+    int temp,j;
+    for(i=0;i<n-1;i++)
+    {
+        for(j=i+1;j<n;j++)
+        {
+            if(a[i]>a[j])
+            {
+                temp=a[i];
+                a[i]=a[j];
+                a[j]=temp;
+            }
+        }
+    }
+    printf("\n array in asc. order is : ");
+    for(i=0;i<n;i++)
+    {
+        printf("%d ",a[i]);
+    }
+    printf("\n");
+    //Binary search code.
+    int l=0,h=n-1,m=(l+h)/2;   //l,h,m contain indexes.
+    int e,flag;
+    printf("\n Enter element to search : ");
+    scanf("%d",&e);
+    while(l<=h)
+    {
+        if(e==a[m])
+        {
+            flag=1;
+            break;
+        }
+        else if(e>a[m])
+        {
+            l=m+1;
+            m=(l+h)/2;
+        }
+        else if(e<a[m])
+        {
+            h=m-1;
+            m=(l+h)/2;
+        }
+    }
+    if(flag==1)
+    {
+        printf("\n Element if found.");
+        printf("\n Position of element in sorted array is %d.",m+1);
+    }
+    else
+        printf("\n element is not in array.");
+
+        printf("\n\n");
+
+    return 0;
+}
diff --git a/binary-search.exe b/binary-search.exe
new file mode 100644
index 0000000..6aebb31
Binary files /dev/null and b/binary-search.exe differ
diff --git a/bubble sort.c b/bubble-sort.c
similarity index 89%
rename from bubble sort.c
rename to bubble-sort.c
index 338da62..fcdea48 100644
--- a/bubble sort.c	
+++ b/bubble-sort.c
@@ -1,33 +1,33 @@
-#include<stdio.h>
-int main()
-{
-    int a[100],n,i;
-    printf("\n Enter the  size of array : ");
-    scanf("%d",&n);
-    printf("\n Enter array : ");
-    for(i=0;i<n;i++)
-    {
-        scanf("%d",a[i]);
-    }
-    int j,temp;
-    //bubble sort code.
-    for(i=0;i<=n-2;i++)
-    {
-        for(j=i+1;j<=n-1;j++)
-        {
-            if(a[i]>a[j])
-            {
-                temp=a[i];
-                a[i]=a[j];
-                a[j]=temp;
-            }
-        }
-    }
-    printf("\n Your sorted array is : ");
-    for(i=0;i<n;i++)
-    {
-        printf("%d ",a[i]);
-    }
-    printf("\n\n")
-    return 0
-}
+#include<stdio.h>
+int main()
+{
+    int a[100],n,i;
+    printf("\n Enter the  size of array : ");
+    scanf("%d",&n);
+    printf("\n Enter array : ");
+    for(i=0;i<n;i++)
+    {
+        scanf("%d",a[i]);
+    }
+    int j,temp;
+    //bubble sort code.
+    for(i=0;i<=n-2;i++)
+    {
+        for(j=i+1;j<=n-1;j++)
+        {
+            if(a[i]>a[j])
+            {
+                temp=a[i];
+                a[i]=a[j];
+                a[j]=temp;
+            }
+        }
+    }
+    printf("\n Your sorted array is : ");
+    for(i=0;i<n;i++)
+    {
+        printf("%d ",a[i]);
+    }
+    printf("\n\n");
+    return 0;
+}
diff --git a/bubble-sort.exe b/bubble-sort.exe
new file mode 100644
index 0000000..7375cf3
Binary files /dev/null and b/bubble-sort.exe differ
diff --git a/cyclicsort.cpp b/cyclicsort.cpp
index 407f707..27c2f7c 100644
--- a/cyclicsort.cpp
+++ b/cyclicsort.cpp
@@ -1,4 +1,5 @@
 #include<bits/stdc++.h>
+#include<iostream>
 using namespace std;
 
 int swap(int arr[],int first,int second){
@@ -35,4 +36,5 @@ int main(){
     for(int i=0;i<n;i++){
         cout<<arr[i]<<" ";
     }
+    return 0;
 }
\ No newline at end of file
diff --git a/cyclicsort.exe b/cyclicsort.exe
new file mode 100644
index 0000000..ddcda23
Binary files /dev/null and b/cyclicsort.exe differ
diff --git a/insertion sort.c b/insertion-sort.c
similarity index 92%
rename from insertion sort.c
rename to insertion-sort.c
index e2fb091..43726de 100644
--- a/insertion sort.c	
+++ b/insertion-sort.c
@@ -1,33 +1,33 @@
-#include<stdio.h>
-int main()
-{
-    int a[100],i,n;
-    printf("\n Enter no. of elements : ");
-    scanf("%d",&n);
-    printf("\n Enter array : ");
-    for(i=0;i<n;i++)
-    {
-        scanf("%d",&a[i]);
-    }
-    int temp,j;
-    //insertion sort code.
-    for(i=1;i<n;i++)
-    {
-        temp=a[i];
-        for(j=i-1;j>=0;j--)
-        {
-            if(temp<a[j])    //ascending order.
-            {
-                a[j+1]=a[j];    //shift greater value to next index.
-                a[j]=temp;
-            }
-        }
-    }
-    printf("\n Your array in asc. order is : ");
-    for(i=0;i<n;i++)
-    {
-        printf("%d ",a[i]);
-    }
-    printf("\n\n")
-    return 0;
-}
+#include<stdio.h>
+int main()
+{
+    int a[100],i,n;
+    printf("\n Enter no. of elements : ");
+    scanf("%d",&n);
+    printf("\n Enter array : ");
+    for(i=0;i<n;i++)
+    {
+        scanf("%d",&a[i]);
+    }
+    int temp,j;
+    //insertion sort code.
+    for(i=1;i<n;i++)
+    {
+        temp=a[i];
+        for(j=i-1;j>=0;j--)
+        {
+            if(temp<a[j])    //ascending order.
+            {
+                a[j+1]=a[j];    //shift greater value to next index.
+                a[j]=temp;
+            }
+        }
+    }
+    printf("\n Your array in asc. order is : ");
+    for(i=0;i<n;i++)
+    {
+        printf("%d ",a[i]);
+    }
+    printf("\n\n");
+    return 0;
+}
diff --git a/linear searching.c b/linear-searching.c
similarity index 95%
rename from linear searching.c
rename to linear-searching.c
index 18fe1e8..3d79c5a 100644
--- a/linear searching.c	
+++ b/linear-searching.c
@@ -1,29 +1,29 @@
-#include<stdio.h>
-int main()
-{
-    int a[1000],n,i,e;
-    printf("\n Enter number of elements : ");
-    scanf("%d",&n);
-    printf("\n Enter the array : ");
-    for(i=0;i<n;i++)
-    {
-        scanf("%d",&a[i]);
-    }
-    printf("\n Enter element to search : ");
-    scanf("%d",&e);
-    for(i=0;i<n;i++)
-    {
-        if(e==a[i])
-        {
-            printf("\n Element is found.");
-            printf("\n position of element in array is : %d",i+1);
-            break;
-        }
-        if(i==(n-1))
-        {
-            printf("\n Element not found in the array!!");
-        }
-    }
-    printf("\n\n");
-    return 0;
-}
+#include<stdio.h>
+int main()
+{
+    int a[1000],n,i,e;
+    printf("\n Enter number of elements : ");
+    scanf("%d",&n);
+    printf("\n Enter the array : ");
+    for(i=0;i<n;i++)
+    {
+        scanf("%d",&a[i]);
+    }
+    printf("\n Enter element to search : ");
+    scanf("%d",&e);
+    for(i=0;i<n;i++)
+    {
+        if(e==a[i])
+        {
+            printf("\n Element is found.");
+            printf("\n position of element in array is : %d",i+1);
+            break;
+        }
+        if(i==(n-1))
+        {
+            printf("\n Element not found in the array!!");
+        }
+    }
+    printf("\n\n");
+    return 0;
+}
diff --git a/selection sort.c b/selection-sort.c
similarity index 93%
rename from selection sort.c
rename to selection-sort.c
index 7d4902c..ddf1cb3 100644
--- a/selection sort.c	
+++ b/selection-sort.c
@@ -1,39 +1,39 @@
-#include<stdio.h>
-int main()
-{
-    int a[100],n,i;
-    printf("\n Enter  the no. of elements : ");
-    scanf("%d",&n);
-    printf("\n Enter array : ");
-    for(i=0;i<n;i++)
-    {
-        scanf("%d",&a[i]);
-    }
-    //selection sort code.
-    int j,temp,min,add;
-    for(i=0;i<=n-2;i++)
-    {
-      min=a[i];
-      add=i;
-      for(j=i+1;j<=n-1;j++)
-      {
-          if(min>a[j])      // sort in ascending order
-          {
-              min=a[j];
-              add=j;
-          }
-      }
-      //swap min and a[i].
-      temp=a[i];
-      a[i]=a[add];
-      a[add]=temp;
-    }
-    printf("\n  this Your sorted array is : ");
-    int k;
-    for(k=0;k<n;k++)
-    {
-        printf("%d ",a[k]);
-    }
-    printf("\n\n");
-    return 0
-}
+#include<stdio.h>
+int main()
+{
+    int a[100],n,i;
+    printf("\n Enter  the no. of elements : ");
+    scanf("%d",&n);
+    printf("\n Enter array : ");
+    for(i=0;i<n;i++)
+    {
+        scanf("%d",&a[i]);
+    }
+    //selection sort code.
+    int j,temp,min,add;
+    for(i=0;i<=n-2;i++)
+    {
+      min=a[i];
+      add=i;
+      for(j=i+1;j<=n-1;j++)
+      {
+          if(min>a[j])      // sort in ascending order
+          {
+              min=a[j];
+              add=j;
+          }
+      }
+      //swap min and a[i].
+      temp=a[i];
+      a[i]=a[add];
+      a[add]=temp;
+    }
+    printf("\n  this Your sorted array is : ");
+    int k;
+    for(k=0;k<n;k++)
+    {
+        printf("%d ",a[k]);
+    }
+    printf("\n\n");
+    return 0;
+}