DCS1101 - Week 13 (Searching & Sorting)

Open Ended

If you are looking for a friend in a crowded hall, what would your strategy be?

I’m thinking of a number between 1 and 100.
You can only ask yes/no questions.

Multiple Choice

Linear search works best when the data is

• sorted and large in size
• unsorted or small in size
• randomly ordered and extensive
• highly structured and complex

Multiple Choice

Binary search requires the array to be

• unordered
• reversed
• random
• sorted

Multiple Choice

Which is a drawback of linear search?

• Utilizes binary search for optimal performance

• Fast execution for small datasets

• Guaranteed to find an element in sorted arrays

• Inefficiency for large datasets

Draw

Draw the step-by-step linear search process for finding 15 in:

[4, 8, 12, 15, 21]

Multiple Choice

Which algorithm selects the smallest element and puts it at the front?

• Merge Sort
• Insertion Sort
• Selection Sort
• Bubble Sort

Multiple Choice

Best-case scenario of bubble sort is when the list is:

• Randomly ordered list
• Partially sorted list
• List with duplicate values
• Already sorted list

Multiple Choice

Bubble sort repeatedly compares:

• Non-adjacent elements
• Adjacent elements
• Random elements
• Only the largest elements

Draw

Draw the bubble sort on this list:

[6, 3, 8, 2]

Draw

Draw how selection sort finds the smallest value in the unsorted portion of this list:

[10, 4, 7, 1, 9]

Thank you!