Crowdly
Додати до Chrome
Questions Bank (1402565 total)
What is the objective of the knapsack problem?
How many solution/solutions are available for a graph having negative weight cycle?
A graph is said to have a negative weight cycle when?
If n is the length of text(T) and m is the length of the pattern(P) identify the correct matching algorithm.
Rabin Karp algorithm and naive pattern searching algorithm have the same worst case time complexity.
Bellmann ford algorithm provides solution for ____________ problems.
What will be the worst case time complexity of the following code?
#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;
}