Studio More Functions

Author: vSutherland

more-on-functions/studio/part-one-find-minimum-value.js

@@ -1,10 +1,24 @@
-//1) Create a function with an array of numbers as its parameter. The function should iterate through the array and return the minimum value from the array. Hint: Use what you know about if statements to identify and store the smallest value within the array.
-
-//Sample arrays for testing:
-let nums1 = [5, 10, 2, 42];
-let nums2 = [-2, 0, -10, -44, 5, 3, 0, 3];
-let nums3 = [200, 5, 4, 10, 8, 5, -3.3, 4.4, 0];
-
-//Using one of the test arrays as the argument, call your function inside the console.log statement below.
-
-console.log(/* your code here */);
+function findMinValue(arr) {
+    if (arr.length === 0) {
+      return undefined; // Handle the case where the array is empty
+    }
+  
+    let minValue = arr[0]; // Assume the first element is the minimum
+  
+    for (let i = 1; i < arr.length; i++) {
+      if (arr[i] < minValue) {
+        minValue = arr[i]; // Update minValue if a smaller element is found
+      }
+    }
+  
+    return minValue;
+  }
+  
+  // Sample arrays for testing:
+  let nums1 = [5, 10, 2, 42];
+  let nums2 = [-2, 0, -10, -44, 5, 3, 0, 3];
+  let nums3 = [200, 5, 4, 10, 8, 5, -3.3, 4.4, 0];
+  
+  // Using one of the test arrays as the argument, call your function inside the console.log statement below.
+  console.log(findMinValue(nums1)); // Output should be 2
+  

more-on-functions/studio/part-three-number-sorting-easy-way.js

@@ -3,6 +3,22 @@ let nums1 = [5, 10, 2, 42];
 let nums2 = [-2, 0, -10, -44, 5, 3, 0, 3];
 let nums3 = [200, 5, 4, 10, 8, 5, -3.3, 4.4, 0];
 
-//Sort each array in ascending order.
+nums1.sort((a, b) => a - b); // Sort nums1 in ascending order
+nums2.sort((a, b) => a - b); // Sort nums2 in ascending order
+nums3.sort((a, b) => a - b); // Sort nums3 in ascending order
+
+console.log("Sorted in ascending order:");
+console.log(nums1); // [2, 5, 10, 42]
+console.log(nums2); // [-44, -10, -2, 0, 0, 3, 3, 5]
+console.log(nums3); // [-3.3, 0, 4.4, 4, 5, 5, 8, 10, 200]
+
 
 //Sort each array in decending order.
+nums1.sort((a, b) => b - a); // Sort nums1 in descending order
+nums2.sort((a, b) => b - a); // Sort nums2 in descending order
+nums3.sort((a, b) => b - a); // Sort nums3 in descending order
+
+console.log("Sorted in descending order:");
+console.log(nums1); // [42, 10, 5, 2]
+console.log(nums2); // [5, 3, 3, 0, 0, -2, -10, -44]
+console.log(nums3); // [200, 10, 8, 5, 5, 4.4, 4, 0, -3.3]

more-on-functions/studio/part-two-create-sorted-array.js

@@ -1,29 +1,57 @@
-function findMinValue(arr){
+function findMinValue(arr) {
   let min = arr[0];
-  for (i = 0; i < arr.length; i++){
-    if (arr[i] < min){
+  for (let i = 0; i < arr.length; i++) {
+    if (arr[i] < min) {
       min = arr[i];
     }
   }
   return min;
 }
 
-//Create a function with an array of numbers as its parameter. This function will return a new array with the numbers sorted from least to greatest value.
+function sortArray(arr) {
+  let sortedArray = [];
 
-/*Within the function:
-1) Define a new, empty array to hold the final sorted numbers.
-2) Use the findMinValue function to find the minimum value in the old array.
-3) Add the minimum value to the new array, and remove the minimum value from the old array.
-4) Repeat parts b & c until the old array is empty.
-5) Return the new sorted array.
-6) Be sure to print the results in order to verify your code.*/
-
-//Your function here...
+  while (arr.length > 0) {
+    let minValue = findMinValue(arr);
+    sortedArray.push(minValue);
+    arr.splice(arr.indexOf(minValue), 1);
+  }
 
-/* BONUS MISSION: Refactor your sorting function to use recursion below:
- */
+  return sortedArray;
+}
 
-//Sample arrays for testing:
+// Sample arrays for testing:
 let nums1 = [5, 10, 2, 42];
 let nums2 = [-2, 0, -10, -44, 5, 3, 0, 3];
 let nums3 = [200, 5, 4, 10, 8, 5, -3.3, 4.4, 0];
+
+console.log("Sorted nums1:", sortArray(nums1)); // [2, 5, 10, 42]
+console.log("Sorted nums2:", sortArray(nums2)); // [-44, -10, -2, 0, 0, 3, 3, 5]
+console.log("Sorted nums3:", sortArray(nums3)); // [-3.3, 0, 4.4, 4, 5, 5, 8, 10, 200]
+
+
+
+function findMinValue(arr) {
+  let min = arr[0];
+  for (let i = 0; i < arr.length; i++) {
+    if (arr[i] < min) {
+      min = arr[i];
+    }
+  }
+  return min;
+}
+
+function sortArray(arr) {
+  if (arr.length === 0) {
+    return [];
+  }
+
+  let minValue = findMinValue(arr);
+  arr.splice(arr.indexOf(minValue), 1);
+
+  return [minValue].concat(sortArray(arr));
+}
+
+console.log("Sorted nums1:", sortArray(nums1)); // [2, 5, 10, 42]
+console.log("Sorted nums2:", sortArray(nums2)); // [-44, -10, -2, 0, 0, 3, 3, 5]
+console.log("Sorted nums3:", sortArray(nums3)); // [-3.3, 0, 4.4, 4, 5, 5, 8, 10, 200]