diff --git a/Selection sort b/Selection sort
new file mode 100644
index 0000000..9042562
--- /dev/null
+++ b/Selection sort	
@@ -0,0 +1,34 @@
+#include<stdio.h>
+int main(){
+   /* Here i & j for loop counters, temp for swapping,
+    * count for total number of elements, number[] to
+    * store the input numbers in array. You can increase
+    * or decrease the size of number array as per requirement
+    */
+   int i, j, count, temp, number[25];
+
+   printf("How many numbers u are going to enter?: ");
+   scanf("%d",&count);
+
+   printf("Enter %d elements: ", count);
+   // Loop to get the elements stored in array
+   for(i=0;i<count;i++)
+      scanf("%d",&number[i]);
+ 
+   // Logic of selection sort algorithm
+   for(i=0;i<count;i++){
+      for(j=i+1;j<count;j++){
+         if(number[i]>number[j]){
+            temp=number[i];
+            number[i]=number[j];
+            number[j]=temp;
+         }
+      }
+   }
+
+   printf("Sorted elements: ");
+   for(i=0;i<count;i++)
+      printf(" %d",number[i]);
+
+   return 0;
+}