Skip to content

Commit 16f14af

Browse files
Update part-two-create-sorted-array.js
done
1 parent 36a0879 commit 16f14af

File tree

1 file changed

+23
-0
lines changed

1 file changed

+23
-0
lines changed

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

Lines changed: 23 additions & 0 deletions
Original file line numberDiff line numberDiff line change
@@ -19,6 +19,27 @@ function findMinValue(arr){
1919
6) Be sure to print the results in order to verify your code.*/
2020

2121
//Your function here...
22+
function sortArr(arr) {
23+
let sortedArray = [];
24+
while (arr.length > 0) {
25+
sortedArray.push(findMinValue(arr));
26+
arr.splice(arr.indexOf(findMinValue(arr)),1);
27+
}
28+
return sortedArray;
29+
}
30+
//console.log(sortArr(nums1));
31+
32+
/* Returns sortedArray correctly but each index is also an array. Because splice returns an array in this case. And push above returns a numerical value.
33+
for (let i = 0; 0 < arr.length; i++) {
34+
let min = (arr.splice(arr.indexOf(findMinValue(arr)),1));
35+
//console.log(min);
36+
sortedArray.push(min);
37+
}
38+
return sortedArray;
39+
}
40+
*/
41+
42+
2243

2344
/* BONUS MISSION: Refactor your sorting function to use recursion below:
2445
*/
@@ -27,3 +48,5 @@ function findMinValue(arr){
2748
let nums1 = [5, 10, 2, 42];
2849
let nums2 = [-2, 0, -10, -44, 5, 3, 0, 3];
2950
let nums3 = [200, 5, 4, 10, 8, 5, -3.3, 4.4, 0];
51+
52+
console.log(sortArr(nums3));

0 commit comments

Comments
 (0)