week4/RecursiveNotes.js at master · AdityaRespati/week4 · GitHub

1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
59
60
61
62
63
64
65
66
67
68
69
70
71
72
73
74
75
76
77

function sqr(x, y) {
    if (y === 1) {
        return x
    } else {
        return x * sqr(x, y - 1);
    }
}

console.log(sqr(2, 3));

//square
function sqr(x, y) {
    return (y === 1) ? x : x * sqr(x, y - 1)
}
console.log(sqr(2, 3));

//Sum up to

function sumTo(n) {
    if (n === 1) {
        return n
    } else {
        return n + sumTo(n - 1)
    }
}
console.log(sumTo(4))

//faktorial

function factorial(n) {
    if (n === 1) {
        return n
    } else {
        return n * factorial(n - 1)
    }
}

console.log(factorial(5))

//fibonaci

function fib(n) {
    if (n == 1 || n == 2) {
        return n
    } else {
        return fib(n-1)+fib(n-2)
    }
}

console.log(fib(5));

// swap

var input = [2, 8, 3, 9, 5, 6] ;

for (i = 0; i <= input.length-1; i++) {
    if (input[i] > input[i + 1]) {
        [input[i], input[i + 1]] = [input[i + 1], input[i]]
    }
}

console.log(input);

sortup

var input = [2, 81, 3, 9, 5, 6, 7, 8, 1, 4] ;

for(j= input.length; j>=1; j--){
    for (i = 0; i <= j-1; i++) {
        if (input[i] > input[i + 1]) {
            [input[i], input[i + 1]] = [input[i + 1], input[i]]
        }
    }
}

console.log(input);