FiltersDone

Question type

Essay

Multiple Choice

Short Answer

True False

Matching

Exam 12: Searching and Sorting

Show Answer

Share

---

All types

Filters

Study FlashcardsPractice ExamLearn

Question 21

True/False

Review LaterAdd Note

Review Later

Every algorithm for a problem has the same efficiency.

Correct Answer

verified

Show Answer

Question 22

True/False

Review LaterAdd Note

Review Later

If there are more items in a search pool, then it will typically require more comparisons to find an item.

Correct Answer

verified

Show Answer

Question 23

Essay

Review LaterAdd Note

Write out the state of the list while being sorted using the selection sort algorithm:

Which of the following algorithms has a worst case complexity of O(n log₂n) ?

Explain how quick sort works.

Explain how merge sort works.

A linear search always requires more comparisons than a binary search.

In a binary search, _______________________________ .

Quick sort works by separating a list into two lists, and recursively sorting the two lists using quick sort.

The __________________ algorithm sorts a list of values by repetitively inserting a particular value into a subset of the list that has already been sorted.

Write a method that accepts an integer array as a parameter and sorts it using the bubble sort algorithm.

Write a method that accepts an array of integers as a parameter and sorts them using the selection sort algorithm.

To represent constant time complexity we use O(c).

What is the complexity of the following code (in terms of the length of the array)? for(int i = 0; i < 5; i++) System.out.println(array[i]);

The ___________________ of an algorithm shows the relationship between the size of the problem and the value we hope to optimize.

Bubble sort works by separating a list into two lists, recursively sorting the two lists using bubble sort, and then combining the sorted sublists into a sorted list.

Which of the following algorithms has a worst-case complexity of O(n²) ?

With each comparison, a binary search eliminates approximately half of the items remaining in the search pool.

The selection sort algorithm sorts a list of values by repeatedly putting a particular value into its final, sorted position.

Which of the following algorithms is most easily expressed recursively?