updated

Author: broadwaylights

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

@@ -1,10 +1,25 @@
 //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 findMiniValue(arr) {
+  let minimum = arr[0];
 
+    for (let i = 0; i < arr.length; i++) {
+      if (arr[i] < minimum) {
+        minimum = arr[i];
+      }
+}
+
+
+
+  return minimum;
+}
 //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(findMiniValue(nums1));
+console.log(findMiniValue(nums2));
+console.log(findMiniValue(nums3));
+

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

@@ -4,5 +4,10 @@ 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(nums1.sort((a, b) => a - b));
+console.log(nums2.sort((a, b) => a - b));
+console.log(nums3.sort((a, b) => a - b));
 //Sort each array in descending order.
+console.log(nums1.sort((a, b) => b - a));
+console.log(nums2.sort((a, b) => a - b));
+console.log(nums3.sort((a, b) => a - b));

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

@@ -19,11 +19,43 @@ function findMinValue(arr){
 6) Be sure to print the results in order to verify your code.*/
 
 //Your function here...
+function sortArray(unsortedArray){
+  let newArray =[];
 
+  while(unsortedArray.length !== 0) {
+    let smallestValue = findMinValue(unsortedArray);
+    newArray.push(smallestValue);
+    unsortedArray.splice(unsortedArray.indexOf(smallestValue),1);
+    
+  }
+  return newArray;
+}
 /* BONUS MISSION: Refactor your sorting function to use recursion below:
  */
+function recursiveSortArray(unsortedArray, newArray = []) {
+  if(unsortedArray.length === 1) {
+    newArray.push(unsortedArray[0]);
+  } else {
+    newArray.push(findMinValue(unsortedArray));
+    unsortedArray.splice(unsortedArray.indexOf(findMinValue(unsortedArray)), 1);
+    recursiveSortArray(unsortedArray,newArray);
+  }
+  
+  
+  
+  return newArray;
+}
+
+
+
+
+
 
 //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(recursiveSortArray(nums1));
+console.log(recursiveSortArray(nums2));
+console.log(recursiveSortArray(nums3));