studio workon functions

Author: dwyci

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

@@ -7,4 +7,17 @@ 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 findMin(arr){
+    let min = arr[0];
+
+    for(i = 1; i<arr.length; i++){
+        if (arr[i]<min){
+            min = arr[i];
+        }
+
+    } return min;
+}
+    
+console.log(findMin(nums1));
+console.log(findMin(nums2));
+console.log(findMin(nums3));

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

@@ -4,5 +4,23 @@ 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("Part 3 - sort()");
 
+let num3A = [5, 10, 2, 42];
+num3A.sort(function (a, b){
+    return a-b;
+});
+
+
+let num3B = [-2, 0, -10, -44, 5, 3, 0, 3];
+num3B.sort(function(b,a){
+    return a-b;
+});
+
+
+
+let num3C = [200, 5, 4, 10, 8, 5, -3.3, 4.4, 0];
+num3C.sort(function (a,b) {
+    return b-a;
+})
 //Sort each array in decending order.

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

@@ -20,10 +20,21 @@ function findMinValue(arr){
 
 //Your function here...
 
+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];
+
+function sortNum(arr){
+  let sortedArray = [];
+  while(arr.length>0){
+    let min = findMin(arr);
+    sortedArray.push(min);
+    arr = arr.filter(num=> num !== min);
+  }
+} 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];
+