There is an array of 100 integers.There is an integer 48 in the array which is now changed to "0".How you will find out that "0".What approach you will follow?

Plz. note :- It's an analytical question.
Don't write and code here.

__________________
--
Brijesh Jain

How can you found the "48"?. Use the same approach to find "0".

------------------------
suresh

Thanks suresh.

But we can't answer like that.We have to tell some approach, It may be related to programming concepts also.But main things in logic you will follow, that's what I want to know?

__________________
--
Brijesh Jain

In Data Structure one sorting order is there. That name is Quick Sort. Using that approach i will find the number.

------------------------
suresh

i will use binary search to find that integer.

Quick sort is used for sorting the array, not to find out an element from the array.

__________________
--
Brijesh Jain

" just compare each data in array with '0' the one changed will reflct itself

But it may be case that there is already other zero entries are there in the array.Because no where it has been told that there is no zero entry.

__________________
--
Brijesh Jain

then first we need to find tht where was tht 48 b/c 48 can also be many
which 48
so location of it
or there may be smthing which will tell us the recent update last made
as if we see the case of stacks the last updation made will come first
so can we use tht approch in programing from intially then we can ealisy find it out
hoe so u got wht i mean
chalo anywy thks for reply

simply concept but we didn't thing about that..

Hai guys i am new to the Game..
But i think i have a fair answer.

When a search happens to find the '48' then its probably from the start.
and the change in the 48 to 0 is made assuming the search is from the start and that we dont have any data to recover the past actions that are carried out in the array.

So as i was saying the '48' that is changed to '0' will be among the 0's that are present from the start of the array and the probablity of a 0 begin 48 will decrease when we move further towards the end of the array.

If the Direction of the search is known then this method will give a high probability of finding the changed location.

we can compare old array elements with new one if there is a change we can find
assuming we know old array elements

Hmm... is this a trick question

"0" i.e. string zero. i.e. it is a pointer. So, you have replaced an integer of 48 by an address. Assuming this, you might see a huge value. Maybe this will help us find the replaced 48?? But, this is not a guarantee as we could have a huge integer value among the remaining 99 integers.

If you did not mean string zero, then I would ask if the elements were sorted. If it were, then I would search for the first 48 and searching until I hit a number greater than 48. If there are multiple 48s, just find the one that has been zeroed before we hit a number greater than 48.

Hey guys what i think is..
we can just sum up old array.. let it be x..
not sum up new array.. it will be y..
so if the diff is 48.. (x-y = 48)
then that element is 0..
if difference is something else.. say z..
then number is 48-z...