complete test coverage for array_list.c and delete unreachable code

optimize sorted insertion by using the infimum instead of the supremum

stable return value for binary search when there are duplicates in the array

(0) -1000 -300 -100 -30 -10 -3 +3 +10 +30 +100 tip

mercurial