Cpp codes for selection sort and topological sort

CONTRIBUTORS.md

@@ -63,3 +63,8 @@
 - Place: Chennai, India
 - Bio: 3rd year CSE student at SRM university
 - Github: [Sitzz23](https://github.com/Sitzz23)
+
+#### Name: [Harshit Mittal](https://github.com/CodeWizard16)
+- Place: Delhi, India
+- Bio: Computer Science undergrad at Netaji Subhas University of Technology, Delhi, India
+- GitHub: [Harshit Mittal](https://github.com/CodeWizard16)

Sorting/Cpp/selectionsort.cpp

@@ -0,0 +1,47 @@
+#include<iostream.h>
+using namespace std;
+int selection(int[],int);
+int minimum(int *a,int n,int &min,int i)
+{
+ int j;
+ for(j=i+1;j<n;j++)
+ {
+ if(a[j]<a[min])
+ {
+ min=j;
+ }
+ }
+}
+
+int main()
+{
+ int a[100],n,i;
+ cout<<"ENTER NUMBER OF ITEMS: ";
+ cin>>n;
+
+ for(i=0;i<n;i++)
+ {
+ cout<<"ENTER ITEM "<<i+1<<":";
+ cin>>a[i];
+ }
+
+ selection(a,n);
+
+ cout<<"SORTED DATA"<<endl;
+ for(i=0;i<n;i++)
+ {
+ cout<<a[i]<<" ";
+ }
+} 
+
+int selection(int *A,int N)
+{
+ int i,min;
+
+ for(i=0;i<N-1;i++)
+ {
+ min=i;
+ minimum(A,N,min,i); 
+ swap(A[i],A[min]);
+ }
+}