-
Notifications
You must be signed in to change notification settings - Fork 0
/
Find SubArray.cpp
50 lines (45 loc) · 987 Bytes
/
Find SubArray.cpp
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
#include<iostream>
using namespace std;
int findarr(int arrmain[], int arrsub[], int sizemain, int sizesub)
{
if (sizemain>sizesub)
{
int count=0;
for(int i=0; i<sizemain; i++)
{
int subcount=0;
if (arrsub[0]==arrmain[i])
for(int j=1;j<sizesub;j++)
{
if( arrsub[j]==arrmain[j+i])
subcount++;
}
if (subcount==sizesub-1)
count++;
}
return count;
}
else
return 0;
}
int main()
{
int sizemain;
cout<<"Enter size of main array: "<<endl;
cin>>sizemain;
int *mainarr= new int[sizemain];
cout<<"Enter main array integers:"<<endl;
for (int i=0;i<sizemain;i++)
cin>>mainarr[i];
int sizesub;
cout<<"Enter size of sub array: "<<endl;
cin>>sizesub;
int *subarr=new int[sizesub];
cout<<"Enter sub array integers: "<<endl;
for (int i=0;i<sizesub;i++)
cin>>subarr[i];
int x=findarr(mainarr,subarr,sizemain,sizesub);
cout<<"Total No of occurrences: "<<x<<endl;
system("pause");
return 0;
}