write a function that accepts an integer/char array and an
search item.If the search item is there in the array return
position of array and value else return -1.without using
other array,without sorting,not to use more than one loop?
- 3 Answers
- 4186 Views
- Mind Tree, I also Faced
- E-Mail Answers
Answers were Sorted based on User's Feedback
Answer / nikhil srivastav (mca pesit b
int search(int *arr,int item,int arr_size)
{
int i;
for(i=0;i<arr_size;i++)
{
if(item==*(arr+i))
return i;
}
return -1;
}
| Is This Answer Correct ? | 2 Yes | 0 No |
Answer / p govind rao
#include<stdlib.h>
#include<stdio.h>
#define Max 6
int fun_rev(int *ptr, int num)
{
int i=0;
while(i<=Max)
{
if(num==*ptr)
{
return 1 ;
}
else
{
return 0;
}
i++;
ptr++;
}
}
int main()
{
int arr[Max]={3,4,5,6,2,1};
int item=6,result;
result=fun_rev(arr,item);
printf("result = %d",result);
return 0;
}
| Is This Answer Correct ? | 2 Yes | 0 No |
Answer / ashutosh tiwari
int find_num(int *arr, int *arr_num, int arr_size)
{
int i;
while((i<arr_size) && (*(arr+i) != *arr_num))
i++;
if(i >= arr_size)
return -1;
else
return i;
}
OR
int find_num(int *arr, int *arr_num, int arr_size)
{
int i;
for(i=0;i<arr_size;i++)
{
if(*(arr+i) != *arr_num)
continue;
else
return i;
}
return -1;
}
input to function will be actual array, number to be found
with its reference and array size
output will be -1 if fail otherwise number position
| Is This Answer Correct ? | 2 Yes | 1 No |
In this problem you are to write a program that will cut some number of prime numbers from the list of prime numbers between 1 and N.Your program will read in a number N; determine the list of prime numbers between 1 and N; and print the C*2 prime numbers from the center of the list if there are an even number of prime numbers or (C*2)-1 prime numbers from the center of the list if there are an odd number of prime numbers in the list.
what is ANSI and ISO
What is a ternary operator in c?
What is a pointer value and address in c?
Differentiate abs() function from fabs() function.
pick out the odd one out of the following a.malloc() b.calloc() c.free() d.realloc()
int x=5; printf("%d%d%d",x,x<<2,x>>2);
How can I sort a linked list?
Why is conio.h not required when we save a file as .c and use clrscr() or getch() ?
int i=3; this declaration tells the C compiler to a) reserve space in memory to hold the integer value b) associate the name i with this memory location c) store the value 3 at this location d) all the above
write a c program to find largest of three numbers using simple if only for one time.
Write a code of a general series where the next element is the sum of last k terms.
C 
