I have a list of strings and I would like to insert them in order as they
come up.
I am trying to use ArrayList.BinarySearch which (theoretically) returns the
negative bitwise compliment. And I should be able to find the index of the
element one higher than where I should insert.
How?
I'm not getting it.
I created an arraylist with strings "1", "3", "5" and when I did a
BinarySearch for "2" I get (-100001). The bitwise compliment of which is
(100000), not (1) like I should expect.
And a BinarySearch for "4" returns (-200002).
I've got no idea what this is doing. How do you use this function?
Thanks in advance,
Tom Padilla