Binary search on sorted array of strings complexity in terms of string length

Question

For a size n sorted array of strings, binary search would take O(log n) in terms of n. However, what would be the run time in terms of the length of strings?

Isaac Kleinman · Accepted Answer · 2016-03-16 18:57:14Z

1

The complexity of string comparison is linear time with respect to the string length, so, in this case, letting m = string length, the complexity would be

O(m lg n).

answered Mar 16, 2016 at 18:57

Isaac Kleinman

4,5924 gold badges33 silver badges36 bronze badges

Sign up to request clarification or add additional context in comments.

Collectives™ on Stack Overflow

Binary search on sorted array of strings complexity in terms of string length

1 Answer 1

Comments

Your Answer

Hot Network Questions

Collectives™ on Stack Overflow

1 Answer 1

Comments

Your Answer

Sign up or log in

Post as a guest

Related