Match the algorithm with a big$-\backslash$Theta estimate of its worst$-$case complexity.

Drag and drop application.

Locating an item in an unordered list by examining the items one by one.

Locating an item in an unordered list by examining the items one by one. drop zone empty.

Locating an item in an ordered list by successively splitting the list in half and comparing the element to the middle element.

Locating an item in an ordered list by successively splitting the list in half and comparing the element to the middle element. drop zone empty.

Print out all the bit strings of length n

Print out all the bit strings of length n drop zone empty.

Print out all ordered pairs of a set with n elements

Print out all ordered pairs of a set with n elements drop zone empty.

$\backslash$Theta $($n$)$

$\backslash$Theta $($log n$)$

$\backslash$Theta $(2$n$)$

$\backslash$Theta $($n$2)$