diff --git a/bubble.cpp b/bubble.cpp
new file mode 100644
index 0000000..1364c55
--- /dev/null
+++ b/bubble.cpp
@@ -0,0 +1,47 @@
+#include <iostream>
+using namespace std;
+
+int main()
+{
+    cout<<"Enter no. of input: ";
+    int n;
+    int count=0;
+    srand(time(0));
+    cin>>n;
+    unsigned short int arr[n];
+    
+    for (int i=0; i<n; i++)
+    {
+        arr[i]=rand();
+    }
+    
+    for (int i=0; i<n; i++)
+    {
+        cout<<arr[i]<<"\n";
+    }
+    
+    cout<<"\n";
+    //bubble sort
+    for(int i=0;i<n-1;i++)
+    {
+        for (int j=i,k=j+1; k<n; j++,k++)
+        {
+            if (arr[j]>arr[k])
+            {
+                int temp= arr[j];
+                arr[j] = arr[k];
+                arr[k] = temp;
+            }
+            count++;
+        }
+    }
+    
+    for (int i=0; i<n; i++)
+    {
+        cout<<arr[i]<<"\n";
+    }
+    
+    cout<<"No. of comparisons: "<<count<<"\n";
+    
+    return 0;
+}
diff --git a/insertion.cpp b/insertion.cpp
new file mode 100644
index 0000000..71909ce
--- /dev/null
+++ b/insertion.cpp
@@ -0,0 +1,48 @@
+#include <iostream>
+using namespace std;
+/*
+int main()
+{
+    cout<<"Enter no. of input: ";
+    int n;
+    int count=0;
+    srand(time(0));
+    cin>>n;
+    unsigned short int arr[n];
+    
+    for (int i=0; i<n; i++)
+    {
+        arr[i]=rand();
+    }
+    
+    for (int i=0; i<n; i++)
+    {
+        cout<<arr[i]<<"\n";
+    }
+    
+    cout<<"\n";
+    //insertion sort
+    for (int j=1; j<n; j++)
+    {
+        int k=j-1;
+        while (k>=0 && arr[k]>arr[j])
+        {
+            int temp = arr[j];
+            arr[j] = arr[k];
+            arr[k] = temp;
+            j--;
+            k--;
+        }
+        count++;
+    }
+    
+    for (int i=0; i<n; i++)
+    {
+        cout<<arr[i]<<"\n";
+    }
+    
+    cout<<"No. of comparisons: "<<count<<"\n";
+    
+    return 0;
+}
+ */
diff --git a/selection.cpp b/selection.cpp
new file mode 100644
index 0000000..3de5d24
--- /dev/null
+++ b/selection.cpp
@@ -0,0 +1,48 @@
+#include <iostream>
+using namespace std;
+/*
+int main()
+{
+    cout<<"Enter no. of input: ";
+    int n;
+    int count=0;
+    srand(time(0));
+    cin>>n;
+    unsigned short int arr[n];
+    
+    for (int i=0; i<n; i++)
+    {
+        arr[i]=rand();
+    }
+    
+    for (int i=0; i<n; i++)
+    {
+        cout<<arr[i]<<"\n";
+    }
+    
+    cout<<"\n";
+    //selection sort
+    for (int j=0; j<n; j++)
+    {
+        for (int k=j+1; k<n; k++)
+        {
+            if (arr[j]>arr[k])
+            {
+                int temp= arr[j];
+                arr[j] = arr[k];
+                arr[k] = temp;
+            }
+            count++;
+        }
+    }
+    
+    for (int i=0; i<n; i++)
+    {
+        cout<<arr[i]<<"\n";
+    }
+    
+    cout<<"No. of comparisons: "<<count<<"\n";
+    
+    return 0;
+}
+*/
diff --git a/stable_sort.cpp b/stable_sort.cpp
new file mode 100644
index 0000000..d6504a8
--- /dev/null
+++ b/stable_sort.cpp
@@ -0,0 +1,66 @@
+//
+//  stable_sort.cpp
+//  college
+//
+//  Created by Tanishq Chamola on 17/03/19.
+//  Copyright © 2019 Tanishq Chamola. All rights reserved.
+//
+
+#include <iostream>
+using namespace std;
+/*
+class num{
+public:
+    int data;
+    bool flag = false;
+};
+
+int min(num arr[],int n)
+{
+    int j=0;
+    while(arr[j].flag!=false)
+    {
+        j++;
+    }
+    int m = arr[j].data;
+    int index=j;
+    for (int l=0; l<n; l++)
+    {
+        if (arr[l].flag==false)
+        {
+            if (arr[l].data<m)
+            {
+                m=arr[l].data;
+                index=l;
+            }
+        }
+    }
+    arr[index].flag=true;
+    
+    return m;
+}
+
+int main()
+{
+    int n;
+    cin>>n;
+    int sort[n];
+    num arr[n];
+    
+    for (int i=0; i<n; i++)
+    {
+        cin>>arr[i].data;
+    }
+    
+    for (int h=0; h<n; h++)
+    {
+        sort[h] = min(arr,n);
+    }
+    
+    for (int k=0; k<n; k++)
+    {
+        cout<<sort[k]<<"\t";
+    }
+    
+    return 0;
+}*/