二分探索
↑ O記法では定数倍を無視できるので、単に O ( log  n ) {\displaystyle O(\log n)} とも書ける。
↑ Knuth, Donald (1997). “Section 6.2.1: Searching an Ordered Table”. Sorting and Searching. The Art of Computer Programming. 3 (3rd ed.). Addison-Wesley. pp. 409–426. ISBN 0-201-89685-0
↑ Pattis, Richard E. (1988). “Textbook errors in binary searching”. SIGCSE Bulletin 20: 190–194. doi:10.1145/52965.53012. cited at Kruse, Robert (1998). Data Structures and Program Design in C++. Prentice Hall. p. 280. ISBN 0-13-768995-0
↑ Bug ID: JDK-5045582 (coll) binarySearch() fails for size larger than 1<<30