Merge pull request thuva4#144 from Fcmam5/master

thuva4 · web-flow · commit 8c088194b201 · 2017-10-08T07:34:07.000+05:30
Add Python code for Selection sort and JavaScript code of Kadan's algorithm
diff --git a/Kadane's/JavaScript/kedane.js b/Kadane's/JavaScript/kedane.js
@@ -0,0 +1,16 @@
+/**
+  * Calculates the largest sum of contiguous subarray within a one-dimensional array
+  * @param {Array} array - One-dimensional array
+  * @return {Number} currentMax - The largest sum of contiguous subarrays
+  */
+function kadane(array){
+  var currentMax = max = 0;
+  for (var i = 0; i < array.length; i++) {
+    max = Math.max(0, max + array[i]);
+    currentMax = Math.max(currentMax, max);
+  }
+  return currentMax;
+}
+
+var array = [-2, -3, 4, -1, -2, 1, 5, -3];
+console.log("Maximum contiguous sum is: " + kadane(array));
diff --git a/SelectionSort/Python/selectionSort.py b/SelectionSort/Python/selectionSort.py
@@ -0,0 +1,29 @@
+def selection_sort(array):
+    """
+        Selection sort sorts an array by placing the minimum element element
+        at the beginning of an unsorted array.
+        :param array A given array
+        :return the given array sorted
+    """
+
+    length = len(array)
+
+    for i in range(0, length):
+        min_index = i # Suppose that the first (current) element is the minimum of the unsorted array
+
+        for j in range(i+1, length):
+            # Update min_index when a smaller minimum is found
+            if array[j] < array[min_index]:
+                min_index = j
+
+        if min_index != i:
+            # Swap the minimum and the initial minimum positions
+            array[min_index], array[i] = array[i], array[min_index]
+
+    return array
+
+# Example:
+if __name__ == '__main__':
+    example_array = [5, 6, 7, 8, 1, 2, 12, 14]
+    print(example_array)
+    print(selection_sort(example_array))
