Merge pull request #21 from vikkastiwari/patch-1

added condition - It restricts unwanted execution

Author: shree1999

SortingAlgorithms/selectionSort/main.cpp

@@ -3,36 +3,45 @@
   Time Complexity = O(n^2)
   Space Complexity = O(1)
 */
-#include<iostream>
+#include <bits/stdc++.h>
 using namespace std;
 
-void swapFunction(int *num1, int *num2) {
+void swap(int *num1, int *num2)
+{
     int temp = *num1;
     *num1 = *num2;
     *num2 = temp;
 }
 
-void selectionSort(int arr[], int n) {
-    for(int i = 0; i < n - 1; i++) {
-        int min_index = i;
-        for(int j = i + 1; j < n; j++) {
-            if(arr[j] < arr[min_index]) {
-                min_index = j;
+void selectionSort(int arr[], int n)
+{
+    for (int i = 0; i < n - 1; i++)
+    {
+        int minIndex = i;
+        for (int j = i + 1; j < n; j++)
+        {
+            if (arr[j] < arr[minIndex])
+            {
+                minIndex = j;
             }
 
-            swapFunction(&arr[min_index], &arr[i]);  // swap the minimum index element and first index element
+            // swap the minimum index element and first index element
+            if (minIndex != i)
+                swap(&arr[minIndex], &arr[i]);
         }
     }
 }
 
-int main() {
+int main()
+{
     int arr[] = {10, 9, 8, 7, 6, 5, 4, 3, 2, 1};
-    int n = sizeof(arr)/sizeof(arr[0]);
+    int n = sizeof(arr) / sizeof(arr[0]);
 
     selectionSort(arr, n);
-    cout<<"Sorted Array is: ";
-    for(int i = 0; i < n; i++) {
-        cout<<arr[i]<<"  ";
+    cout << "Sorted Array is: ";
+    for (int i = 0; i < n; i++)
+    {
+        cout << arr[i] << "  ";
     }
 
     return 0;