FiltersDone

Question type

Essay

Multiple Choice

Short Answer

True False

Matching

Exam 3: Searching, Sorting, and Complexity Analysis

Show Answer

Share

---

All types

Filters

Study FlashcardsPractice ExamLearn

Question 31

True/False

Review LaterAdd Note

Review Later

The order of complexity of a linear-time algorithm is Oⁿ .

A) True
B) False

Correct Answer

verified

Show Answer

Question 32

Multiple Choice

Review LaterAdd Note

Review Later

What type of algorithm is the following code? N = len(myList) While n > 1: I = 1 While i < n: If myList[ i ] < myList[ i - 1 ]: Swap(myList, i, i - 1) I += 1 N -= 1

A) linear sort
B) bubble sort
C) insertion sort
D) selection sort

E) A) and B)
F) C) and D)

Correct Answer

verified

Show Answer

Question 33

True/False

Review LaterAdd Note

The performance of an algorithm in a single loop is linear.

In a selection sort, the inner loop is executed n - 2 times for every pass through the outer loop.

Benchmarking is the process of using the computer's clock to obtain run time information for an algorithm.

The time() function returns the amount of time a program has been running in seconds.

What type of algorithm is the following code? I = 0 While i < len(myList) - 1: MinIndex = i J = i + 1 While j < len(myList) : If myList[ j ] < myList[ minIndex ]: MinIndex = j J += 1 If minIndex != i: Swap(myList, minIndex, i) I += 1

How can the following algorithm be described? left = 0 Right = len(sortedLyst) - 1 While left <= right: Midpoint = (left + right) // 2 If target == sortedLyst[midpoint]: Return midpoint Elif target < sortedLyst[midpoint]: Right = midpoint - 1 Else: Left = midpoint + 1 Return -1

What type of algorithm is list indexing an example of?

An analysis of an algorithm's complexity divides its behavior into what three types of cases?