Advertisement
Not a member of Pastebin yet?
Sign Up,
it unlocks many cool features!
- def find_min_max_pairs(arr):
- comp = 0
- N = len(arr)
- if arr[0] < arr[1]:
- min_val = arr[0]
- max_val = arr[1]
- else:
- min_val = arr[1]
- max_val = arr[0]
- comp += 1
- for i in range(N%2, N - 1, 2):
- if arr[i] < arr[i + 1]:
- current_min, current_max = arr[i], arr[i + 1]
- else:
- current_min, current_max = arr[i + 1], arr[i]
- comp += 1
- if current_min < min_val:
- min_val = current_min
- if current_max > max_val:
- max_val = current_max
- comp += 2
- return min_val, max_val, comp
Advertisement
Add Comment
Please, Sign In to add comment
Advertisement