|
1 | 1 | // Iteration #1: Find the maximum
|
2 |
| -function maxOfTwoNumbers() {} |
| 2 | +function maxOfTwoNumbers(num1, num2) { |
| 3 | + if (num1>num2){ |
| 4 | + return num1 |
| 5 | + } |
| 6 | + else if (num1<num2) { |
| 7 | + return num2 |
| 8 | + } |
| 9 | + else { |
| 10 | + return [num1,num2] |
| 11 | + } |
| 12 | +} |
3 | 13 |
|
4 | 14 |
|
5 | 15 |
|
6 | 16 | // Iteration #2: Find longest word
|
7 | 17 | const words = ['mystery', 'brother', 'aviator', 'crocodile', 'pearl', 'orchard', 'crackpot'];
|
8 | 18 |
|
9 |
| -function findLongestWord() {} |
| 19 | +function findLongestWord(words) { |
| 20 | + if (words.length===0){ |
| 21 | + return null; |
| 22 | + } |
| 23 | + else if (words.length===1){ |
| 24 | + return words[0]; |
| 25 | + } |
| 26 | + else { |
| 27 | + var longitudInicial=0; |
| 28 | + var palabraMasLarga=""; |
10 | 29 |
|
| 30 | + for (var i=0; i<words.length; i++){ |
| 31 | + longitudActual = words[i].length; |
| 32 | + if (longitudActual>longitudInicial){ |
| 33 | + longitudInicial = longitudActual |
| 34 | + palabraMasLarga = words [i] |
| 35 | + } |
| 36 | + } |
| 37 | + return palabraMasLarga |
| 38 | + } |
| 39 | + } |
11 | 40 |
|
12 | 41 |
|
13 |
| -// Iteration #3: Calculate the sum |
14 |
| -const numbers = [6, 12, 1, 18, 13, 16, 2, 1, 8, 10]; |
15 | 42 |
|
16 |
| -function sumNumbers() {} |
17 | 43 |
|
| 44 | +// Iteration #3: Calculate the sum |
| 45 | +const numbers = [6, 12, 1, 18, 13, 16, 2, 1, 8, 10]; |
18 | 46 |
|
| 47 | +function sumNumbers(numbers) { |
| 48 | + if (numbers.length === 0){ |
| 49 | + return 0; |
| 50 | + } |
| 51 | + else if (numbers.length === 1){ |
| 52 | + return numbers [0] |
| 53 | + } |
| 54 | + else { |
| 55 | + |
| 56 | + var suma =0 |
| 57 | + for (var i=0; i<numbers.length; i++){ |
| 58 | + suma += numbers [i] |
| 59 | + } |
| 60 | + return suma |
| 61 | +} |
| 62 | +} |
| 63 | +console.log (sumNumbers(numbers)); |
19 | 64 |
|
20 | 65 | // Iteration #3.1 Bonus:
|
21 | 66 | function sum() {}
|
|
0 commit comments