Answer / shruti

In binary search , we have sorted array.

Hence the last number in the array is the largest number
among the given list.. :-)


Ur interviewer has to be very intelligent.. :-)
Gud ques though..

Answer / vishnu948923

void main()
{
int a[10],i,flag,mid,low=0,high=9,num;
printf("enter how many elements");
scanf("%d",&num);

for(i=0;i<=9;i++)
scanf("%d",&a[i]);

for(mid=(low+high)/2; low<=high;mid=(low+high)/2)
{
if(a[mid]==num)
{
printf("Element position %d",mid);
flag=0;
break
}
if(a[mid]>num)
high=mid-1;
else
low=mid+1;
}
if(flag)
printf("element not present");
}

count the numbers between 100 and 300, that star with 2 and ends with 2

5 Answers   Mind Tree,

---

When should volatile modifier be used?

0 Answers  

---

pgm to find middle element of linklist(in efficent manner)

4 Answers   Huawei,

---

. Write a program to get a string and to convert the 1st letter of it to uppercase

2 Answers   HTC,

---

Write a program to swap two numbers without using third variable in c?

0 Answers  

---

what is a function method?give example?

0 Answers  

---

wat is the output int main() { char s1[]="Hello"; char s2[]="Hello"; if(s1==s2) printf("Same"); else printf("Diff"); }

3 Answers  

---

What are the advantage of c language?

0 Answers  

---

Why is c called c not d or e?

0 Answers  

---

Is c programming hard?

0 Answers  

---

Code for calculating square root without using library function, of math.h

4 Answers   IBM,

---

HOW TO SWAP TWO NOS IN ONE STEP?

16 Answers   Satyam,

---