Why are logarithms in computer science considered logarithms of base-2?

Question

In a computer science textbook, I saw the following:

... so I was wondering if anyone could explain to me why.

Answer 1

One of the most common methods by which logarithms arise in computer science is to repeatedly divide an array in half, which is often found with separation and rest algorithms, such as binary search, merging, etc. In these cases, the number of times you can split an array of length n twice, before moving on to singleton arrays, this is log ₂ n.

- . , log ₂ n n. , radix, , . , GCD, , , -, .

, - , , . , "" ^x ( "" ). , , . , log ₂ n , .

, base-two CS. , AVL- , & phi; - . - e, quicksort, , , . , - - - . , , .

, . , ( ), - O (n log n) O (log n).