Answer: binary searches, finding the smallest or largest value in a binary search tree, and certain divide and conquer algorithms.
Step-by-step explanation: O(log N) is a common runtime complexity. Examples include binary searches, finding the smallest or largest value in a binary search tree, and certain divide-and-conquer algorithms. If an algorithm is dividing the elements being considered by 2 in each iteration, then it likely has a runtime complexity of O(log N).