H446 Algorithms

What is the time complexity of a binary search algorithm in the best case scenario?

• O(n)

• O(n^2)

• O(1)

• O(log n)

Which of the following is a characteristic of a binary tree search algorithm?

• The number of items to be searched is doubled with each pass

• The number of items to be searched is halved with each pass

• The number of items to be searched remains constant with each pass

• The number of items to be searched is tripled with each pass

What is the time complexity of a linear search algorithm in the average case scenario?

• O(1)

• O(n)

• O(log n)

• O(n^2)

According to the Big-O Notation chart, which complexity class is considered the most efficient?

• Exponential

• Polynomial

• Logarithmic

• Constant

What is the time complexity of the bubble sort algorithm after the first pass, given the initial array [7, 6, 4, 3]?

• [4, 3, 6, 7]

• [6, 4, 3, 7]

• [7, 4, 3, 6]

• [3, 4, 6, 7]

What is the best case time complexity of Bubble Sort?

• O(n)

• O(n log n)

• O(n^2)

• O(1)

Which sorting algorithm is considered slightly more efficient in most average situations according to the text?

• Bubble Sort

• Insertion Sort

• Merge Sort

• Quick Sort

What is the space complexity of both Bubble Sort and Insertion Sort?

• O(n)

• O(n log n)

• O(n^2)

• O(1)

How does the merge function in Merge Sort work?

• It divides the list into two halves and sorts them independently.

• It recursively subdivides the list until it consists of individual items.

• It combines two sorted lists into one sorted list.

• It sorts the list using a divide and conquer approach without combining lists.

What is the space complexity of Merge Sort?

• O(n)

• O(n log n)

• O(n^2)

• O(1)