more on functions studio

Author: Lbeckap

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

@@ -1,10 +1,22 @@
 //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.
 
+const minValue = function (arr) {
+
+let minValue = arr[0];
+for (let i = 0; i < arr.length; i++) {
+   if (arr[i] < minValue) {
+    minValue = arr[i];
+   }
+}
+
+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(/* your code here */);
+console.log(minValue(nums3));

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

@@ -3,6 +3,14 @@ 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];
 
+let testArr = nums1;
+
 //Sort each array in ascending order.
+let ascending = testArr.sort(function(a, b){return a - b});
+console.log(ascending);
 
 //Sort each array in decending order.
+let decending = testArr.sort(function(a, b){return b - a});
+console.log(decending);
+
+//Yes it does alter the array.

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

@@ -19,6 +19,29 @@ function findMinValue(arr){
 6) Be sure to print the results in order to verify your code.*/
 
 //Your function here...
+const sortedArr = function (arr) {
+  let sorted = [];
+  while (arr.length !== 0) {
+    sorted.push(findMinValue(arr));
+    arr.splice(arr.indexOf(findMinValue(arr)), 1);
+  }
+    return sorted;
+};
+
+
+// Using Recursion
+// let sorted = [];
+// const sortedArr = function (arr) {
+//   if (arr.length === 0) {
+//     console.log(`base reached`);
+//     return sorted;
+//   } else {
+//     sorted.push(findMinValue(arr));
+//     arr.splice(arr.indexOf(findMinValue(arr)), 1);
+//     //console.log(`arr is ${arr}`);
+//     return sortedArr(arr);
+//   }
+// };
 
 /* BONUS MISSION: Refactor your sorting function to use recursion below:
  */
@@ -27,3 +50,5 @@ function findMinValue(arr){
 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(sortedArr(nums2));