U have an array of +ve integers arranged in the descending
order . Write a functionb thast take an integer & an integer
array as an integer and returns the position of the given
integer in the array , if the integer is not present in the
array it should return -1 . the serching technique that u
use should be very efficient both in terms of time & memory.

Answers were Sorted based on User's Feedback



U have an array of +ve integers arranged in the descending order . Write a functionb thast take an..

Answer / argho

function desc
begin
Ineger i;
Array a[n];
x=1;
y=n;

1. for k=1 , loop from x to y while array[n] / 2;

temp[a]= a[n]/2

if temp[a] < i
call step 1 with argument x=1 y=n/2
else if temp[a] > i
call step 1 with argument x=(n/2)+1 y=n
else
return position
end

Is This Answer Correct ?    4 Yes 0 No

U have an array of +ve integers arranged in the descending order . Write a functionb thast take an..

Answer / siddarth pillai

public class Test
{
public static void main(String args[])
{
int[] arr = {99,56,31,22,17,11,9,2};
int no=11;

int position = checkPos(arr,no);

if(position == -1)
System.out.println("No such number exists in the array.");
else
System.out.println("Number "+no+" is at position "+position);
}
public static int checkPos(int[] arr,int no)
{
int first = 0;
int last = arr.length;
int mid = (first+last)/2;
int LoopCount = 0;
int MaxLoopCount = arr.length/2;

System.out.println("first : "+first+" last : "+last+" mid : "+mid);

while((arr[mid]!=no) && (LoopCount<MaxLoopCount))
{
if(no>arr[mid])
{
first = 0;
last = mid;
mid =(first+last)/2;
System.out.println("first : "+first+" last : "+last+" mid : "+mid);
}
else if(no<arr[mid])
{
last=arr.length;
first = mid;
mid =(first+last)/2;
System.out.println("first : "+first+" last : "+last+" mid : "+mid);
}
LoopCount++;

}
if(no == arr[mid])
return mid;
else
return -1;

}
}

Is This Answer Correct ?    2 Yes 0 No

U have an array of +ve integers arranged in the descending order . Write a functionb thast take an..

Answer / sonu

int array[]={13,232,234,12,34,56,73,21,230,240};
int max ;
max = 230;
for (int i=1;i<array.length;i++){
if (array[i]==max ){
System.out.println
("Position of no"+max +"in array is "+i);
}else {
System.out.println("-1");
}
}

Is This Answer Correct ?    2 Yes 12 No

Post New Answer

More Everything Else AllOther Interview Questions

What happens when centrifugal pump is operated with closed discharge valves?

0 Answers  


does any body have sap hr ess and mss configuration .

0 Answers  


when the dividend will issue by the company .if that time shares will sell by the holder who got the dividend?

0 Answers  


how should i deliver myself if i asked to introduce myself in any public place or interviews?what are the things should be highlighted and which should be dealt with less importance????

0 Answers  


What type of questions will be asked in LIC's exam for the post of Assistant Administrative Offocer?

0 Answers   LIC,






what are qualities required an area manager in pharmaceutical industries.

0 Answers  


can u send me bank po and bank clerk examination papers

0 Answers  


When we can expect the result of Bank Of Baroda's clerk paper which was held on 30-11-2008

0 Answers  


what do like and dislikes of this jobs ?

0 Answers  


milk of magnesia is a suspension od what ?

0 Answers   Baidu,


which type question in online test of lupin pharma

0 Answers   Lupin,


what is the role of marketing employee in a company.

0 Answers  


Categories