-
Notifications
You must be signed in to change notification settings - Fork 0
Expand file tree
/
Copy patharray8.js
More file actions
79 lines (63 loc) · 1.32 KB
/
array8.js
File metadata and controls
79 lines (63 loc) · 1.32 KB
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
//In given two arrays 1,2,3,4,5 and 2,3,1,0,5 find which number is not present in the second array
/*var array1 = ["1","2","3","4","5"];
var array2 = ["2","3","1","0","5"];
var array3 = new Array();
var k=0;
for(var i=0;i<array1.length;i++)
{
for(var j=0;j<array2.length;j++)
{
while(array1[i]!=array2[j])
{
console.log(array1[i]);
}
}*/
/*var a = [1, 2, 3, 4, 5];
var b = [2, 3, 1, 0, 5]
findMissingNumber(a, b);
function findMissingNumber(a,b)
{
for (var n=0;n<a.length;n++)
{
if (!isPresent(n, b))
{
console.log("missing number: " + n);
break;
}
}
}
function isPresent(n, b)
{
for (var i=0; i<b.length; i++)
{
if (n == i)
{
return true;
}
}
return false;
}
*/
//Working here
var array1 = [1,2,3,4,5];
var array2 = [2,3,1,0,5];
var ifpresent=false;
for(var i=0;i<array1.length;i++)
{
for(var j=0;j<array2.length;j++)
{
if(array1[i]==array2[j])
{
ifpresent=true;
break;
}
else
{
}
}
if(ifpresent==false) //if(!ifpresent)
{
console.log(array1[i]+" is not present in the second array");
}
ifpresent=false;
}