Data Structures, Algorithms, & Applications in C++
Chapter 2, Exercise 27

When n < 1, the number of comparisons is zero. When n >= 1, the best-case number of comparisons is one and the worst-case number is n.