Updated selection sort (jainaman224#1237)

Author: singh-shreya6

Selection_Sort/Selection_Sort.c

@@ -32,9 +32,14 @@ void Print_Array(int array[], int size)
 // Driver Function
 int main()
 {
-    int array[] = {2, 4, 3, 1, 6, 8, 4};
-    Selection_Sort(array, 7);
-    Print_Array(array, 7);
+    int num;
+    scanf("%d", &num);
+    int array[num];
+    for(int i = 0; i < num; i++) {
+        scanf("%d", &array[i]);
+    }
+    Selection_Sort(array, num);
+    Print_Array(array, num);
     return 0;
 }
 

Selection_Sort/Selection_Sort.cpp

@@ -33,9 +33,14 @@ void Print_Array(int array[], int size)
 // Driver Function
 int main()
 {
-    int array[] = {2, 4, 3, 1, 6, 8, 4};
-    Selection_Sort(array, 7);
-    Print_Array(array, 7);
+    int num;
+    scanf("%d", &num);
+    int array[num];
+    for(int i = 0; i < num; i++) {
+        scanf("%d", &array[i]);
+    }
+    Selection_Sort(array, num);
+    Print_Array(array, num);
     return 0;
 }
 

Selection_Sort/Selection_Sort.go

@@ -34,8 +34,15 @@ func Selection_Sort(array[] int, size int) []int {
 
 // Driver Function
 func main() {
-    array := []int{2, 4, 3, 1, 6, 8, 4}
-    fmt.Println(Selection_Sort(array, 7))
+    var num int
+    fmt.Scan(&num)
+    array := []int{}
+    for i := 0; i < num; i++ {
+        var x int
+        fmt.Scan(&x)
+        array = append(array, x)
+    }
+    fmt.Println(Selection_Sort(array, num))
 }
 
 /* 

Selection_Sort/Selection_Sort.java

@@ -1,3 +1,5 @@
+import java.util.Scanner;
+
 class Selection_Sort
 {
     // function for selection sort
@@ -30,9 +32,15 @@ public static void Print_Array(int[] array, int size)
 
     public static void main(String[] args)
     {
-        int[] array = {2, 4, 3, 1, 6, 8, 4};
-        SelectionSort(array, 7);
-        Print_Array(array, 7);
+        Scanner s = new Scanner(System.in);
+        int num;
+        num = s.nextInt();
+        int array[] = new int[num];
+        for(int i = 0; i < num; i++) {
+            array[i] = s.nextInt();
+        }
+        SelectionSort(array, num);
+        Print_Array(array, num);
     }
 }
 

Selection_Sort/Selection_Sort.py

@@ -1,27 +1,27 @@
 # Function for selection sort
-def Selection_Sort(list):
-    for i in range(0, len(list) - 1):
+def Selection_Sort(array):
+    for i in range(0, len(array) - 1):
         min_index = i
 
-        for j in range(i + 1, len(list)):
-            if list[j] < list[min_index]:
+        for j in range(i + 1, len(array)):
+            if array[j] < array[min_index]:
                 min_index = j
 
-        list[i], list[min_index] = list[min_index], list[i]
+        array[i], array[min_index] = array[min_index], array[i]
 
 # Function to print list
-def Print_list(list):
-    for i in range(0, len(list)):
-        print(list[i], end = " ")
+def Print_list(array):
+    for i in range(0, len(array)):
+        print(array[i], end = " ")
 
     print()
 
-list = [2, 4, 3, 1, 6, 8, 4]
-
-Selection_Sort(list)
-
-Print_list(list)
-
+num = int(input())
+array = []
+for i in range(0, num):
+    array.append(int(input()))
+Selection_Sort(array)
+Print_list(array)
 
 ''' Output