modified SelectionSort.js (#95)

krishvsoni · web-flow · commit fe62b2fd1dab · 2023-10-29T16:34:14.000+05:30
* modified  SelectionSort.js

* added new functions
diff --git a/DSA/Arrays/SelectionSort.js b/DSA/Arrays/SelectionSort.js
@@ -1,18 +1,17 @@
 function selectionSort(arr) {
-
     for (let i = 0; i < arr.length - 1; i++) {
         let min_index = i;
         for (let j = i + 1; j < arr.length; j++) {
-            if (arr[j] > arr[min_index]) {
+            if (arr[j] < arr[min_index]) { // Changed the comparison to sort in ascending order
                 min_index = j;
             }
         }
-        let temp = arr[min_index]
-        arr[min_index] = arr[i]
+        let temp = arr[min_index];
+        arr[min_index] = arr[i];
         arr[i] = temp;
     }
-    return arr
+    return arr;
 }
 
-let arr = [4, 12, 10, 15, 2]
-console.log(selectionSort(arr))
+let arr = [4, 12, 10, 15, 2];
+console.log(selectionSort(arr)); // Output: [2, 4, 10, 12, 15]
diff --git a/DSA/Arrays/SpecialArrayWithXElementsGreaterThanEqualToX.js b/DSA/Arrays/SpecialArrayWithXElementsGreaterThanEqualToX.js
@@ -2,18 +2,28 @@
  * @param {number[]} nums
  * @return {number}
  */
- var specialArray = function(nums) {
-    for(let i=0; i<=nums.length; i++){
+var specialArray = function(nums) {
+    for (let i = 0; i <= nums.length; i++) {
         let count = 0;
-        for(let j=0; j<nums.length; j++){
-            if(nums[j] >= i){
-                count++
+        for (let j = 0; j < nums.length; j++) {
+            if (nums[j] >= i) {
+                count++;
             }
         }
-        if(count === i){
-            return i
+        if (count === i) {
+            return i;
         }
     }
-    return -1
-    
-};
+    return -1;
+};
+
+// Define an additional function to find the maximum value in the array.
+function findMaxValue(nums) {
+    return Math.max(...nums);
+}
+
+// Export the specialArray function and the findMaxValue function.
+module.exports = {
+    specialArray,
+    findMaxValue
+};

Original file line number	Diff line number	Diff line change
`@@ -1,18 +1,17 @@`
`1`	`1`	`function selectionSort(arr) {`
`2`		`-`
`3`	`2`	`for (let i = 0; i < arr.length - 1; i++) {`
`4`	`3`	`let min_index = i;`
`5`	`4`	`for (let j = i + 1; j < arr.length; j++) {`
`6`		`- if (arr[j] > arr[min_index]) {`
	`5`	`+ if (arr[j] < arr[min_index]) { // Changed the comparison to sort in ascending order`
`7`	`6`	`min_index = j;`
`8`	`7`	`}`
`9`	`8`	`}`
`10`		`- let temp = arr[min_index]`
`11`		`- arr[min_index] = arr[i]`
	`9`	`+ let temp = arr[min_index];`
	`10`	`+ arr[min_index] = arr[i];`
`12`	`11`	`arr[i] = temp;`
`13`	`12`	`}`
`14`		`- return arr`
	`13`	`+ return arr;`
`15`	`14`	`}`
`16`	`15`
`17`		`-let arr = [4, 12, 10, 15, 2]`
`18`		`-console.log(selectionSort(arr))`
	`16`	`+let arr = [4, 12, 10, 15, 2];`
	`17`	`+console.log(selectionSort(arr)); // Output: [2, 4, 10, 12, 15]`