Set Algorithm Complexity and Control Structure

• n₁ = size of range 1, n₂ = size of range 2; or n = size of each range
• Unsorted input ranges
• For each element in range 1, iterate through range2
• Runtime = Θ(n₁ x n₂) = Θ(n²)
• Sorted input ranges
• iterate through each range one time only
• Runtime = Θ(n₁ + n₂) = Θ(n)
• Sorted range control structure
• compare current elements from each input range
• perform action based on comparison
• increment past elements used for action
• continue until an input range is exhausted
• deal with tail of remaining range