判断题：The worst cast time complexity of Binary Search is always ...

The worst cast time complexity of Binary Search is always $$O(\log n)$$ where $$n$$ is the number of sorted integers.

答案：FALSE