SE 2231/36 Midterm Review

In sorting, a(n) ______ refers to the specific attribute or value in a dataset that determines the order in which the data elements will be arranged.

A(n) _________ __________ is a mathematical concept in which every pair of elements in a set can be compared in a way that satisfies certain properties (antisymmetry, transitivity, totality).

What kind of sort is shown here?

• selection

• insertion

• shell

• merge

• quick

What kind of sort is shown here?

• radix

• insertion

• shell

• merge

• quick

What kind of sort is shown here?

• radix

• insertion

• shell

• merge

• cocktail

What kind of sort is shown here?

• selection

• insertion

• shell

• quick

• merge

What kind of sort is shown here?

• selection

• insertion

• shell

• quick

• merge

True or False. The worst, average, and best cases of the selection sort algorithm are all different from each other.

• True

• False

The worst case of insertion sort is when the array is...

• already sorted

• randomized

• in reversed order

• none of the above

Which of the following will insertion sort perform the fastest in?

• a randomized array

• a partially or almost sorted array

• a reversed order array

• an array with multiple duplicates in randomized order