Selection Sort (#232)

day32/CPP/day32_solved.cpp

@@ -0,0 +1,47 @@
+/*
+   Author: Shubhendra Singh
+   Github: shubhendra-20
+*/
+
+#include <iostream>
+using namespace std;
+void swap(int *xp, int *yp) 
+{ 
+    int temp = *xp; 
+    *xp = *yp; 
+    *yp = temp; 
+} 
+void selectionSort(int arr[], int n) 
+{ 
+    int i, j, min_idx; 
+
+    for (i = 0; i < n-1; i++) 
+    { 
+        min_idx = i; 
+        for (j = i+1; j < n; j++) 
+          if (arr[j] < arr[min_idx]) 
+            min_idx = j; 
+
+        swap(&arr[min_idx], &arr[i]); 
+    } 
+} 
+void printArray(int arr[], int size) 
+{ 
+    int i; 
+    for (i=0; i < size; i++) 
+        cout<<arr[i]<<" "; 
+} 
+int main()
+{
+	int n;
+	cin>>n;
+	int a[n];
+	int i;
+	for(i=0;i<n;i++)
+	{
+	    cin>>a[i];
+	}
+	selectionSort(a, n); 
+	printArray(a, n);
+	return 0;
+}