1. Which of the following searching algorithm is fastest?
2. Interpolation search performs better than binary search when?
3. What is the formula used for calculating the position in interpolation search?
(x = element being searched, A[] = input array, low and high are the leftmost and rightmost index of A[] respectively)
(x = element being searched, A[] = input array, low and high are the leftmost and rightmost index of A[] respectively)
4. Jumps are made in the jump search algorithm until . . . . . . . .
5. What is the best case for linear search?
6. What will be the auxiliary space 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;
}
#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;
}7. Linear search(recursive) algorithm used in . . . . . . . .
8. In which of the following case jump search performs better than interpolation search?
9. Best case of jump search will have time complexity of . . . . . . . .
10. What are the updated values of high and low in the array if the element being searched is greater than the value at calculated index in interpolation search? (pos = current position)
Read More Section(Searching Algorithms)
Each Section contains maximum 100 MCQs question on Searching Algorithms. To get more questions visit other sections.