Chapter 11 Studio

Author: craigfili

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

@@ -1,10 +1,18 @@
 //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.
-
+function findMin (array){
+    let minVal = array[0];
+    for (let i = 0; i < array.length; i++){
+        if (array[i] < minVal){
+            minVal = array[i];
+        }
+    }
+    return minVal;
+}
 //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 */);
+console.log(findMin(nums3));

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

@@ -4,5 +4,7 @@ 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.
+console.log(nums2.sort(function(a, b){return a - b}));
 
 //Sort each array in descending order.
+console.log(nums2.reverse());

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

@@ -19,11 +19,20 @@ function findMinValue(arr){
 6) Be sure to print the results in order to verify your code.*/
 
 //Your function here...
-
+function arraySort(array){
+  let sortedArray = [];
+  while (array.length > 0){
+  sortedArray.push(findMinValue(array));
+  array.splice(array.indexOf(findMinValue(array)), 1);
+  }
+  return sortedArray;
+}
 /* BONUS MISSION: Refactor your sorting function to use recursion below:
  */
 
 //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(arraySort(nums3));