sarathsomana
BAN USERint guesser(int a[],int size,int key){
int guessIndex = 0;
while(a[guessIndex] != key && guessIndex < size){
if(key > a[guessIndex])
guessIndex += key - a[guessIndex];
else
{
guessIndex += a[guessIndex] - key;
}
}
if(guessIndex >= size) return -1;
return guessIndex;
}
Repmarthajpatton, Data Scientist at AppPerfect
Managed a small team implementing gravy in Prescott, AZ. Developed several new methods for easy break up spells.Had some ...
Reprohitrana0777, Animator at AMD
I am work in free lancing as a editor in web developer. I also like play sports. I like kabaddi ...
Repthonylermat, OOPS Experienced at 247quickbookshelp
I have been assigned based on the successful candidate's level of training and experience but will include types of ...
This can be solved using LCS algorithm but, the constraint is we have a 2 files of billion lines each and LCS has O(n^2) space as well as time complexity. This approach is hence not advisable for this. Better use hashTables.
- sarathsomana June 15, 2013