Algorithm Analysis Flashcard

Front

What is the time complexity of accessing an element in an array by its index?

Back

O(1)

Front

Which of the following sorting algorithms has the best average-case time complexity? Bubble Sort, Insertion Sort, Merge Sort, Selection Sort

Back

Merge Sort

Front

What is the space complexity of a recursive algorithm that makes a recursive call each time it executes?

Back

O(n)

Front

In Big O notation, O(n^2) represents which type of complexity?

Back

Quadratic

Front

Which algorithm uses a divide and conquer approach? Options: Radix Sort, Quick Sort, Bubble Sort, Counting Sort

Back

Quick Sort

Front

What is the worst-case time complexity of binary search on a sorted array?

Back

O(log n)

Front

Which of the following is NOT a characteristic of a greedy algorithm?
Making the locally optimal choice,
Not considering the global situation,
Always finding the optimal solution,
Efficiently solving optimization problems

Back

Always finding the optimal solution

Front

What is the main drawback of Dijkstra's algorithm?

Back

It cannot handle negative edge weights

Front

In a binary tree, what is the maximum number of nodes at depth d?

Back

2^d

Front

Which algorithm is primarily used for network flow problems?

Back

Ford-Fulkerson