Finding the index of a given value in a pre-sorted array

Posted by bobo on Stack Overflow See other posts from Stack Overflow or by bobo
Published on 2010-03-16T13:07:47Z Indexed on 2010/03/16 13:16 UTC
Read the original article Hit count: 191

Filed under:

array

|

binary-trees

|

algorithm

|

php

Today, I went for an interview and the interviewer asked me how I would find the index of a given value (number) in a pre-sorted array like this:

$preSortedArr=array(23,32,36,41,45,54);

He also said that using recursion is not allowed.

I think the function should look like this:

function findIndexByValue($preSortedArray,$value){            
//some codes here       
}

What solution do you think he was expecting from me?

EDIT: sorry, I forgot to add that, he originally asked me to write psuedo codes but I said I don't know. I tried to write in PHP, but I think he's expecting a language-independent solution.

© Stack Overflow or respective owner

Related posts about array

Array reverse and Array sort on One int array and store into another array using delgate

as seen on Stack Overflow - Search for 'Stack Overflow'
Array reverse and Array Sort on an int array and store into another array using a delegate. We have to accept the elements from the user >>> More
LWJGL Voxel game, glDrawArrays

as seen on Game Development - Search for 'Game Development'
I've been learning about 3D for a couple days now. I managed to create a chunk (8x8x8). Add optimization so it only renders the active and visible blocks. Then I added so it only draws the faces which don't have a neighbor. Next what I found from online research was that it is better to use glDrawArrays… >>> More
Sorting a Multidimensional array...

as seen on Stack Overflow - Search for 'Stack Overflow'
I need to sort an array that can look like this: $array[4][0] = array('id' => 1, 'value' => 2); $array[3][2] = array('id' => 0, 'value' => 3); $array[4][1] = array('id' => 1, 'value' => 0); $array[1][3] = array('id' => 2, 'value' => 1); $array[1][1] = array('id' => 3, 'value'… >>> More
why i add more insignificant code but cost less time

as seen on Stack Overflow - Search for 'Stack Overflow'
i write a method and when i add some insignificant code it works faster, like these : array[1]=array[1]; array[0]=array[0]; array[3]=array[3]; array[2]=array[2]; i use double t=System.currentTimeMillis(); at first to record the time. then call the method and use System.out.println(System.currentTimeMillis()-t);… >>> More
Difference between array('Acl' => array('type' => 'requester')) and array('Acl' => 'requester') in C

as seen on Stack Overflow - Search for 'Stack Overflow'
I'm following the ACL tutorial for CakePHP 1.3 and I was wondering if there is a functional difference between declaring a behavior like this: var $actsAs = array('Acl' => 'requester'); and like this: var $actsAs = array('Acl' => array('type' => 'requester')); >>> More

Related posts about binary-trees

Binary Trees in Scheme

as seen on Stack Overflow - Search for 'Stack Overflow'
Consider the following BNF defining trees of numbers. Notice that a tree can either be a leaf, a node-1 with one subtrees, or a node-2 with two subtrees. tree ::= (’leaf number) | (’node-1 tree) | (’node-2 tree tree) a. Write a template for recursive procedures on these trees. b. Define the procedure… >>> More
C++ design question on traversing binary trees

as seen on Stack Overflow - Search for 'Stack Overflow'
I have a binary tree T which I would like to copy to another tree. Suppose I have a visit method that gets evaluated at every node: struct visit { virtual void operator() (node* n)=0; }; and I have a visitor algorithm void visitor(node* t, visit& v) { //do a preorder traversal using… >>> More
Priority queues and Binary trees

as seen on Stack Overflow - Search for 'Stack Overflow'
Trying to create a game using priority queues and binary tree, for example a solitaire game. I hope this is not to vague? >>> More
What are the applications of binary trees?

as seen on Stack Overflow - Search for 'Stack Overflow'
I am wondering what the particular applications of binary trees are. Could you give some real examples? Thanks. >>> More
A deque based on binary trees

as seen on Programmers - Search for 'Programmers'
This is a simple immutable deque based on binary trees. What do you think about it? Does this kind of data structure, or possibly an improvement thereof, seem useful? How could I improve it, preferably without getting rid of its strengths? (Not in the sense of more operations, in the sense of different… >>> More