/
calculator.js
124 lines (80 loc) · 1.76 KB
/
calculator.js
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
78
79
80
81
82
83
84
85
86
87
88
89
90
91
92
93
94
95
96
97
98
99
100
101
102
103
104
105
106
107
108
109
110
111
112
113
114
115
116
117
118
119
$(".result").on("click" , function(event){
var num1= $(".value1").val();
var num2= $(".value2").val();
var operation='add';
var answer= calculate(num1, num2, operation);
$(".list").text(answer);
});
results = [];
var num=[];
var choice = 'yes';
var primeNum=[];
var num1= $(".value1").val();
var num2= $(".value2").val();
function calculate (num1, num2, operation) {
switch(operation) {
case 'add' : num=parseInt(num1)+ parseInt(num2);
break;
case 'subtract': num=num1-num2;
break;
case'multiply': num=num1*num2;
break;
case'divide': num=num1/num2;
break;
case 'sumOfSquares':num= num1*num1 + num2*num2;
break;
case 'isMultipleOf':{
if(num1!=0 && num2!=0)
{
if (num1>num2 && num1%num2 === 0)
num= true;
else if(num1<num2 && num2%num1 === 0)
num=true;
else
num=false;
}
else
num=false;
}
break;
case 'primeNumbers':{
var count=0;
if (num1>num2)
{
low=num2;
high=num1
}
else
{
low=num1;
high=num2;
}
for(var i=low; i<=high; i++)
{
for(var j=2; j<=i;j++)
{
if(i%j === 0)
count++;
}
if (count === 1)
primeNum.push(i);
}
num=primeNum;
}
default: alert("This is not a vaild choice.");
break;
}
return num;
}
if (!isNaN(num1))
{
if (!isNaN(num2))
{
results.push( calculate(num1,num2,operation));
prompt(results);
}
else
alert("Invalid choice.");
}
else
alert("Invalid choice.");