Answer Happy

Get Free Certificate of Merit in Data Structure II Now!
advertisement


var adpushup = window.adpushup || {};
adpushup.que = adpushup.que || [];
adpushup.que.push(function () {
if (adpushup.config.platform === "MOBILE") {
adpushup.triggerAd("fdd9bf87-4faf-4493-82b4-e5538b31931a");
} else if ((window.outerWidth <= 768) || (window.outerWidth == 0)) {
adpushup.triggerAd("fdd9bf87-4faf-4493-82b4-e5538b31931a");
}
});
#include<bits/stdc++.h>
using namespace std;
 
void func(char* str2, char* str1)
{
int m = strlen(str2);
int n = strlen(str1);
for (int i = 0; i <= n - m; i++)
{
int j;
 
 
for (j = 0; j < m; j++)
if (str1[i + j] != str2[j])
break;
 
if (j == m)
cout << i << endl;
}
}
 
int main()
{
char str1[] = "1253234";
char str2[] = "323";
func(str2, str1);
return 0;
}
a) O(n)
b) O(m)
c) O(m * n)
d) O(m + n)