binary search (l+r)/2 or (l+r+1)/2 i saw this on a topcoder article that one or the other will no give while loop↵
but on some test cases both might not as can be seen in submission [submission:76258234] is where i changed (r+l)/2 to r+l+1/2↵
from this submission [submission:76258059] and my solution passed so how to decide which one will never give a while loop right now i just do it randomly one and if that doesnt pass i do other
but on some test cases both might not as can be seen in submission [submission:76258234] is where i changed (r+l)/2 to r+l+1/2↵
from this submission [submission:76258059] and my solution passed so how to decide which one will never give a while loop right now i just do it randomly one and if that doesnt pass i do other
