Algorithms and Logic

What’s inside

• What is the worst-case time complexity of binary search on a sorted array of n elements?
• Which data structure is most appropriate for implementing breadth-first search on an unweighted graph?
• Which condition guarantees that Dijkstra's algorithm produces correct shortest-path distances from a source vertex?
• What is the primary purpose of a base case in a recursive algorithm?
• In Big-O notation, a loop that repeatedly halves its input size usually has a time complexity of [____].
• A Boolean expression using AND, OR, and NOT is evaluated according to logical [____].
• In a directed graph, a sequence of vertices connected by directed edges is called a [____].
• The divide-and-conquer sorting algorithm that divides an array around a pivot is called [____].