This question was asked in our exam long a go and I don't remember exact words.
The scenario was, Initially you are given a set of finite data to start with, and a key value (which you have to find in a given set). Can we terminate binary search algorithm/program, if we grow the size of the data by feeding new finite data in different quantum during the search is going on.
e.g. if I am searching name of a person in a directory, and there is a on-going survey of the new connections by telecom dept., which they are transmitting in database from remote location continuously (without interruption) and those newly found data are fed in binary-search in real time.
Can we say that binary search will terminate for the key value in this scenario before new data is fed?, if yes then how to prove it?
Sorry, if I am not clear enough. I will try to explain further if required.