Python Review Module 16 - Searching Sorting Algorithm

A(n) ______ is a sequence of steps for accomplishing a task.

• structure

• algorithm

• linear sort

• order of complexity

Linear search is a search algorithm that sorts the list _____.

• in descending order and then searches the list until the search key is found

• in ascending order and then searches the list until the search key is found

• by splitting the list into two halves and searching each half until the search key is found

• from the start of a list and checks each element until the search key is found

In which scenario can a binary search be used to find an element?

• A list of students’ weights and heights for a class

• A list of client details for a company

• An alphabetical list of employee names

• A list of students’ marks for a class

Given a list of 64 elements, how many elements will be checked to look for a value that is larger than the largest value in the list using binary search?

• 6

• 7

• 10

• 8

All functions that have the same _____ are considered equivalent in Big O notation.

• number of terms

• growth rate

• number of loops

• number of variables

Which of the following algorithms has a logarithmic runtime complexity?

• binary search

• merge sort

• linear search

• selection sort

Which of the following functions will have the biggest growth rate?

• Log₂N

• NLog₂N

• N²

• N

What is the worst-case runtime for a merge sort?

• 0(logN)

• 0(NlogN)

• 0(N²)

• 0(N)

What is the Big O notation for the worst-case runtime for the following code?

i = 1

while(i < number)

if i >= 1:

i = i * 2

• 9(logN)

• 0(NlogN)

• 0(N)

• 0(N²)

The challenge of sorting is that a program cannot _____.

• determine the order for complex strings

• access the last elements of a large list

• efficiently allocate memory to large lists

• see the entire list to know where to move an element