diff --git a/C sorting/Selection.c b/C sorting/Selection.c
new file mode 100644
index 0000000..bcb4074
--- /dev/null
+++ b/C sorting/Selection.c	
@@ -0,0 +1,27 @@
+#include <stdio.h>
+int main()
+    {
+      int n,i,j, position,temp;
+      printf("Enter number of elements\t");
+      scanf("%d", &n);
+      int array[n];     
+	  printf("Enter array elements\n");
+      for (i= 0; i< n; i++)
+        scanf("%d", &array[i]);
+      for (i= 0; i< (n-1); i++)
+      {
+        position=i;
+        for (j= i+1;j<n;j++)
+        {
+          if (array[position]>array[j])
+            position=j;
+        }
+        temp= array[i];
+        array[i]=array[position];
+        array[position]=temp;
+      }
+      printf("resulting array after sorting\n");
+      for (i=0;i<n;i++)
+        printf("%d\t", array[i]);
+      return 0;
+    }
diff --git a/C sorting/binary.c b/C sorting/binary.c
new file mode 100644
index 0000000..616f0bc
--- /dev/null
+++ b/C sorting/binary.c	
@@ -0,0 +1,25 @@
+#include<stdio.h>
+int main()
+{
+    int n,i,ele,lb,ub,mid;
+    printf("Enter number of elements \t");
+    scanf("%d",&n);
+    int array[n];
+    printf("Enter array elements\n");
+    for(i=0;i<n;i++)
+    scanf("%d",&array[i]);
+    printf("Enter element to be searched\t");
+    scanf("%d",&ele);
+    lb=0,ub=n;
+    mid=(lb+ub)/2;
+    while(array[mid]!=ele&&lb<=ub)
+    {
+        if(ele<array[mid])
+            ub=mid-1;
+        else if(ele>array[mid])
+            lb=mid+1;
+        mid=(lb+ub)/2;
+    }
+    printf("Element is found at %d position",mid+1);
+    return 0;
+}
diff --git a/C sorting/insertion.c b/C sorting/insertion.c
new file mode 100644
index 0000000..45f2b80
--- /dev/null
+++ b/C sorting/insertion.c	
@@ -0,0 +1,32 @@
+#include <stdio.h>
+int main()
+{
+  int n,i,j,temp;
+ 
+  printf("Enter number of elements\t");
+  scanf("%d",&n);
+ 
+  int array[n];
+  printf("Enter array elements\n", n);
+  for (i= 0; i< n; i++)
+    scanf("%d", &array[i]);
+ 
+  for (i=1 ;i < n; i++) 
+   {
+    j=i;
+    temp = array[i];
+    while ( j> 0 && array[j-1] > temp) 
+	{
+      array[j] = array[j-1];
+	  j--;
+    }
+    array[j] = temp;
+  }
+  printf("Resulting sorted array is:\n");
+  for (i= 0; i<= n-1; i++) 
+  {
+    printf("%d\t", array[i]);
+  }
+ 
+  return 0;
+}