GoalScope — find_closest_elements (Qwen2.5-Coder-32B-Instruct) — hover a token to see the patched verbalization
↵
<code>↵
def find_closest_elements(numbers: List[float]) -> Tuple[float, float]:↵
"""Finds and returns the two closest elements in a list."""↵
numbers.sort()↵
closest_pair = (numbers[0], numbers[1])↵
min_diff = abs(numbers[1] - numbers[0])↵
for i in range(1, len(numbers) - 1):↵
diff = abs(numbers[i + 1] - numbers[i])↵
if diff < min_diff:↵
min_diff = diff↵
closest_pair = (numbers[i], numbers[i + 1])↵
return closest_pair↵
</code>