diff --git a/C/RemoveDuplicatesFromAnArray.c b/C/RemoveDuplicatesFromAnArray.c
new file mode 100644
index 0000000..27caebb
--- /dev/null
+++ b/C/RemoveDuplicatesFromAnArray.c
@@ -0,0 +1,44 @@
+#include <stdio.h>
+int remove_duplicate(int arr[], int n)
+{
+
+  if (n == 0 || n == 1)
+    return n;
+
+  int temp[n];
+
+  int j = 0;
+  int i;
+  for (i = 0; i < n - 1; i++)
+    if (arr[i] != arr[i + 1])
+      temp[j++] = arr[i];
+  temp[j++] = arr[n - 1];
+
+  for (i = 0; i < j; i++)
+    arr[i] = temp[i];
+
+  return j;
+}
+
+int main()
+{
+  int n;
+  scanf("%d", &n);
+  int arr[n];
+  int i;
+  for (i = 0; i < n; i++)
+  {
+    scanf("%d", &arr[i]);
+  }
+  printf("\nArray Before Removing Duplicates: ");
+  for (i = 0; i < n; i++)
+    printf("%d ", arr[i]);
+
+  n = remove_duplicate(arr, n);
+
+  printf("\nArray After Removing Duplicates: ");
+  for (i = 0; i < n; i++)
+    printf("%d ", arr[i]);
+
+  return 0;
+}
\ No newline at end of file
diff --git a/C/SelectionSort.c b/C/SelectionSort.c
new file mode 100644
index 0000000..8c0201f
--- /dev/null
+++ b/C/SelectionSort.c
@@ -0,0 +1,40 @@
+#include <stdio.h>
+void selectionSort(int arr[], int size);
+void swap(int *a, int *b);
+
+void selectionSort(int arr[], int size)
+{
+    int i, j;
+    for (i = 0 ;  i < size;i++)
+    {
+        for (j = i ; j < size; j++)
+        {
+            if (arr[i] > arr[j])
+                swap(&arr[i], &arr[j]);
+        }
+    }
+}
+
+void swap(int *a, int *b)
+{
+    int temp;
+    temp = *a;
+    *a = *b;
+    *b = temp;
+}
+
+int main()
+{
+    int array[10], i, size;
+    printf("How many numbers you want to sort:  ");
+    scanf("%d", &size);
+    printf("\nEnter %d numbers\t", size);
+    printf("\n");
+    for (i = 0; i < size; i++)
+        scanf("%d", &array[i]);
+    selectionSort(array, size);
+    printf("\nSorted array is ");
+    for (i = 0; i < size;i++)
+        printf(" %d ", array[i]);
+    return 0;
+}
\ No newline at end of file