Question
#include<stdio.h>
#include<stdlib.h>
struct Node
{
int val;
struct Node* next;
}*head;
int linear_search(struct Node *temp,int value)
{
if(temp == 0)
return 0;
if(temp->val == value)
return 1;
return linear_search(temp->next, value);
}
int main()
{
int arr[6] = {1,2,3,4,5,6};
int n = 6,i;
head = (struct Node*)malloc(sizeof(struct Node));
head->next = 0;
struct Node *temp;
temp = head;
for(i=0; i<n; i++)
{
struct Node *newNode = (struct Node*)malloc(sizeof(struct Node));
newNode->next = 0;
newNode->val = arr[i];
temp->next = newNode;
temp = temp->next;
}
int ans = linear_search(head->next,6);
if(ans == 1)
printf("Found");
else
printf("Not found");
return 0;
}
a.
5
b.
6
c.
7
d.
8
Posted under Data Structures and Algorithms
Engage with the Community - Add Your Comment
Confused About the Answer? Ask for Details Here.
Know the Explanation? Add it Here.
Q. How many times is the function linear_search() called when the following code is executed?
Similar Questions
Discover Related MCQs
Q. What will be time complexity when binary search is applied on a linked list?
View solution
Q. Can binary search be applied on a sorted linked list in O(Logn) time?
View solution
Q. What is the time complexity of the above implementation of linear search on a linked list?
View solution
Q. Which of the following methods can be used to search an element in a linked list?
View solution
Q. What is the time complexity of the above recursive implementation of linear search?
View solution
Q. Consider the array {1,1,1,1,1}:
Which of the following techniques can be used to search an element in the above array?
View solution
Q. Which of the following techniques can be used to search an element in an unsorted array?
View solution
Q. What is the time complexity of the recursive implementation used to find the largest and smallest element in a linked list?
View solution
Q. What is the time complexity of the above iterative code used to find the smallest and largest element in a linked list?
View solution
Q. Which of the following methods can be used to find the largest and smallest number in a linked list?
View solution
Q. What is the time complexity of the above recursive implementation used to find the largest and the smallest element in an array?
View solution
Q. What is the time complexity of the above iterative implementation used to find the largest and smallest element in an array?
View solution
Q. Which of the following methods can be used to find the largest and smallest element in an array?
View solution
Q. What is the time complexity of the above recursive implementation used to find the length of the string?
View solution
Q. Which of the following can be the base case for the recursive implementation used to find the length of a string?
View solution
Q. Which of the following can be the base case for the recursive implementation used to find the length of linked list?
View solution
Q. What is the time complexity of the above iterative implementation used to find the length of a linked list?
View solution
Q. What is the space complexity of the recursive implementation used to convert a decimal number to its binary equivalent?
View solution
Q. What is the time complexity of the recursive implementation used to convert a decimal number to its binary equivalent?
View solution
Q. Which of the following is the binary representation of 100?
View solution
Suggested Topics
Are you eager to expand your knowledge beyond Data Structures and Algorithms? We've curated a selection of related categories that you might find intriguing.
Click on the categories below to discover a wealth of MCQs and enrich your understanding of Computer Science. Happy exploring!
