diff --git "a/mutated_code_dataset.csv" "b/mutated_code_dataset.csv"
new file mode 100644--- /dev/null
+++ "b/mutated_code_dataset.csv"
@@ -0,0 +1,905 @@
+original_code,modified_code,changed_line,line_number,mutation_type
+"def binary_search(arr, target): left, right = 0, len(arr) - 1; while left <= right: mid = (left + right) // 2; if arr[mid] == target: return mid; elif arr[mid] < target: left = mid + 1; else: right = mid - 1; return -1","def binary_search(arr, target): left, right = 0, len(arr) - 1; while left <= right: mid = (left + right) // 2; if arr[mid] != target: return mid; elif arr[mid] < target: left = mid + 1; else: right = mid - 1; return -1","def binary_search(arr, target): left, right = 0, len(arr) - 1; while left <= right: mid = (left + right) // 2; if arr[mid] != target: return mid; elif arr[mid] < target: left = mid + 1; else: right = mid - 1; return -1",1,decision
+"def power(x, n): return x * power(x, n-1) if n > 0 else 1","def power(x, n): return x * power(x, n-1) if n < 0 else 1","def power(x, n): return x * power(x, n-1) if n < 0 else 1",1,operation
+def factorial(n): return n * factorial(n-1) if n > 1 else 1,def factorial(n): return n * factorial(n-1) if n < 1 else 1,def factorial(n): return n * factorial(n-1) if n < 1 else 1,1,operation
+def fibonacci(n): return 1 if n <= 1 else fibonacci(n-1) + fibonacci(n-2),def fibonacci(n): return 1 if n >= 1 else fibonacci(n-1) + fibonacci(n-2),def fibonacci(n): return 1 if n >= 1 else fibonacci(n-1) + fibonacci(n-2),1,operation
+def is_even(n): return n % 2 == 0,def is_even(n): return n % 2 != 0,def is_even(n): return n % 2 != 0,1,decision
+"def power(x, n): return x * power(x, n-1) if n > 0 else 1","def power(x, n): return x * power(x, n-1) if n < 0 else 1","def power(x, n): return x * power(x, n-1) if n < 0 else 1",1,operation
+def fibonacci(n): return 1 if n <= 1 else fibonacci(n-1) + fibonacci(n-2),def fibonacci(n): return 1 if n >= 1 else fibonacci(n-1) + fibonacci(n-2),def fibonacci(n): return 1 if n >= 1 else fibonacci(n-1) + fibonacci(n-2),1,operation
+def is_even(n): return n % 2 == 0,def is_even(n): return n % 2 != 0,def is_even(n): return n % 2 != 0,1,decision
+def is_even(n): return n % 2 == 0,def is_even(n): return n % 2 != 0,def is_even(n): return n % 2 != 0,1,decision
+def quick_sort(arr): if len(arr) <= 1: return arr; pivot = arr[len(arr) // 2]; left = [x for x in arr if x < pivot]; middle = [x for x in arr if x == pivot]; right = [x for x in arr if x > pivot]; return quick_sort(left) + middle + quick_sort(right),def quick_sort(arr): if len(arr) <= 1: return arr; pivot = arr[len(arr) // 2]; left = [x for x in arr if x < pivot]; middle = [x for x in arr if x != pivot]; right = [x for x in arr if x > pivot]; return quick_sort(left) + middle + quick_sort(right),def quick_sort(arr): if len(arr) <= 1: return arr; pivot = arr[len(arr) // 2]; left = [x for x in arr if x < pivot]; middle = [x for x in arr if x != pivot]; right = [x for x in arr if x > pivot]; return quick_sort(left) + middle + quick_sort(right),1,decision
+def quick_sort(arr): if len(arr) <= 1: return arr; pivot = arr[len(arr) // 2]; left = [x for x in arr if x < pivot]; middle = [x for x in arr if x == pivot]; right = [x for x in arr if x > pivot]; return quick_sort(left) + middle + quick_sort(right),def quick_sort(arr): if len(arr) <= 1: return arr; pivot = arr[len(arr) // 2]; left = [x for x in arr if x < pivot]; middle = [x for x in arr if x != pivot]; right = [x for x in arr if x > pivot]; return quick_sort(left) + middle + quick_sort(right),def quick_sort(arr): if len(arr) <= 1: return arr; pivot = arr[len(arr) // 2]; left = [x for x in arr if x < pivot]; middle = [x for x in arr if x != pivot]; right = [x for x in arr if x > pivot]; return quick_sort(left) + middle + quick_sort(right),1,decision
+def is_even(n): return n % 2 == 0,def is_even(n): return n % 2 != 0,def is_even(n): return n % 2 != 0,1,decision
+"def add(a, b): return a + b","def add(a, b): return a - b","def add(a, b): return a - b",1,operation
+"def add(a, b): return a + b","def add(a, b): return a - b","def add(a, b): return a - b",1,operation
+def factorial(n): return n * factorial(n-1) if n > 1 else 1,def factorial(n): return n * factorial(n-1) if n < 1 else 1,def factorial(n): return n * factorial(n-1) if n < 1 else 1,1,operation
+"def add(a, b): return a + b","def add(a, b): return a - b","def add(a, b): return a - b",1,operation
+def factorial(n): return n * factorial(n-1) if n > 1 else 1,def factorial(n): return n * factorial(n-1) if n < 1 else 1,def factorial(n): return n * factorial(n-1) if n < 1 else 1,1,operation
+def quick_sort(arr): if len(arr) <= 1: return arr; pivot = arr[len(arr) // 2]; left = [x for x in arr if x < pivot]; middle = [x for x in arr if x == pivot]; right = [x for x in arr if x > pivot]; return quick_sort(left) + middle + quick_sort(right),def quick_sort(arr): if len(arr) <= 1: return arr; pivot = arr[len(arr) // 2]; left = [x for x in arr if x < pivot]; middle = [x for x in arr if x != pivot]; right = [x for x in arr if x > pivot]; return quick_sort(left) + middle + quick_sort(right),def quick_sort(arr): if len(arr) <= 1: return arr; pivot = arr[len(arr) // 2]; left = [x for x in arr if x < pivot]; middle = [x for x in arr if x != pivot]; right = [x for x in arr if x > pivot]; return quick_sort(left) + middle + quick_sort(right),1,decision
+def quick_sort(arr): if len(arr) <= 1: return arr; pivot = arr[len(arr) // 2]; left = [x for x in arr if x < pivot]; middle = [x for x in arr if x == pivot]; right = [x for x in arr if x > pivot]; return quick_sort(left) + middle + quick_sort(right),def quick_sort(arr): if len(arr) <= 1: return arr; pivot = arr[len(arr) // 2]; left = [x for x in arr if x < pivot]; middle = [x for x in arr if x != pivot]; right = [x for x in arr if x > pivot]; return quick_sort(left) + middle + quick_sort(right),def quick_sort(arr): if len(arr) <= 1: return arr; pivot = arr[len(arr) // 2]; left = [x for x in arr if x < pivot]; middle = [x for x in arr if x != pivot]; right = [x for x in arr if x > pivot]; return quick_sort(left) + middle + quick_sort(right),1,decision
+def is_palindrome(s): return s == s[::-1],def is_palindrome(s): return s != s[::-1],def is_palindrome(s): return s != s[::-1],1,decision
+"def power(x, n): return x * power(x, n-1) if n > 0 else 1","def power(x, n): return x * power(x, n-1) if n < 0 else 1","def power(x, n): return x * power(x, n-1) if n < 0 else 1",1,operation
+"def gcd(a, b): return a if b == 0 else gcd(b, a % b)","def gcd(a, b): return a if b != 0 else gcd(b, a % b)","def gcd(a, b): return a if b != 0 else gcd(b, a % b)",1,decision
+"def gcd(a, b): return a if b == 0 else gcd(b, a % b)","def gcd(a, b): return a if b != 0 else gcd(b, a % b)","def gcd(a, b): return a if b != 0 else gcd(b, a % b)",1,decision
+def fibonacci(n): return 1 if n <= 1 else fibonacci(n-1) + fibonacci(n-2),def fibonacci(n): return 1 if n >= 1 else fibonacci(n-1) + fibonacci(n-2),def fibonacci(n): return 1 if n >= 1 else fibonacci(n-1) + fibonacci(n-2),1,operation
+"def binary_search(arr, target): left, right = 0, len(arr) - 1; while left <= right: mid = (left + right) // 2; if arr[mid] == target: return mid; elif arr[mid] < target: left = mid + 1; else: right = mid - 1; return -1","def binary_search(arr, target): left, right = 0, len(arr) - 1; while left <= right: mid = (left + right) // 2; if arr[mid] != target: return mid; elif arr[mid] < target: left = mid + 1; else: right = mid - 1; return -1","def binary_search(arr, target): left, right = 0, len(arr) - 1; while left <= right: mid = (left + right) // 2; if arr[mid] != target: return mid; elif arr[mid] < target: left = mid + 1; else: right = mid - 1; return -1",1,decision
+"def gcd(a, b): return a if b == 0 else gcd(b, a % b)","def gcd(a, b): return a if b != 0 else gcd(b, a % b)","def gcd(a, b): return a if b != 0 else gcd(b, a % b)",1,decision
+"def gcd(a, b): return a if b == 0 else gcd(b, a % b)","def gcd(a, b): return a if b != 0 else gcd(b, a % b)","def gcd(a, b): return a if b != 0 else gcd(b, a % b)",1,decision
+def is_even(n): return n % 2 == 0,def is_even(n): return n % 2 != 0,def is_even(n): return n % 2 != 0,1,decision
+def factorial(n): return n * factorial(n-1) if n > 1 else 1,def factorial(n): return n * factorial(n-1) if n < 1 else 1,def factorial(n): return n * factorial(n-1) if n < 1 else 1,1,operation
+"def power(x, n): return x * power(x, n-1) if n > 0 else 1","def power(x, n): return x * power(x, n-1) if n < 0 else 1","def power(x, n): return x * power(x, n-1) if n < 0 else 1",1,operation
+def factorial(n): return n * factorial(n-1) if n > 1 else 1,def factorial(n): return n * factorial(n-1) if n < 1 else 1,def factorial(n): return n * factorial(n-1) if n < 1 else 1,1,operation
+"def binary_search(arr, target): left, right = 0, len(arr) - 1; while left <= right: mid = (left + right) // 2; if arr[mid] == target: return mid; elif arr[mid] < target: left = mid + 1; else: right = mid - 1; return -1","def binary_search(arr, target): left, right = 0, len(arr) - 1; while left <= right: mid = (left + right) // 2; if arr[mid] != target: return mid; elif arr[mid] < target: left = mid + 1; else: right = mid - 1; return -1","def binary_search(arr, target): left, right = 0, len(arr) - 1; while left <= right: mid = (left + right) // 2; if arr[mid] != target: return mid; elif arr[mid] < target: left = mid + 1; else: right = mid - 1; return -1",1,decision
+"def power(x, n): return x * power(x, n-1) if n > 0 else 1","def power(x, n): return x * power(x, n-1) if n < 0 else 1","def power(x, n): return x * power(x, n-1) if n < 0 else 1",1,operation
+def fibonacci(n): return 1 if n <= 1 else fibonacci(n-1) + fibonacci(n-2),def fibonacci(n): return 1 if n >= 1 else fibonacci(n-1) + fibonacci(n-2),def fibonacci(n): return 1 if n >= 1 else fibonacci(n-1) + fibonacci(n-2),1,operation
+"def power(x, n): return x * power(x, n-1) if n > 0 else 1","def power(x, n): return x * power(x, n-1) if n < 0 else 1","def power(x, n): return x * power(x, n-1) if n < 0 else 1",1,operation
+def fibonacci(n): return 1 if n <= 1 else fibonacci(n-1) + fibonacci(n-2),def fibonacci(n): return 1 if n >= 1 else fibonacci(n-1) + fibonacci(n-2),def fibonacci(n): return 1 if n >= 1 else fibonacci(n-1) + fibonacci(n-2),1,operation
+"def binary_search(arr, target): left, right = 0, len(arr) - 1; while left <= right: mid = (left + right) // 2; if arr[mid] == target: return mid; elif arr[mid] < target: left = mid + 1; else: right = mid - 1; return -1","def binary_search(arr, target): left, right = 0, len(arr) - 1; while left <= right: mid = (left + right) // 2; if arr[mid] != target: return mid; elif arr[mid] < target: left = mid + 1; else: right = mid - 1; return -1","def binary_search(arr, target): left, right = 0, len(arr) - 1; while left <= right: mid = (left + right) // 2; if arr[mid] != target: return mid; elif arr[mid] < target: left = mid + 1; else: right = mid - 1; return -1",1,decision
+def is_even(n): return n % 2 == 0,def is_even(n): return n % 2 != 0,def is_even(n): return n % 2 != 0,1,decision
+"def power(x, n): return x * power(x, n-1) if n > 0 else 1","def power(x, n): return x * power(x, n-1) if n < 0 else 1","def power(x, n): return x * power(x, n-1) if n < 0 else 1",1,operation
+def is_even(n): return n % 2 == 0,def is_even(n): return n % 2 != 0,def is_even(n): return n % 2 != 0,1,decision
+def quick_sort(arr): if len(arr) <= 1: return arr; pivot = arr[len(arr) // 2]; left = [x for x in arr if x < pivot]; middle = [x for x in arr if x == pivot]; right = [x for x in arr if x > pivot]; return quick_sort(left) + middle + quick_sort(right),def quick_sort(arr): if len(arr) <= 1: return arr; pivot = arr[len(arr) // 2]; left = [x for x in arr if x < pivot]; middle = [x for x in arr if x != pivot]; right = [x for x in arr if x > pivot]; return quick_sort(left) + middle + quick_sort(right),def quick_sort(arr): if len(arr) <= 1: return arr; pivot = arr[len(arr) // 2]; left = [x for x in arr if x < pivot]; middle = [x for x in arr if x != pivot]; right = [x for x in arr if x > pivot]; return quick_sort(left) + middle + quick_sort(right),1,decision
+def is_even(n): return n % 2 == 0,def is_even(n): return n % 2 != 0,def is_even(n): return n % 2 != 0,1,decision
+def quick_sort(arr): if len(arr) <= 1: return arr; pivot = arr[len(arr) // 2]; left = [x for x in arr if x < pivot]; middle = [x for x in arr if x == pivot]; right = [x for x in arr if x > pivot]; return quick_sort(left) + middle + quick_sort(right),def quick_sort(arr): if len(arr) <= 1: return arr; pivot = arr[len(arr) // 2]; left = [x for x in arr if x < pivot]; middle = [x for x in arr if x != pivot]; right = [x for x in arr if x > pivot]; return quick_sort(left) + middle + quick_sort(right),def quick_sort(arr): if len(arr) <= 1: return arr; pivot = arr[len(arr) // 2]; left = [x for x in arr if x < pivot]; middle = [x for x in arr if x != pivot]; right = [x for x in arr if x > pivot]; return quick_sort(left) + middle + quick_sort(right),1,decision
+"def binary_search(arr, target): left, right = 0, len(arr) - 1; while left <= right: mid = (left + right) // 2; if arr[mid] == target: return mid; elif arr[mid] < target: left = mid + 1; else: right = mid - 1; return -1","def binary_search(arr, target): left, right = 0, len(arr) - 1; while left <= right: mid = (left + right) // 2; if arr[mid] != target: return mid; elif arr[mid] < target: left = mid + 1; else: right = mid - 1; return -1","def binary_search(arr, target): left, right = 0, len(arr) - 1; while left <= right: mid = (left + right) // 2; if arr[mid] != target: return mid; elif arr[mid] < target: left = mid + 1; else: right = mid - 1; return -1",1,decision
+def fibonacci(n): return 1 if n <= 1 else fibonacci(n-1) + fibonacci(n-2),def fibonacci(n): return 1 if n >= 1 else fibonacci(n-1) + fibonacci(n-2),def fibonacci(n): return 1 if n >= 1 else fibonacci(n-1) + fibonacci(n-2),1,operation
+def is_even(n): return n % 2 == 0,def is_even(n): return n % 2 != 0,def is_even(n): return n % 2 != 0,1,decision
+def is_palindrome(s): return s == s[::-1],def is_palindrome(s): return s != s[::-1],def is_palindrome(s): return s != s[::-1],1,decision
+"def binary_search(arr, target): left, right = 0, len(arr) - 1; while left <= right: mid = (left + right) // 2; if arr[mid] == target: return mid; elif arr[mid] < target: left = mid + 1; else: right = mid - 1; return -1","def binary_search(arr, target): left, right = 0, len(arr) - 1; while left <= right: mid = (left + right) // 2; if arr[mid] != target: return mid; elif arr[mid] < target: left = mid + 1; else: right = mid - 1; return -1","def binary_search(arr, target): left, right = 0, len(arr) - 1; while left <= right: mid = (left + right) // 2; if arr[mid] != target: return mid; elif arr[mid] < target: left = mid + 1; else: right = mid - 1; return -1",1,decision
+def is_palindrome(s): return s == s[::-1],def is_palindrome(s): return s != s[::-1],def is_palindrome(s): return s != s[::-1],1,decision
+def factorial(n): return n * factorial(n-1) if n > 1 else 1,def factorial(n): return n * factorial(n-1) if n < 1 else 1,def factorial(n): return n * factorial(n-1) if n < 1 else 1,1,operation
+"def binary_search(arr, target): left, right = 0, len(arr) - 1; while left <= right: mid = (left + right) // 2; if arr[mid] == target: return mid; elif arr[mid] < target: left = mid + 1; else: right = mid - 1; return -1","def binary_search(arr, target): left, right = 0, len(arr) - 1; while left <= right: mid = (left + right) // 2; if arr[mid] != target: return mid; elif arr[mid] < target: left = mid + 1; else: right = mid - 1; return -1","def binary_search(arr, target): left, right = 0, len(arr) - 1; while left <= right: mid = (left + right) // 2; if arr[mid] != target: return mid; elif arr[mid] < target: left = mid + 1; else: right = mid - 1; return -1",1,decision
+def is_even(n): return n % 2 == 0,def is_even(n): return n % 2 != 0,def is_even(n): return n % 2 != 0,1,decision
+def quick_sort(arr): if len(arr) <= 1: return arr; pivot = arr[len(arr) // 2]; left = [x for x in arr if x < pivot]; middle = [x for x in arr if x == pivot]; right = [x for x in arr if x > pivot]; return quick_sort(left) + middle + quick_sort(right),def quick_sort(arr): if len(arr) <= 1: return arr; pivot = arr[len(arr) // 2]; left = [x for x in arr if x < pivot]; middle = [x for x in arr if x != pivot]; right = [x for x in arr if x > pivot]; return quick_sort(left) + middle + quick_sort(right),def quick_sort(arr): if len(arr) <= 1: return arr; pivot = arr[len(arr) // 2]; left = [x for x in arr if x < pivot]; middle = [x for x in arr if x != pivot]; right = [x for x in arr if x > pivot]; return quick_sort(left) + middle + quick_sort(right),1,decision
+def fibonacci(n): return 1 if n <= 1 else fibonacci(n-1) + fibonacci(n-2),def fibonacci(n): return 1 if n >= 1 else fibonacci(n-1) + fibonacci(n-2),def fibonacci(n): return 1 if n >= 1 else fibonacci(n-1) + fibonacci(n-2),1,operation
+"def binary_search(arr, target): left, right = 0, len(arr) - 1; while left <= right: mid = (left + right) // 2; if arr[mid] == target: return mid; elif arr[mid] < target: left = mid + 1; else: right = mid - 1; return -1","def binary_search(arr, target): left, right = 0, len(arr) - 1; while left <= right: mid = (left + right) // 2; if arr[mid] != target: return mid; elif arr[mid] < target: left = mid + 1; else: right = mid - 1; return -1","def binary_search(arr, target): left, right = 0, len(arr) - 1; while left <= right: mid = (left + right) // 2; if arr[mid] != target: return mid; elif arr[mid] < target: left = mid + 1; else: right = mid - 1; return -1",1,decision
+def fibonacci(n): return 1 if n <= 1 else fibonacci(n-1) + fibonacci(n-2),def fibonacci(n): return 1 if n >= 1 else fibonacci(n-1) + fibonacci(n-2),def fibonacci(n): return 1 if n >= 1 else fibonacci(n-1) + fibonacci(n-2),1,operation
+def is_palindrome(s): return s == s[::-1],def is_palindrome(s): return s != s[::-1],def is_palindrome(s): return s != s[::-1],1,decision
+"def add(a, b): return a + b","def add(a, b): return a - b","def add(a, b): return a - b",1,operation
+def quick_sort(arr): if len(arr) <= 1: return arr; pivot = arr[len(arr) // 2]; left = [x for x in arr if x < pivot]; middle = [x for x in arr if x == pivot]; right = [x for x in arr if x > pivot]; return quick_sort(left) + middle + quick_sort(right),def quick_sort(arr): if len(arr) <= 1: return arr; pivot = arr[len(arr) // 2]; left = [x for x in arr if x < pivot]; middle = [x for x in arr if x != pivot]; right = [x for x in arr if x > pivot]; return quick_sort(left) + middle + quick_sort(right),def quick_sort(arr): if len(arr) <= 1: return arr; pivot = arr[len(arr) // 2]; left = [x for x in arr if x < pivot]; middle = [x for x in arr if x != pivot]; right = [x for x in arr if x > pivot]; return quick_sort(left) + middle + quick_sort(right),1,decision
+def is_palindrome(s): return s == s[::-1],def is_palindrome(s): return s != s[::-1],def is_palindrome(s): return s != s[::-1],1,decision
+"def gcd(a, b): return a if b == 0 else gcd(b, a % b)","def gcd(a, b): return a if b != 0 else gcd(b, a % b)","def gcd(a, b): return a if b != 0 else gcd(b, a % b)",1,decision
+"def gcd(a, b): return a if b == 0 else gcd(b, a % b)","def gcd(a, b): return a if b != 0 else gcd(b, a % b)","def gcd(a, b): return a if b != 0 else gcd(b, a % b)",1,decision
+def is_palindrome(s): return s == s[::-1],def is_palindrome(s): return s != s[::-1],def is_palindrome(s): return s != s[::-1],1,decision
+def is_even(n): return n % 2 == 0,def is_even(n): return n % 2 != 0,def is_even(n): return n % 2 != 0,1,decision
+def is_even(n): return n % 2 == 0,def is_even(n): return n % 2 != 0,def is_even(n): return n % 2 != 0,1,decision
+def quick_sort(arr): if len(arr) <= 1: return arr; pivot = arr[len(arr) // 2]; left = [x for x in arr if x < pivot]; middle = [x for x in arr if x == pivot]; right = [x for x in arr if x > pivot]; return quick_sort(left) + middle + quick_sort(right),def quick_sort(arr): if len(arr) <= 1: return arr; pivot = arr[len(arr) // 2]; left = [x for x in arr if x < pivot]; middle = [x for x in arr if x != pivot]; right = [x for x in arr if x > pivot]; return quick_sort(left) + middle + quick_sort(right),def quick_sort(arr): if len(arr) <= 1: return arr; pivot = arr[len(arr) // 2]; left = [x for x in arr if x < pivot]; middle = [x for x in arr if x != pivot]; right = [x for x in arr if x > pivot]; return quick_sort(left) + middle + quick_sort(right),1,decision
+def is_palindrome(s): return s == s[::-1],def is_palindrome(s): return s != s[::-1],def is_palindrome(s): return s != s[::-1],1,decision
+def is_even(n): return n % 2 == 0,def is_even(n): return n % 2 != 0,def is_even(n): return n % 2 != 0,1,decision
+"def add(a, b): return a + b","def add(a, b): return a - b","def add(a, b): return a - b",1,operation
+def is_even(n): return n % 2 == 0,def is_even(n): return n % 2 != 0,def is_even(n): return n % 2 != 0,1,decision
+"def binary_search(arr, target): left, right = 0, len(arr) - 1; while left <= right: mid = (left + right) // 2; if arr[mid] == target: return mid; elif arr[mid] < target: left = mid + 1; else: right = mid - 1; return -1","def binary_search(arr, target): left, right = 0, len(arr) - 1; while left <= right: mid = (left + right) // 2; if arr[mid] != target: return mid; elif arr[mid] < target: left = mid + 1; else: right = mid - 1; return -1","def binary_search(arr, target): left, right = 0, len(arr) - 1; while left <= right: mid = (left + right) // 2; if arr[mid] != target: return mid; elif arr[mid] < target: left = mid + 1; else: right = mid - 1; return -1",1,decision
+def is_palindrome(s): return s == s[::-1],def is_palindrome(s): return s != s[::-1],def is_palindrome(s): return s != s[::-1],1,decision
+def is_palindrome(s): return s == s[::-1],def is_palindrome(s): return s != s[::-1],def is_palindrome(s): return s != s[::-1],1,decision
+"def add(a, b): return a + b","def add(a, b): return a - b","def add(a, b): return a - b",1,operation
+"def gcd(a, b): return a if b == 0 else gcd(b, a % b)","def gcd(a, b): return a if b != 0 else gcd(b, a % b)","def gcd(a, b): return a if b != 0 else gcd(b, a % b)",1,decision
+def is_palindrome(s): return s == s[::-1],def is_palindrome(s): return s != s[::-1],def is_palindrome(s): return s != s[::-1],1,decision
+"def power(x, n): return x * power(x, n-1) if n > 0 else 1","def power(x, n): return x * power(x, n-1) if n < 0 else 1","def power(x, n): return x * power(x, n-1) if n < 0 else 1",1,operation
+def fibonacci(n): return 1 if n <= 1 else fibonacci(n-1) + fibonacci(n-2),def fibonacci(n): return 1 if n >= 1 else fibonacci(n-1) + fibonacci(n-2),def fibonacci(n): return 1 if n >= 1 else fibonacci(n-1) + fibonacci(n-2),1,operation
+"def binary_search(arr, target): left, right = 0, len(arr) - 1; while left <= right: mid = (left + right) // 2; if arr[mid] == target: return mid; elif arr[mid] < target: left = mid + 1; else: right = mid - 1; return -1","def binary_search(arr, target): left, right = 0, len(arr) - 1; while left <= right: mid = (left + right) // 2; if arr[mid] != target: return mid; elif arr[mid] < target: left = mid + 1; else: right = mid - 1; return -1","def binary_search(arr, target): left, right = 0, len(arr) - 1; while left <= right: mid = (left + right) // 2; if arr[mid] != target: return mid; elif arr[mid] < target: left = mid + 1; else: right = mid - 1; return -1",1,decision
+def fibonacci(n): return 1 if n <= 1 else fibonacci(n-1) + fibonacci(n-2),def fibonacci(n): return 1 if n >= 1 else fibonacci(n-1) + fibonacci(n-2),def fibonacci(n): return 1 if n >= 1 else fibonacci(n-1) + fibonacci(n-2),1,operation
+"def power(x, n): return x * power(x, n-1) if n > 0 else 1","def power(x, n): return x * power(x, n-1) if n < 0 else 1","def power(x, n): return x * power(x, n-1) if n < 0 else 1",1,operation
+"def power(x, n): return x * power(x, n-1) if n > 0 else 1","def power(x, n): return x * power(x, n-1) if n < 0 else 1","def power(x, n): return x * power(x, n-1) if n < 0 else 1",1,operation
+"def add(a, b): return a + b","def add(a, b): return a - b","def add(a, b): return a - b",1,operation
+def is_palindrome(s): return s == s[::-1],def is_palindrome(s): return s != s[::-1],def is_palindrome(s): return s != s[::-1],1,decision
+def is_palindrome(s): return s == s[::-1],def is_palindrome(s): return s != s[::-1],def is_palindrome(s): return s != s[::-1],1,decision
+def factorial(n): return n * factorial(n-1) if n > 1 else 1,def factorial(n): return n * factorial(n-1) if n < 1 else 1,def factorial(n): return n * factorial(n-1) if n < 1 else 1,1,operation
+def factorial(n): return n * factorial(n-1) if n > 1 else 1,def factorial(n): return n * factorial(n-1) if n < 1 else 1,def factorial(n): return n * factorial(n-1) if n < 1 else 1,1,operation
+"def gcd(a, b): return a if b == 0 else gcd(b, a % b)","def gcd(a, b): return a if b != 0 else gcd(b, a % b)","def gcd(a, b): return a if b != 0 else gcd(b, a % b)",1,decision
+def is_palindrome(s): return s == s[::-1],def is_palindrome(s): return s != s[::-1],def is_palindrome(s): return s != s[::-1],1,decision
+"def power(x, n): return x * power(x, n-1) if n > 0 else 1","def power(x, n): return x * power(x, n-1) if n < 0 else 1","def power(x, n): return x * power(x, n-1) if n < 0 else 1",1,operation
+def factorial(n): return n * factorial(n-1) if n > 1 else 1,def factorial(n): return n * factorial(n-1) if n < 1 else 1,def factorial(n): return n * factorial(n-1) if n < 1 else 1,1,operation
+def is_even(n): return n % 2 == 0,def is_even(n): return n % 2 != 0,def is_even(n): return n % 2 != 0,1,decision
+def fibonacci(n): return 1 if n <= 1 else fibonacci(n-1) + fibonacci(n-2),def fibonacci(n): return 1 if n >= 1 else fibonacci(n-1) + fibonacci(n-2),def fibonacci(n): return 1 if n >= 1 else fibonacci(n-1) + fibonacci(n-2),1,operation
+"def add(a, b): return a + b","def add(a, b): return a - b","def add(a, b): return a - b",1,operation
+def fibonacci(n): return 1 if n <= 1 else fibonacci(n-1) + fibonacci(n-2),def fibonacci(n): return 1 if n >= 1 else fibonacci(n-1) + fibonacci(n-2),def fibonacci(n): return 1 if n >= 1 else fibonacci(n-1) + fibonacci(n-2),1,operation
+"def gcd(a, b): return a if b == 0 else gcd(b, a % b)","def gcd(a, b): return a if b != 0 else gcd(b, a % b)","def gcd(a, b): return a if b != 0 else gcd(b, a % b)",1,decision
+def is_even(n): return n % 2 == 0,def is_even(n): return n % 2 != 0,def is_even(n): return n % 2 != 0,1,decision
+def is_even(n): return n % 2 == 0,def is_even(n): return n % 2 != 0,def is_even(n): return n % 2 != 0,1,decision
+def is_even(n): return n % 2 == 0,def is_even(n): return n % 2 != 0,def is_even(n): return n % 2 != 0,1,decision
+def factorial(n): return n * factorial(n-1) if n > 1 else 1,def factorial(n): return n * factorial(n-1) if n < 1 else 1,def factorial(n): return n * factorial(n-1) if n < 1 else 1,1,operation
+"def add(a, b): return a + b","def add(a, b): return a - b","def add(a, b): return a - b",1,operation
+def factorial(n): return n * factorial(n-1) if n > 1 else 1,def factorial(n): return n * factorial(n-1) if n < 1 else 1,def factorial(n): return n * factorial(n-1) if n < 1 else 1,1,operation
+"def gcd(a, b): return a if b == 0 else gcd(b, a % b)","def gcd(a, b): return a if b != 0 else gcd(b, a % b)","def gcd(a, b): return a if b != 0 else gcd(b, a % b)",1,decision
+"def gcd(a, b): return a if b == 0 else gcd(b, a % b)","def gcd(a, b): return a if b != 0 else gcd(b, a % b)","def gcd(a, b): return a if b != 0 else gcd(b, a % b)",1,decision
+def is_palindrome(s): return s == s[::-1],def is_palindrome(s): return s != s[::-1],def is_palindrome(s): return s != s[::-1],1,decision
+"def gcd(a, b): return a if b == 0 else gcd(b, a % b)","def gcd(a, b): return a if b != 0 else gcd(b, a % b)","def gcd(a, b): return a if b != 0 else gcd(b, a % b)",1,decision
+def fibonacci(n): return 1 if n <= 1 else fibonacci(n-1) + fibonacci(n-2),def fibonacci(n): return 1 if n >= 1 else fibonacci(n-1) + fibonacci(n-2),def fibonacci(n): return 1 if n >= 1 else fibonacci(n-1) + fibonacci(n-2),1,operation
+"def binary_search(arr, target): left, right = 0, len(arr) - 1; while left <= right: mid = (left + right) // 2; if arr[mid] == target: return mid; elif arr[mid] < target: left = mid + 1; else: right = mid - 1; return -1","def binary_search(arr, target): left, right = 0, len(arr) - 1; while left <= right: mid = (left + right) // 2; if arr[mid] != target: return mid; elif arr[mid] < target: left = mid + 1; else: right = mid - 1; return -1","def binary_search(arr, target): left, right = 0, len(arr) - 1; while left <= right: mid = (left + right) // 2; if arr[mid] != target: return mid; elif arr[mid] < target: left = mid + 1; else: right = mid - 1; return -1",1,decision
+def quick_sort(arr): if len(arr) <= 1: return arr; pivot = arr[len(arr) // 2]; left = [x for x in arr if x < pivot]; middle = [x for x in arr if x == pivot]; right = [x for x in arr if x > pivot]; return quick_sort(left) + middle + quick_sort(right),def quick_sort(arr): if len(arr) <= 1: return arr; pivot = arr[len(arr) // 2]; left = [x for x in arr if x < pivot]; middle = [x for x in arr if x != pivot]; right = [x for x in arr if x > pivot]; return quick_sort(left) + middle + quick_sort(right),def quick_sort(arr): if len(arr) <= 1: return arr; pivot = arr[len(arr) // 2]; left = [x for x in arr if x < pivot]; middle = [x for x in arr if x != pivot]; right = [x for x in arr if x > pivot]; return quick_sort(left) + middle + quick_sort(right),1,decision
+"def add(a, b): return a + b","def add(a, b): return a - b","def add(a, b): return a - b",1,operation
+"def power(x, n): return x * power(x, n-1) if n > 0 else 1","def power(x, n): return x * power(x, n-1) if n < 0 else 1","def power(x, n): return x * power(x, n-1) if n < 0 else 1",1,operation
+"def add(a, b): return a + b","def add(a, b): return a - b","def add(a, b): return a - b",1,operation
+"def gcd(a, b): return a if b == 0 else gcd(b, a % b)","def gcd(a, b): return a if b != 0 else gcd(b, a % b)","def gcd(a, b): return a if b != 0 else gcd(b, a % b)",1,decision
+"def binary_search(arr, target): left, right = 0, len(arr) - 1; while left <= right: mid = (left + right) // 2; if arr[mid] == target: return mid; elif arr[mid] < target: left = mid + 1; else: right = mid - 1; return -1","def binary_search(arr, target): left, right = 0, len(arr) - 1; while left <= right: mid = (left + right) // 2; if arr[mid] != target: return mid; elif arr[mid] < target: left = mid + 1; else: right = mid - 1; return -1","def binary_search(arr, target): left, right = 0, len(arr) - 1; while left <= right: mid = (left + right) // 2; if arr[mid] != target: return mid; elif arr[mid] < target: left = mid + 1; else: right = mid - 1; return -1",1,decision
+def quick_sort(arr): if len(arr) <= 1: return arr; pivot = arr[len(arr) // 2]; left = [x for x in arr if x < pivot]; middle = [x for x in arr if x == pivot]; right = [x for x in arr if x > pivot]; return quick_sort(left) + middle + quick_sort(right),def quick_sort(arr): if len(arr) <= 1: return arr; pivot = arr[len(arr) // 2]; left = [x for x in arr if x < pivot]; middle = [x for x in arr if x != pivot]; right = [x for x in arr if x > pivot]; return quick_sort(left) + middle + quick_sort(right),def quick_sort(arr): if len(arr) <= 1: return arr; pivot = arr[len(arr) // 2]; left = [x for x in arr if x < pivot]; middle = [x for x in arr if x != pivot]; right = [x for x in arr if x > pivot]; return quick_sort(left) + middle + quick_sort(right),1,decision
+def quick_sort(arr): if len(arr) <= 1: return arr; pivot = arr[len(arr) // 2]; left = [x for x in arr if x < pivot]; middle = [x for x in arr if x == pivot]; right = [x for x in arr if x > pivot]; return quick_sort(left) + middle + quick_sort(right),def quick_sort(arr): if len(arr) <= 1: return arr; pivot = arr[len(arr) // 2]; left = [x for x in arr if x < pivot]; middle = [x for x in arr if x != pivot]; right = [x for x in arr if x > pivot]; return quick_sort(left) + middle + quick_sort(right),def quick_sort(arr): if len(arr) <= 1: return arr; pivot = arr[len(arr) // 2]; left = [x for x in arr if x < pivot]; middle = [x for x in arr if x != pivot]; right = [x for x in arr if x > pivot]; return quick_sort(left) + middle + quick_sort(right),1,decision
+def fibonacci(n): return 1 if n <= 1 else fibonacci(n-1) + fibonacci(n-2),def fibonacci(n): return 1 if n >= 1 else fibonacci(n-1) + fibonacci(n-2),def fibonacci(n): return 1 if n >= 1 else fibonacci(n-1) + fibonacci(n-2),1,operation
+"def gcd(a, b): return a if b == 0 else gcd(b, a % b)","def gcd(a, b): return a if b != 0 else gcd(b, a % b)","def gcd(a, b): return a if b != 0 else gcd(b, a % b)",1,decision
+"def add(a, b): return a + b","def add(a, b): return a - b","def add(a, b): return a - b",1,operation
+def fibonacci(n): return 1 if n <= 1 else fibonacci(n-1) + fibonacci(n-2),def fibonacci(n): return 1 if n >= 1 else fibonacci(n-1) + fibonacci(n-2),def fibonacci(n): return 1 if n >= 1 else fibonacci(n-1) + fibonacci(n-2),1,operation
+def factorial(n): return n * factorial(n-1) if n > 1 else 1,def factorial(n): return n * factorial(n-1) if n < 1 else 1,def factorial(n): return n * factorial(n-1) if n < 1 else 1,1,operation
+"def power(x, n): return x * power(x, n-1) if n > 0 else 1","def power(x, n): return x * power(x, n-1) if n < 0 else 1","def power(x, n): return x * power(x, n-1) if n < 0 else 1",1,operation
+"def gcd(a, b): return a if b == 0 else gcd(b, a % b)","def gcd(a, b): return a if b != 0 else gcd(b, a % b)","def gcd(a, b): return a if b != 0 else gcd(b, a % b)",1,decision
+def quick_sort(arr): if len(arr) <= 1: return arr; pivot = arr[len(arr) // 2]; left = [x for x in arr if x < pivot]; middle = [x for x in arr if x == pivot]; right = [x for x in arr if x > pivot]; return quick_sort(left) + middle + quick_sort(right),def quick_sort(arr): if len(arr) <= 1: return arr; pivot = arr[len(arr) // 2]; left = [x for x in arr if x < pivot]; middle = [x for x in arr if x != pivot]; right = [x for x in arr if x > pivot]; return quick_sort(left) + middle + quick_sort(right),def quick_sort(arr): if len(arr) <= 1: return arr; pivot = arr[len(arr) // 2]; left = [x for x in arr if x < pivot]; middle = [x for x in arr if x != pivot]; right = [x for x in arr if x > pivot]; return quick_sort(left) + middle + quick_sort(right),1,decision
+def quick_sort(arr): if len(arr) <= 1: return arr; pivot = arr[len(arr) // 2]; left = [x for x in arr if x < pivot]; middle = [x for x in arr if x == pivot]; right = [x for x in arr if x > pivot]; return quick_sort(left) + middle + quick_sort(right),def quick_sort(arr): if len(arr) <= 1: return arr; pivot = arr[len(arr) // 2]; left = [x for x in arr if x < pivot]; middle = [x for x in arr if x != pivot]; right = [x for x in arr if x > pivot]; return quick_sort(left) + middle + quick_sort(right),def quick_sort(arr): if len(arr) <= 1: return arr; pivot = arr[len(arr) // 2]; left = [x for x in arr if x < pivot]; middle = [x for x in arr if x != pivot]; right = [x for x in arr if x > pivot]; return quick_sort(left) + middle + quick_sort(right),1,decision
+def is_even(n): return n % 2 == 0,def is_even(n): return n % 2 != 0,def is_even(n): return n % 2 != 0,1,decision
+"def gcd(a, b): return a if b == 0 else gcd(b, a % b)","def gcd(a, b): return a if b != 0 else gcd(b, a % b)","def gcd(a, b): return a if b != 0 else gcd(b, a % b)",1,decision
+"def power(x, n): return x * power(x, n-1) if n > 0 else 1","def power(x, n): return x * power(x, n-1) if n < 0 else 1","def power(x, n): return x * power(x, n-1) if n < 0 else 1",1,operation
+"def add(a, b): return a + b","def add(a, b): return a - b","def add(a, b): return a - b",1,operation
+def is_even(n): return n % 2 == 0,def is_even(n): return n % 2 != 0,def is_even(n): return n % 2 != 0,1,decision
+"def power(x, n): return x * power(x, n-1) if n > 0 else 1","def power(x, n): return x * power(x, n-1) if n < 0 else 1","def power(x, n): return x * power(x, n-1) if n < 0 else 1",1,operation
+"def binary_search(arr, target): left, right = 0, len(arr) - 1; while left <= right: mid = (left + right) // 2; if arr[mid] == target: return mid; elif arr[mid] < target: left = mid + 1; else: right = mid - 1; return -1","def binary_search(arr, target): left, right = 0, len(arr) - 1; while left <= right: mid = (left + right) // 2; if arr[mid] != target: return mid; elif arr[mid] < target: left = mid + 1; else: right = mid - 1; return -1","def binary_search(arr, target): left, right = 0, len(arr) - 1; while left <= right: mid = (left + right) // 2; if arr[mid] != target: return mid; elif arr[mid] < target: left = mid + 1; else: right = mid - 1; return -1",1,decision
+def is_palindrome(s): return s == s[::-1],def is_palindrome(s): return s != s[::-1],def is_palindrome(s): return s != s[::-1],1,decision
+def is_palindrome(s): return s == s[::-1],def is_palindrome(s): return s != s[::-1],def is_palindrome(s): return s != s[::-1],1,decision
+"def gcd(a, b): return a if b == 0 else gcd(b, a % b)","def gcd(a, b): return a if b != 0 else gcd(b, a % b)","def gcd(a, b): return a if b != 0 else gcd(b, a % b)",1,decision
+"def binary_search(arr, target): left, right = 0, len(arr) - 1; while left <= right: mid = (left + right) // 2; if arr[mid] == target: return mid; elif arr[mid] < target: left = mid + 1; else: right = mid - 1; return -1","def binary_search(arr, target): left, right = 0, len(arr) - 1; while left <= right: mid = (left + right) // 2; if arr[mid] != target: return mid; elif arr[mid] < target: left = mid + 1; else: right = mid - 1; return -1","def binary_search(arr, target): left, right = 0, len(arr) - 1; while left <= right: mid = (left + right) // 2; if arr[mid] != target: return mid; elif arr[mid] < target: left = mid + 1; else: right = mid - 1; return -1",1,decision
+def factorial(n): return n * factorial(n-1) if n > 1 else 1,def factorial(n): return n * factorial(n-1) if n < 1 else 1,def factorial(n): return n * factorial(n-1) if n < 1 else 1,1,operation
+def fibonacci(n): return 1 if n <= 1 else fibonacci(n-1) + fibonacci(n-2),def fibonacci(n): return 1 if n >= 1 else fibonacci(n-1) + fibonacci(n-2),def fibonacci(n): return 1 if n >= 1 else fibonacci(n-1) + fibonacci(n-2),1,operation
+def is_even(n): return n % 2 == 0,def is_even(n): return n % 2 != 0,def is_even(n): return n % 2 != 0,1,decision
+def is_even(n): return n % 2 == 0,def is_even(n): return n % 2 != 0,def is_even(n): return n % 2 != 0,1,decision
+def is_palindrome(s): return s == s[::-1],def is_palindrome(s): return s != s[::-1],def is_palindrome(s): return s != s[::-1],1,decision
+def quick_sort(arr): if len(arr) <= 1: return arr; pivot = arr[len(arr) // 2]; left = [x for x in arr if x < pivot]; middle = [x for x in arr if x == pivot]; right = [x for x in arr if x > pivot]; return quick_sort(left) + middle + quick_sort(right),def quick_sort(arr): if len(arr) <= 1: return arr; pivot = arr[len(arr) // 2]; left = [x for x in arr if x < pivot]; middle = [x for x in arr if x != pivot]; right = [x for x in arr if x > pivot]; return quick_sort(left) + middle + quick_sort(right),def quick_sort(arr): if len(arr) <= 1: return arr; pivot = arr[len(arr) // 2]; left = [x for x in arr if x < pivot]; middle = [x for x in arr if x != pivot]; right = [x for x in arr if x > pivot]; return quick_sort(left) + middle + quick_sort(right),1,decision
+"def add(a, b): return a + b","def add(a, b): return a - b","def add(a, b): return a - b",1,operation
+"def add(a, b): return a + b","def add(a, b): return a - b","def add(a, b): return a - b",1,operation
+def fibonacci(n): return 1 if n <= 1 else fibonacci(n-1) + fibonacci(n-2),def fibonacci(n): return 1 if n >= 1 else fibonacci(n-1) + fibonacci(n-2),def fibonacci(n): return 1 if n >= 1 else fibonacci(n-1) + fibonacci(n-2),1,operation
+"def add(a, b): return a + b","def add(a, b): return a - b","def add(a, b): return a - b",1,operation
+"def add(a, b): return a + b","def add(a, b): return a - b","def add(a, b): return a - b",1,operation
+"def power(x, n): return x * power(x, n-1) if n > 0 else 1","def power(x, n): return x * power(x, n-1) if n < 0 else 1","def power(x, n): return x * power(x, n-1) if n < 0 else 1",1,operation
+"def add(a, b): return a + b","def add(a, b): return a - b","def add(a, b): return a - b",1,operation
+def is_even(n): return n % 2 == 0,def is_even(n): return n % 2 != 0,def is_even(n): return n % 2 != 0,1,decision
+"def add(a, b): return a + b","def add(a, b): return a - b","def add(a, b): return a - b",1,operation
+"def power(x, n): return x * power(x, n-1) if n > 0 else 1","def power(x, n): return x * power(x, n-1) if n < 0 else 1","def power(x, n): return x * power(x, n-1) if n < 0 else 1",1,operation
+def fibonacci(n): return 1 if n <= 1 else fibonacci(n-1) + fibonacci(n-2),def fibonacci(n): return 1 if n >= 1 else fibonacci(n-1) + fibonacci(n-2),def fibonacci(n): return 1 if n >= 1 else fibonacci(n-1) + fibonacci(n-2),1,operation
+"def add(a, b): return a + b","def add(a, b): return a - b","def add(a, b): return a - b",1,operation
+"def power(x, n): return x * power(x, n-1) if n > 0 else 1","def power(x, n): return x * power(x, n-1) if n < 0 else 1","def power(x, n): return x * power(x, n-1) if n < 0 else 1",1,operation
+def quick_sort(arr): if len(arr) <= 1: return arr; pivot = arr[len(arr) // 2]; left = [x for x in arr if x < pivot]; middle = [x for x in arr if x == pivot]; right = [x for x in arr if x > pivot]; return quick_sort(left) + middle + quick_sort(right),def quick_sort(arr): if len(arr) <= 1: return arr; pivot = arr[len(arr) // 2]; left = [x for x in arr if x < pivot]; middle = [x for x in arr if x != pivot]; right = [x for x in arr if x > pivot]; return quick_sort(left) + middle + quick_sort(right),def quick_sort(arr): if len(arr) <= 1: return arr; pivot = arr[len(arr) // 2]; left = [x for x in arr if x < pivot]; middle = [x for x in arr if x != pivot]; right = [x for x in arr if x > pivot]; return quick_sort(left) + middle + quick_sort(right),1,decision
+"def power(x, n): return x * power(x, n-1) if n > 0 else 1","def power(x, n): return x * power(x, n-1) if n < 0 else 1","def power(x, n): return x * power(x, n-1) if n < 0 else 1",1,operation
+"def add(a, b): return a + b","def add(a, b): return a - b","def add(a, b): return a - b",1,operation
+"def add(a, b): return a + b","def add(a, b): return a - b","def add(a, b): return a - b",1,operation
+def is_even(n): return n % 2 == 0,def is_even(n): return n % 2 != 0,def is_even(n): return n % 2 != 0,1,decision
+"def binary_search(arr, target): left, right = 0, len(arr) - 1; while left <= right: mid = (left + right) // 2; if arr[mid] == target: return mid; elif arr[mid] < target: left = mid + 1; else: right = mid - 1; return -1","def binary_search(arr, target): left, right = 0, len(arr) - 1; while left <= right: mid = (left + right) // 2; if arr[mid] != target: return mid; elif arr[mid] < target: left = mid + 1; else: right = mid - 1; return -1","def binary_search(arr, target): left, right = 0, len(arr) - 1; while left <= right: mid = (left + right) // 2; if arr[mid] != target: return mid; elif arr[mid] < target: left = mid + 1; else: right = mid - 1; return -1",1,decision
+def quick_sort(arr): if len(arr) <= 1: return arr; pivot = arr[len(arr) // 2]; left = [x for x in arr if x < pivot]; middle = [x for x in arr if x == pivot]; right = [x for x in arr if x > pivot]; return quick_sort(left) + middle + quick_sort(right),def quick_sort(arr): if len(arr) <= 1: return arr; pivot = arr[len(arr) // 2]; left = [x for x in arr if x < pivot]; middle = [x for x in arr if x != pivot]; right = [x for x in arr if x > pivot]; return quick_sort(left) + middle + quick_sort(right),def quick_sort(arr): if len(arr) <= 1: return arr; pivot = arr[len(arr) // 2]; left = [x for x in arr if x < pivot]; middle = [x for x in arr if x != pivot]; right = [x for x in arr if x > pivot]; return quick_sort(left) + middle + quick_sort(right),1,decision
+def is_palindrome(s): return s == s[::-1],def is_palindrome(s): return s != s[::-1],def is_palindrome(s): return s != s[::-1],1,decision
+def is_palindrome(s): return s == s[::-1],def is_palindrome(s): return s != s[::-1],def is_palindrome(s): return s != s[::-1],1,decision
+def fibonacci(n): return 1 if n <= 1 else fibonacci(n-1) + fibonacci(n-2),def fibonacci(n): return 1 if n >= 1 else fibonacci(n-1) + fibonacci(n-2),def fibonacci(n): return 1 if n >= 1 else fibonacci(n-1) + fibonacci(n-2),1,operation
+def factorial(n): return n * factorial(n-1) if n > 1 else 1,def factorial(n): return n * factorial(n-1) if n < 1 else 1,def factorial(n): return n * factorial(n-1) if n < 1 else 1,1,operation
+def quick_sort(arr): if len(arr) <= 1: return arr; pivot = arr[len(arr) // 2]; left = [x for x in arr if x < pivot]; middle = [x for x in arr if x == pivot]; right = [x for x in arr if x > pivot]; return quick_sort(left) + middle + quick_sort(right),def quick_sort(arr): if len(arr) <= 1: return arr; pivot = arr[len(arr) // 2]; left = [x for x in arr if x < pivot]; middle = [x for x in arr if x != pivot]; right = [x for x in arr if x > pivot]; return quick_sort(left) + middle + quick_sort(right),def quick_sort(arr): if len(arr) <= 1: return arr; pivot = arr[len(arr) // 2]; left = [x for x in arr if x < pivot]; middle = [x for x in arr if x != pivot]; right = [x for x in arr if x > pivot]; return quick_sort(left) + middle + quick_sort(right),1,decision
+"def binary_search(arr, target): left, right = 0, len(arr) - 1; while left <= right: mid = (left + right) // 2; if arr[mid] == target: return mid; elif arr[mid] < target: left = mid + 1; else: right = mid - 1; return -1","def binary_search(arr, target): left, right = 0, len(arr) - 1; while left <= right: mid = (left + right) // 2; if arr[mid] != target: return mid; elif arr[mid] < target: left = mid + 1; else: right = mid - 1; return -1","def binary_search(arr, target): left, right = 0, len(arr) - 1; while left <= right: mid = (left + right) // 2; if arr[mid] != target: return mid; elif arr[mid] < target: left = mid + 1; else: right = mid - 1; return -1",1,decision
+"def power(x, n): return x * power(x, n-1) if n > 0 else 1","def power(x, n): return x * power(x, n-1) if n < 0 else 1","def power(x, n): return x * power(x, n-1) if n < 0 else 1",1,operation
+def factorial(n): return n * factorial(n-1) if n > 1 else 1,def factorial(n): return n * factorial(n-1) if n < 1 else 1,def factorial(n): return n * factorial(n-1) if n < 1 else 1,1,operation
+def is_even(n): return n % 2 == 0,def is_even(n): return n % 2 != 0,def is_even(n): return n % 2 != 0,1,decision
+"def add(a, b): return a + b","def add(a, b): return a - b","def add(a, b): return a - b",1,operation
+def quick_sort(arr): if len(arr) <= 1: return arr; pivot = arr[len(arr) // 2]; left = [x for x in arr if x < pivot]; middle = [x for x in arr if x == pivot]; right = [x for x in arr if x > pivot]; return quick_sort(left) + middle + quick_sort(right),def quick_sort(arr): if len(arr) <= 1: return arr; pivot = arr[len(arr) // 2]; left = [x for x in arr if x < pivot]; middle = [x for x in arr if x != pivot]; right = [x for x in arr if x > pivot]; return quick_sort(left) + middle + quick_sort(right),def quick_sort(arr): if len(arr) <= 1: return arr; pivot = arr[len(arr) // 2]; left = [x for x in arr if x < pivot]; middle = [x for x in arr if x != pivot]; right = [x for x in arr if x > pivot]; return quick_sort(left) + middle + quick_sort(right),1,decision
+"def gcd(a, b): return a if b == 0 else gcd(b, a % b)","def gcd(a, b): return a if b != 0 else gcd(b, a % b)","def gcd(a, b): return a if b != 0 else gcd(b, a % b)",1,decision
+def is_palindrome(s): return s == s[::-1],def is_palindrome(s): return s != s[::-1],def is_palindrome(s): return s != s[::-1],1,decision
+"def add(a, b): return a + b","def add(a, b): return a - b","def add(a, b): return a - b",1,operation
+def fibonacci(n): return 1 if n <= 1 else fibonacci(n-1) + fibonacci(n-2),def fibonacci(n): return 1 if n >= 1 else fibonacci(n-1) + fibonacci(n-2),def fibonacci(n): return 1 if n >= 1 else fibonacci(n-1) + fibonacci(n-2),1,operation
+"def power(x, n): return x * power(x, n-1) if n > 0 else 1","def power(x, n): return x * power(x, n-1) if n < 0 else 1","def power(x, n): return x * power(x, n-1) if n < 0 else 1",1,operation
+def fibonacci(n): return 1 if n <= 1 else fibonacci(n-1) + fibonacci(n-2),def fibonacci(n): return 1 if n >= 1 else fibonacci(n-1) + fibonacci(n-2),def fibonacci(n): return 1 if n >= 1 else fibonacci(n-1) + fibonacci(n-2),1,operation
+"def add(a, b): return a + b","def add(a, b): return a - b","def add(a, b): return a - b",1,operation
+"def add(a, b): return a + b","def add(a, b): return a - b","def add(a, b): return a - b",1,operation
+def quick_sort(arr): if len(arr) <= 1: return arr; pivot = arr[len(arr) // 2]; left = [x for x in arr if x < pivot]; middle = [x for x in arr if x == pivot]; right = [x for x in arr if x > pivot]; return quick_sort(left) + middle + quick_sort(right),def quick_sort(arr): if len(arr) <= 1: return arr; pivot = arr[len(arr) // 2]; left = [x for x in arr if x < pivot]; middle = [x for x in arr if x != pivot]; right = [x for x in arr if x > pivot]; return quick_sort(left) + middle + quick_sort(right),def quick_sort(arr): if len(arr) <= 1: return arr; pivot = arr[len(arr) // 2]; left = [x for x in arr if x < pivot]; middle = [x for x in arr if x != pivot]; right = [x for x in arr if x > pivot]; return quick_sort(left) + middle + quick_sort(right),1,decision
+def factorial(n): return n * factorial(n-1) if n > 1 else 1,def factorial(n): return n * factorial(n-1) if n < 1 else 1,def factorial(n): return n * factorial(n-1) if n < 1 else 1,1,operation
+def fibonacci(n): return 1 if n <= 1 else fibonacci(n-1) + fibonacci(n-2),def fibonacci(n): return 1 if n >= 1 else fibonacci(n-1) + fibonacci(n-2),def fibonacci(n): return 1 if n >= 1 else fibonacci(n-1) + fibonacci(n-2),1,operation
+"def binary_search(arr, target): left, right = 0, len(arr) - 1; while left <= right: mid = (left + right) // 2; if arr[mid] == target: return mid; elif arr[mid] < target: left = mid + 1; else: right = mid - 1; return -1","def binary_search(arr, target): left, right = 0, len(arr) - 1; while left <= right: mid = (left + right) // 2; if arr[mid] != target: return mid; elif arr[mid] < target: left = mid + 1; else: right = mid - 1; return -1","def binary_search(arr, target): left, right = 0, len(arr) - 1; while left <= right: mid = (left + right) // 2; if arr[mid] != target: return mid; elif arr[mid] < target: left = mid + 1; else: right = mid - 1; return -1",1,decision
+"def binary_search(arr, target): left, right = 0, len(arr) - 1; while left <= right: mid = (left + right) // 2; if arr[mid] == target: return mid; elif arr[mid] < target: left = mid + 1; else: right = mid - 1; return -1","def binary_search(arr, target): left, right = 0, len(arr) - 1; while left <= right: mid = (left + right) // 2; if arr[mid] != target: return mid; elif arr[mid] < target: left = mid + 1; else: right = mid - 1; return -1","def binary_search(arr, target): left, right = 0, len(arr) - 1; while left <= right: mid = (left + right) // 2; if arr[mid] != target: return mid; elif arr[mid] < target: left = mid + 1; else: right = mid - 1; return -1",1,decision
+def fibonacci(n): return 1 if n <= 1 else fibonacci(n-1) + fibonacci(n-2),def fibonacci(n): return 1 if n >= 1 else fibonacci(n-1) + fibonacci(n-2),def fibonacci(n): return 1 if n >= 1 else fibonacci(n-1) + fibonacci(n-2),1,operation
+"def add(a, b): return a + b","def add(a, b): return a - b","def add(a, b): return a - b",1,operation
+def is_even(n): return n % 2 == 0,def is_even(n): return n % 2 != 0,def is_even(n): return n % 2 != 0,1,decision
+def quick_sort(arr): if len(arr) <= 1: return arr; pivot = arr[len(arr) // 2]; left = [x for x in arr if x < pivot]; middle = [x for x in arr if x == pivot]; right = [x for x in arr if x > pivot]; return quick_sort(left) + middle + quick_sort(right),def quick_sort(arr): if len(arr) <= 1: return arr; pivot = arr[len(arr) // 2]; left = [x for x in arr if x < pivot]; middle = [x for x in arr if x != pivot]; right = [x for x in arr if x > pivot]; return quick_sort(left) + middle + quick_sort(right),def quick_sort(arr): if len(arr) <= 1: return arr; pivot = arr[len(arr) // 2]; left = [x for x in arr if x < pivot]; middle = [x for x in arr if x != pivot]; right = [x for x in arr if x > pivot]; return quick_sort(left) + middle + quick_sort(right),1,decision
+"def gcd(a, b): return a if b == 0 else gcd(b, a % b)","def gcd(a, b): return a if b != 0 else gcd(b, a % b)","def gcd(a, b): return a if b != 0 else gcd(b, a % b)",1,decision
+def is_even(n): return n % 2 == 0,def is_even(n): return n % 2 != 0,def is_even(n): return n % 2 != 0,1,decision
+def quick_sort(arr): if len(arr) <= 1: return arr; pivot = arr[len(arr) // 2]; left = [x for x in arr if x < pivot]; middle = [x for x in arr if x == pivot]; right = [x for x in arr if x > pivot]; return quick_sort(left) + middle + quick_sort(right),def quick_sort(arr): if len(arr) <= 1: return arr; pivot = arr[len(arr) // 2]; left = [x for x in arr if x < pivot]; middle = [x for x in arr if x != pivot]; right = [x for x in arr if x > pivot]; return quick_sort(left) + middle + quick_sort(right),def quick_sort(arr): if len(arr) <= 1: return arr; pivot = arr[len(arr) // 2]; left = [x for x in arr if x < pivot]; middle = [x for x in arr if x != pivot]; right = [x for x in arr if x > pivot]; return quick_sort(left) + middle + quick_sort(right),1,decision
+def is_even(n): return n % 2 == 0,def is_even(n): return n % 2 != 0,def is_even(n): return n % 2 != 0,1,decision
+def is_palindrome(s): return s == s[::-1],def is_palindrome(s): return s != s[::-1],def is_palindrome(s): return s != s[::-1],1,decision
+"def power(x, n): return x * power(x, n-1) if n > 0 else 1","def power(x, n): return x * power(x, n-1) if n < 0 else 1","def power(x, n): return x * power(x, n-1) if n < 0 else 1",1,operation
+def is_palindrome(s): return s == s[::-1],def is_palindrome(s): return s != s[::-1],def is_palindrome(s): return s != s[::-1],1,decision
+def factorial(n): return n * factorial(n-1) if n > 1 else 1,def factorial(n): return n * factorial(n-1) if n < 1 else 1,def factorial(n): return n * factorial(n-1) if n < 1 else 1,1,operation
+"def binary_search(arr, target): left, right = 0, len(arr) - 1; while left <= right: mid = (left + right) // 2; if arr[mid] == target: return mid; elif arr[mid] < target: left = mid + 1; else: right = mid - 1; return -1","def binary_search(arr, target): left, right = 0, len(arr) - 1; while left <= right: mid = (left + right) // 2; if arr[mid] != target: return mid; elif arr[mid] < target: left = mid + 1; else: right = mid - 1; return -1","def binary_search(arr, target): left, right = 0, len(arr) - 1; while left <= right: mid = (left + right) // 2; if arr[mid] != target: return mid; elif arr[mid] < target: left = mid + 1; else: right = mid - 1; return -1",1,decision
+def is_palindrome(s): return s == s[::-1],def is_palindrome(s): return s != s[::-1],def is_palindrome(s): return s != s[::-1],1,decision
+"def binary_search(arr, target): left, right = 0, len(arr) - 1; while left <= right: mid = (left + right) // 2; if arr[mid] == target: return mid; elif arr[mid] < target: left = mid + 1; else: right = mid - 1; return -1","def binary_search(arr, target): left, right = 0, len(arr) - 1; while left <= right: mid = (left + right) // 2; if arr[mid] != target: return mid; elif arr[mid] < target: left = mid + 1; else: right = mid - 1; return -1","def binary_search(arr, target): left, right = 0, len(arr) - 1; while left <= right: mid = (left + right) // 2; if arr[mid] != target: return mid; elif arr[mid] < target: left = mid + 1; else: right = mid - 1; return -1",1,decision
+"def add(a, b): return a + b","def add(a, b): return a - b","def add(a, b): return a - b",1,operation
+def is_even(n): return n % 2 == 0,def is_even(n): return n % 2 != 0,def is_even(n): return n % 2 != 0,1,decision
+def is_palindrome(s): return s == s[::-1],def is_palindrome(s): return s != s[::-1],def is_palindrome(s): return s != s[::-1],1,decision
+def factorial(n): return n * factorial(n-1) if n > 1 else 1,def factorial(n): return n * factorial(n-1) if n < 1 else 1,def factorial(n): return n * factorial(n-1) if n < 1 else 1,1,operation
+def is_palindrome(s): return s == s[::-1],def is_palindrome(s): return s != s[::-1],def is_palindrome(s): return s != s[::-1],1,decision
+def is_palindrome(s): return s == s[::-1],def is_palindrome(s): return s != s[::-1],def is_palindrome(s): return s != s[::-1],1,decision
+def quick_sort(arr): if len(arr) <= 1: return arr; pivot = arr[len(arr) // 2]; left = [x for x in arr if x < pivot]; middle = [x for x in arr if x == pivot]; right = [x for x in arr if x > pivot]; return quick_sort(left) + middle + quick_sort(right),def quick_sort(arr): if len(arr) <= 1: return arr; pivot = arr[len(arr) // 2]; left = [x for x in arr if x < pivot]; middle = [x for x in arr if x != pivot]; right = [x for x in arr if x > pivot]; return quick_sort(left) + middle + quick_sort(right),def quick_sort(arr): if len(arr) <= 1: return arr; pivot = arr[len(arr) // 2]; left = [x for x in arr if x < pivot]; middle = [x for x in arr if x != pivot]; right = [x for x in arr if x > pivot]; return quick_sort(left) + middle + quick_sort(right),1,decision
+def is_palindrome(s): return s == s[::-1],def is_palindrome(s): return s != s[::-1],def is_palindrome(s): return s != s[::-1],1,decision
+def is_even(n): return n % 2 == 0,def is_even(n): return n % 2 != 0,def is_even(n): return n % 2 != 0,1,decision
+"def power(x, n): return x * power(x, n-1) if n > 0 else 1","def power(x, n): return x * power(x, n-1) if n < 0 else 1","def power(x, n): return x * power(x, n-1) if n < 0 else 1",1,operation
+"def gcd(a, b): return a if b == 0 else gcd(b, a % b)","def gcd(a, b): return a if b != 0 else gcd(b, a % b)","def gcd(a, b): return a if b != 0 else gcd(b, a % b)",1,decision
+def quick_sort(arr): if len(arr) <= 1: return arr; pivot = arr[len(arr) // 2]; left = [x for x in arr if x < pivot]; middle = [x for x in arr if x == pivot]; right = [x for x in arr if x > pivot]; return quick_sort(left) + middle + quick_sort(right),def quick_sort(arr): if len(arr) <= 1: return arr; pivot = arr[len(arr) // 2]; left = [x for x in arr if x < pivot]; middle = [x for x in arr if x != pivot]; right = [x for x in arr if x > pivot]; return quick_sort(left) + middle + quick_sort(right),def quick_sort(arr): if len(arr) <= 1: return arr; pivot = arr[len(arr) // 2]; left = [x for x in arr if x < pivot]; middle = [x for x in arr if x != pivot]; right = [x for x in arr if x > pivot]; return quick_sort(left) + middle + quick_sort(right),1,decision
+def quick_sort(arr): if len(arr) <= 1: return arr; pivot = arr[len(arr) // 2]; left = [x for x in arr if x < pivot]; middle = [x for x in arr if x == pivot]; right = [x for x in arr if x > pivot]; return quick_sort(left) + middle + quick_sort(right),def quick_sort(arr): if len(arr) <= 1: return arr; pivot = arr[len(arr) // 2]; left = [x for x in arr if x < pivot]; middle = [x for x in arr if x != pivot]; right = [x for x in arr if x > pivot]; return quick_sort(left) + middle + quick_sort(right),def quick_sort(arr): if len(arr) <= 1: return arr; pivot = arr[len(arr) // 2]; left = [x for x in arr if x < pivot]; middle = [x for x in arr if x != pivot]; right = [x for x in arr if x > pivot]; return quick_sort(left) + middle + quick_sort(right),1,decision
+def is_palindrome(s): return s == s[::-1],def is_palindrome(s): return s != s[::-1],def is_palindrome(s): return s != s[::-1],1,decision
+"def binary_search(arr, target): left, right = 0, len(arr) - 1; while left <= right: mid = (left + right) // 2; if arr[mid] == target: return mid; elif arr[mid] < target: left = mid + 1; else: right = mid - 1; return -1","def binary_search(arr, target): left, right = 0, len(arr) - 1; while left <= right: mid = (left + right) // 2; if arr[mid] != target: return mid; elif arr[mid] < target: left = mid + 1; else: right = mid - 1; return -1","def binary_search(arr, target): left, right = 0, len(arr) - 1; while left <= right: mid = (left + right) // 2; if arr[mid] != target: return mid; elif arr[mid] < target: left = mid + 1; else: right = mid - 1; return -1",1,decision
+"def gcd(a, b): return a if b == 0 else gcd(b, a % b)","def gcd(a, b): return a if b != 0 else gcd(b, a % b)","def gcd(a, b): return a if b != 0 else gcd(b, a % b)",1,decision
+"def power(x, n): return x * power(x, n-1) if n > 0 else 1","def power(x, n): return x * power(x, n-1) if n < 0 else 1","def power(x, n): return x * power(x, n-1) if n < 0 else 1",1,operation
+"def add(a, b): return a + b","def add(a, b): return a - b","def add(a, b): return a - b",1,operation
+"def binary_search(arr, target): left, right = 0, len(arr) - 1; while left <= right: mid = (left + right) // 2; if arr[mid] == target: return mid; elif arr[mid] < target: left = mid + 1; else: right = mid - 1; return -1","def binary_search(arr, target): left, right = 0, len(arr) - 1; while left <= right: mid = (left + right) // 2; if arr[mid] != target: return mid; elif arr[mid] < target: left = mid + 1; else: right = mid - 1; return -1","def binary_search(arr, target): left, right = 0, len(arr) - 1; while left <= right: mid = (left + right) // 2; if arr[mid] != target: return mid; elif arr[mid] < target: left = mid + 1; else: right = mid - 1; return -1",1,decision
+def fibonacci(n): return 1 if n <= 1 else fibonacci(n-1) + fibonacci(n-2),def fibonacci(n): return 1 if n >= 1 else fibonacci(n-1) + fibonacci(n-2),def fibonacci(n): return 1 if n >= 1 else fibonacci(n-1) + fibonacci(n-2),1,operation
+"def binary_search(arr, target): left, right = 0, len(arr) - 1; while left <= right: mid = (left + right) // 2; if arr[mid] == target: return mid; elif arr[mid] < target: left = mid + 1; else: right = mid - 1; return -1","def binary_search(arr, target): left, right = 0, len(arr) - 1; while left <= right: mid = (left + right) // 2; if arr[mid] != target: return mid; elif arr[mid] < target: left = mid + 1; else: right = mid - 1; return -1","def binary_search(arr, target): left, right = 0, len(arr) - 1; while left <= right: mid = (left + right) // 2; if arr[mid] != target: return mid; elif arr[mid] < target: left = mid + 1; else: right = mid - 1; return -1",1,decision
+def is_palindrome(s): return s == s[::-1],def is_palindrome(s): return s != s[::-1],def is_palindrome(s): return s != s[::-1],1,decision
+def factorial(n): return n * factorial(n-1) if n > 1 else 1,def factorial(n): return n * factorial(n-1) if n < 1 else 1,def factorial(n): return n * factorial(n-1) if n < 1 else 1,1,operation
+def fibonacci(n): return 1 if n <= 1 else fibonacci(n-1) + fibonacci(n-2),def fibonacci(n): return 1 if n >= 1 else fibonacci(n-1) + fibonacci(n-2),def fibonacci(n): return 1 if n >= 1 else fibonacci(n-1) + fibonacci(n-2),1,operation
+"def binary_search(arr, target): left, right = 0, len(arr) - 1; while left <= right: mid = (left + right) // 2; if arr[mid] == target: return mid; elif arr[mid] < target: left = mid + 1; else: right = mid - 1; return -1","def binary_search(arr, target): left, right = 0, len(arr) - 1; while left <= right: mid = (left + right) // 2; if arr[mid] != target: return mid; elif arr[mid] < target: left = mid + 1; else: right = mid - 1; return -1","def binary_search(arr, target): left, right = 0, len(arr) - 1; while left <= right: mid = (left + right) // 2; if arr[mid] != target: return mid; elif arr[mid] < target: left = mid + 1; else: right = mid - 1; return -1",1,decision
+def factorial(n): return n * factorial(n-1) if n > 1 else 1,def factorial(n): return n * factorial(n-1) if n < 1 else 1,def factorial(n): return n * factorial(n-1) if n < 1 else 1,1,operation
+def quick_sort(arr): if len(arr) <= 1: return arr; pivot = arr[len(arr) // 2]; left = [x for x in arr if x < pivot]; middle = [x for x in arr if x == pivot]; right = [x for x in arr if x > pivot]; return quick_sort(left) + middle + quick_sort(right),def quick_sort(arr): if len(arr) <= 1: return arr; pivot = arr[len(arr) // 2]; left = [x for x in arr if x < pivot]; middle = [x for x in arr if x != pivot]; right = [x for x in arr if x > pivot]; return quick_sort(left) + middle + quick_sort(right),def quick_sort(arr): if len(arr) <= 1: return arr; pivot = arr[len(arr) // 2]; left = [x for x in arr if x < pivot]; middle = [x for x in arr if x != pivot]; right = [x for x in arr if x > pivot]; return quick_sort(left) + middle + quick_sort(right),1,decision
+def factorial(n): return n * factorial(n-1) if n > 1 else 1,def factorial(n): return n * factorial(n-1) if n < 1 else 1,def factorial(n): return n * factorial(n-1) if n < 1 else 1,1,operation
+"def power(x, n): return x * power(x, n-1) if n > 0 else 1","def power(x, n): return x * power(x, n-1) if n < 0 else 1","def power(x, n): return x * power(x, n-1) if n < 0 else 1",1,operation
+"def power(x, n): return x * power(x, n-1) if n > 0 else 1","def power(x, n): return x * power(x, n-1) if n < 0 else 1","def power(x, n): return x * power(x, n-1) if n < 0 else 1",1,operation
+def fibonacci(n): return 1 if n <= 1 else fibonacci(n-1) + fibonacci(n-2),def fibonacci(n): return 1 if n >= 1 else fibonacci(n-1) + fibonacci(n-2),def fibonacci(n): return 1 if n >= 1 else fibonacci(n-1) + fibonacci(n-2),1,operation
+def quick_sort(arr): if len(arr) <= 1: return arr; pivot = arr[len(arr) // 2]; left = [x for x in arr if x < pivot]; middle = [x for x in arr if x == pivot]; right = [x for x in arr if x > pivot]; return quick_sort(left) + middle + quick_sort(right),def quick_sort(arr): if len(arr) <= 1: return arr; pivot = arr[len(arr) // 2]; left = [x for x in arr if x < pivot]; middle = [x for x in arr if x != pivot]; right = [x for x in arr if x > pivot]; return quick_sort(left) + middle + quick_sort(right),def quick_sort(arr): if len(arr) <= 1: return arr; pivot = arr[len(arr) // 2]; left = [x for x in arr if x < pivot]; middle = [x for x in arr if x != pivot]; right = [x for x in arr if x > pivot]; return quick_sort(left) + middle + quick_sort(right),1,decision
+def is_even(n): return n % 2 == 0,def is_even(n): return n % 2 != 0,def is_even(n): return n % 2 != 0,1,decision
+def is_even(n): return n % 2 == 0,def is_even(n): return n % 2 != 0,def is_even(n): return n % 2 != 0,1,decision
+"def add(a, b): return a + b","def add(a, b): return a - b","def add(a, b): return a - b",1,operation
+"def binary_search(arr, target): left, right = 0, len(arr) - 1; while left <= right: mid = (left + right) // 2; if arr[mid] == target: return mid; elif arr[mid] < target: left = mid + 1; else: right = mid - 1; return -1","def binary_search(arr, target): left, right = 0, len(arr) - 1; while left <= right: mid = (left + right) // 2; if arr[mid] != target: return mid; elif arr[mid] < target: left = mid + 1; else: right = mid - 1; return -1","def binary_search(arr, target): left, right = 0, len(arr) - 1; while left <= right: mid = (left + right) // 2; if arr[mid] != target: return mid; elif arr[mid] < target: left = mid + 1; else: right = mid - 1; return -1",1,decision
+def factorial(n): return n * factorial(n-1) if n > 1 else 1,def factorial(n): return n * factorial(n-1) if n < 1 else 1,def factorial(n): return n * factorial(n-1) if n < 1 else 1,1,operation
+def is_palindrome(s): return s == s[::-1],def is_palindrome(s): return s != s[::-1],def is_palindrome(s): return s != s[::-1],1,decision
+def is_even(n): return n % 2 == 0,def is_even(n): return n % 2 != 0,def is_even(n): return n % 2 != 0,1,decision
+def is_palindrome(s): return s == s[::-1],def is_palindrome(s): return s != s[::-1],def is_palindrome(s): return s != s[::-1],1,decision
+def is_palindrome(s): return s == s[::-1],def is_palindrome(s): return s != s[::-1],def is_palindrome(s): return s != s[::-1],1,decision
+def fibonacci(n): return 1 if n <= 1 else fibonacci(n-1) + fibonacci(n-2),def fibonacci(n): return 1 if n >= 1 else fibonacci(n-1) + fibonacci(n-2),def fibonacci(n): return 1 if n >= 1 else fibonacci(n-1) + fibonacci(n-2),1,operation
+def quick_sort(arr): if len(arr) <= 1: return arr; pivot = arr[len(arr) // 2]; left = [x for x in arr if x < pivot]; middle = [x for x in arr if x == pivot]; right = [x for x in arr if x > pivot]; return quick_sort(left) + middle + quick_sort(right),def quick_sort(arr): if len(arr) <= 1: return arr; pivot = arr[len(arr) // 2]; left = [x for x in arr if x < pivot]; middle = [x for x in arr if x != pivot]; right = [x for x in arr if x > pivot]; return quick_sort(left) + middle + quick_sort(right),def quick_sort(arr): if len(arr) <= 1: return arr; pivot = arr[len(arr) // 2]; left = [x for x in arr if x < pivot]; middle = [x for x in arr if x != pivot]; right = [x for x in arr if x > pivot]; return quick_sort(left) + middle + quick_sort(right),1,decision
+def quick_sort(arr): if len(arr) <= 1: return arr; pivot = arr[len(arr) // 2]; left = [x for x in arr if x < pivot]; middle = [x for x in arr if x == pivot]; right = [x for x in arr if x > pivot]; return quick_sort(left) + middle + quick_sort(right),def quick_sort(arr): if len(arr) <= 1: return arr; pivot = arr[len(arr) // 2]; left = [x for x in arr if x < pivot]; middle = [x for x in arr if x != pivot]; right = [x for x in arr if x > pivot]; return quick_sort(left) + middle + quick_sort(right),def quick_sort(arr): if len(arr) <= 1: return arr; pivot = arr[len(arr) // 2]; left = [x for x in arr if x < pivot]; middle = [x for x in arr if x != pivot]; right = [x for x in arr if x > pivot]; return quick_sort(left) + middle + quick_sort(right),1,decision
+"def power(x, n): return x * power(x, n-1) if n > 0 else 1","def power(x, n): return x * power(x, n-1) if n < 0 else 1","def power(x, n): return x * power(x, n-1) if n < 0 else 1",1,operation
+"def gcd(a, b): return a if b == 0 else gcd(b, a % b)","def gcd(a, b): return a if b != 0 else gcd(b, a % b)","def gcd(a, b): return a if b != 0 else gcd(b, a % b)",1,decision
+"def power(x, n): return x * power(x, n-1) if n > 0 else 1","def power(x, n): return x * power(x, n-1) if n < 0 else 1","def power(x, n): return x * power(x, n-1) if n < 0 else 1",1,operation
+"def binary_search(arr, target): left, right = 0, len(arr) - 1; while left <= right: mid = (left + right) // 2; if arr[mid] == target: return mid; elif arr[mid] < target: left = mid + 1; else: right = mid - 1; return -1","def binary_search(arr, target): left, right = 0, len(arr) - 1; while left <= right: mid = (left + right) // 2; if arr[mid] != target: return mid; elif arr[mid] < target: left = mid + 1; else: right = mid - 1; return -1","def binary_search(arr, target): left, right = 0, len(arr) - 1; while left <= right: mid = (left + right) // 2; if arr[mid] != target: return mid; elif arr[mid] < target: left = mid + 1; else: right = mid - 1; return -1",1,decision
+def fibonacci(n): return 1 if n <= 1 else fibonacci(n-1) + fibonacci(n-2),def fibonacci(n): return 1 if n >= 1 else fibonacci(n-1) + fibonacci(n-2),def fibonacci(n): return 1 if n >= 1 else fibonacci(n-1) + fibonacci(n-2),1,operation
+"def add(a, b): return a + b","def add(a, b): return a - b","def add(a, b): return a - b",1,operation
+def is_palindrome(s): return s == s[::-1],def is_palindrome(s): return s != s[::-1],def is_palindrome(s): return s != s[::-1],1,decision
+def is_palindrome(s): return s == s[::-1],def is_palindrome(s): return s != s[::-1],def is_palindrome(s): return s != s[::-1],1,decision
+def fibonacci(n): return 1 if n <= 1 else fibonacci(n-1) + fibonacci(n-2),def fibonacci(n): return 1 if n >= 1 else fibonacci(n-1) + fibonacci(n-2),def fibonacci(n): return 1 if n >= 1 else fibonacci(n-1) + fibonacci(n-2),1,operation
+"def power(x, n): return x * power(x, n-1) if n > 0 else 1","def power(x, n): return x * power(x, n-1) if n < 0 else 1","def power(x, n): return x * power(x, n-1) if n < 0 else 1",1,operation
+def is_palindrome(s): return s == s[::-1],def is_palindrome(s): return s != s[::-1],def is_palindrome(s): return s != s[::-1],1,decision
+def is_palindrome(s): return s == s[::-1],def is_palindrome(s): return s != s[::-1],def is_palindrome(s): return s != s[::-1],1,decision
+def is_even(n): return n % 2 == 0,def is_even(n): return n % 2 != 0,def is_even(n): return n % 2 != 0,1,decision
+"def binary_search(arr, target): left, right = 0, len(arr) - 1; while left <= right: mid = (left + right) // 2; if arr[mid] == target: return mid; elif arr[mid] < target: left = mid + 1; else: right = mid - 1; return -1","def binary_search(arr, target): left, right = 0, len(arr) - 1; while left <= right: mid = (left + right) // 2; if arr[mid] != target: return mid; elif arr[mid] < target: left = mid + 1; else: right = mid - 1; return -1","def binary_search(arr, target): left, right = 0, len(arr) - 1; while left <= right: mid = (left + right) // 2; if arr[mid] != target: return mid; elif arr[mid] < target: left = mid + 1; else: right = mid - 1; return -1",1,decision
+"def add(a, b): return a + b","def add(a, b): return a - b","def add(a, b): return a - b",1,operation
+def quick_sort(arr): if len(arr) <= 1: return arr; pivot = arr[len(arr) // 2]; left = [x for x in arr if x < pivot]; middle = [x for x in arr if x == pivot]; right = [x for x in arr if x > pivot]; return quick_sort(left) + middle + quick_sort(right),def quick_sort(arr): if len(arr) <= 1: return arr; pivot = arr[len(arr) // 2]; left = [x for x in arr if x < pivot]; middle = [x for x in arr if x != pivot]; right = [x for x in arr if x > pivot]; return quick_sort(left) + middle + quick_sort(right),def quick_sort(arr): if len(arr) <= 1: return arr; pivot = arr[len(arr) // 2]; left = [x for x in arr if x < pivot]; middle = [x for x in arr if x != pivot]; right = [x for x in arr if x > pivot]; return quick_sort(left) + middle + quick_sort(right),1,decision
+"def power(x, n): return x * power(x, n-1) if n > 0 else 1","def power(x, n): return x * power(x, n-1) if n < 0 else 1","def power(x, n): return x * power(x, n-1) if n < 0 else 1",1,operation
+def is_even(n): return n % 2 == 0,def is_even(n): return n % 2 != 0,def is_even(n): return n % 2 != 0,1,decision
+def quick_sort(arr): if len(arr) <= 1: return arr; pivot = arr[len(arr) // 2]; left = [x for x in arr if x < pivot]; middle = [x for x in arr if x == pivot]; right = [x for x in arr if x > pivot]; return quick_sort(left) + middle + quick_sort(right),def quick_sort(arr): if len(arr) <= 1: return arr; pivot = arr[len(arr) // 2]; left = [x for x in arr if x < pivot]; middle = [x for x in arr if x != pivot]; right = [x for x in arr if x > pivot]; return quick_sort(left) + middle + quick_sort(right),def quick_sort(arr): if len(arr) <= 1: return arr; pivot = arr[len(arr) // 2]; left = [x for x in arr if x < pivot]; middle = [x for x in arr if x != pivot]; right = [x for x in arr if x > pivot]; return quick_sort(left) + middle + quick_sort(right),1,decision
+"def add(a, b): return a + b","def add(a, b): return a - b","def add(a, b): return a - b",1,operation
+"def power(x, n): return x * power(x, n-1) if n > 0 else 1","def power(x, n): return x * power(x, n-1) if n < 0 else 1","def power(x, n): return x * power(x, n-1) if n < 0 else 1",1,operation
+"def binary_search(arr, target): left, right = 0, len(arr) - 1; while left <= right: mid = (left + right) // 2; if arr[mid] == target: return mid; elif arr[mid] < target: left = mid + 1; else: right = mid - 1; return -1","def binary_search(arr, target): left, right = 0, len(arr) - 1; while left <= right: mid = (left + right) // 2; if arr[mid] != target: return mid; elif arr[mid] < target: left = mid + 1; else: right = mid - 1; return -1","def binary_search(arr, target): left, right = 0, len(arr) - 1; while left <= right: mid = (left + right) // 2; if arr[mid] != target: return mid; elif arr[mid] < target: left = mid + 1; else: right = mid - 1; return -1",1,decision
+def quick_sort(arr): if len(arr) <= 1: return arr; pivot = arr[len(arr) // 2]; left = [x for x in arr if x < pivot]; middle = [x for x in arr if x == pivot]; right = [x for x in arr if x > pivot]; return quick_sort(left) + middle + quick_sort(right),def quick_sort(arr): if len(arr) <= 1: return arr; pivot = arr[len(arr) // 2]; left = [x for x in arr if x < pivot]; middle = [x for x in arr if x != pivot]; right = [x for x in arr if x > pivot]; return quick_sort(left) + middle + quick_sort(right),def quick_sort(arr): if len(arr) <= 1: return arr; pivot = arr[len(arr) // 2]; left = [x for x in arr if x < pivot]; middle = [x for x in arr if x != pivot]; right = [x for x in arr if x > pivot]; return quick_sort(left) + middle + quick_sort(right),1,decision
+def factorial(n): return n * factorial(n-1) if n > 1 else 1,def factorial(n): return n * factorial(n-1) if n < 1 else 1,def factorial(n): return n * factorial(n-1) if n < 1 else 1,1,operation
+def quick_sort(arr): if len(arr) <= 1: return arr; pivot = arr[len(arr) // 2]; left = [x for x in arr if x < pivot]; middle = [x for x in arr if x == pivot]; right = [x for x in arr if x > pivot]; return quick_sort(left) + middle + quick_sort(right),def quick_sort(arr): if len(arr) <= 1: return arr; pivot = arr[len(arr) // 2]; left = [x for x in arr if x < pivot]; middle = [x for x in arr if x != pivot]; right = [x for x in arr if x > pivot]; return quick_sort(left) + middle + quick_sort(right),def quick_sort(arr): if len(arr) <= 1: return arr; pivot = arr[len(arr) // 2]; left = [x for x in arr if x < pivot]; middle = [x for x in arr if x != pivot]; right = [x for x in arr if x > pivot]; return quick_sort(left) + middle + quick_sort(right),1,decision
+"def add(a, b): return a + b","def add(a, b): return a - b","def add(a, b): return a - b",1,operation
+def factorial(n): return n * factorial(n-1) if n > 1 else 1,def factorial(n): return n * factorial(n-1) if n < 1 else 1,def factorial(n): return n * factorial(n-1) if n < 1 else 1,1,operation
+def quick_sort(arr): if len(arr) <= 1: return arr; pivot = arr[len(arr) // 2]; left = [x for x in arr if x < pivot]; middle = [x for x in arr if x == pivot]; right = [x for x in arr if x > pivot]; return quick_sort(left) + middle + quick_sort(right),def quick_sort(arr): if len(arr) <= 1: return arr; pivot = arr[len(arr) // 2]; left = [x for x in arr if x < pivot]; middle = [x for x in arr if x != pivot]; right = [x for x in arr if x > pivot]; return quick_sort(left) + middle + quick_sort(right),def quick_sort(arr): if len(arr) <= 1: return arr; pivot = arr[len(arr) // 2]; left = [x for x in arr if x < pivot]; middle = [x for x in arr if x != pivot]; right = [x for x in arr if x > pivot]; return quick_sort(left) + middle + quick_sort(right),1,decision
+"def gcd(a, b): return a if b == 0 else gcd(b, a % b)","def gcd(a, b): return a if b != 0 else gcd(b, a % b)","def gcd(a, b): return a if b != 0 else gcd(b, a % b)",1,decision
+"def gcd(a, b): return a if b == 0 else gcd(b, a % b)","def gcd(a, b): return a if b != 0 else gcd(b, a % b)","def gcd(a, b): return a if b != 0 else gcd(b, a % b)",1,decision
+def fibonacci(n): return 1 if n <= 1 else fibonacci(n-1) + fibonacci(n-2),def fibonacci(n): return 1 if n >= 1 else fibonacci(n-1) + fibonacci(n-2),def fibonacci(n): return 1 if n >= 1 else fibonacci(n-1) + fibonacci(n-2),1,operation
+"def gcd(a, b): return a if b == 0 else gcd(b, a % b)","def gcd(a, b): return a if b != 0 else gcd(b, a % b)","def gcd(a, b): return a if b != 0 else gcd(b, a % b)",1,decision
+def is_palindrome(s): return s == s[::-1],def is_palindrome(s): return s != s[::-1],def is_palindrome(s): return s != s[::-1],1,decision
+"def gcd(a, b): return a if b == 0 else gcd(b, a % b)","def gcd(a, b): return a if b != 0 else gcd(b, a % b)","def gcd(a, b): return a if b != 0 else gcd(b, a % b)",1,decision
+def factorial(n): return n * factorial(n-1) if n > 1 else 1,def factorial(n): return n * factorial(n-1) if n < 1 else 1,def factorial(n): return n * factorial(n-1) if n < 1 else 1,1,operation
+"def binary_search(arr, target): left, right = 0, len(arr) - 1; while left <= right: mid = (left + right) // 2; if arr[mid] == target: return mid; elif arr[mid] < target: left = mid + 1; else: right = mid - 1; return -1","def binary_search(arr, target): left, right = 0, len(arr) - 1; while left <= right: mid = (left + right) // 2; if arr[mid] != target: return mid; elif arr[mid] < target: left = mid + 1; else: right = mid - 1; return -1","def binary_search(arr, target): left, right = 0, len(arr) - 1; while left <= right: mid = (left + right) // 2; if arr[mid] != target: return mid; elif arr[mid] < target: left = mid + 1; else: right = mid - 1; return -1",1,decision
+def is_even(n): return n % 2 == 0,def is_even(n): return n % 2 != 0,def is_even(n): return n % 2 != 0,1,decision
+def quick_sort(arr): if len(arr) <= 1: return arr; pivot = arr[len(arr) // 2]; left = [x for x in arr if x < pivot]; middle = [x for x in arr if x == pivot]; right = [x for x in arr if x > pivot]; return quick_sort(left) + middle + quick_sort(right),def quick_sort(arr): if len(arr) <= 1: return arr; pivot = arr[len(arr) // 2]; left = [x for x in arr if x < pivot]; middle = [x for x in arr if x != pivot]; right = [x for x in arr if x > pivot]; return quick_sort(left) + middle + quick_sort(right),def quick_sort(arr): if len(arr) <= 1: return arr; pivot = arr[len(arr) // 2]; left = [x for x in arr if x < pivot]; middle = [x for x in arr if x != pivot]; right = [x for x in arr if x > pivot]; return quick_sort(left) + middle + quick_sort(right),1,decision
+def fibonacci(n): return 1 if n <= 1 else fibonacci(n-1) + fibonacci(n-2),def fibonacci(n): return 1 if n >= 1 else fibonacci(n-1) + fibonacci(n-2),def fibonacci(n): return 1 if n >= 1 else fibonacci(n-1) + fibonacci(n-2),1,operation
+def factorial(n): return n * factorial(n-1) if n > 1 else 1,def factorial(n): return n * factorial(n-1) if n < 1 else 1,def factorial(n): return n * factorial(n-1) if n < 1 else 1,1,operation
+def factorial(n): return n * factorial(n-1) if n > 1 else 1,def factorial(n): return n * factorial(n-1) if n < 1 else 1,def factorial(n): return n * factorial(n-1) if n < 1 else 1,1,operation
+def is_palindrome(s): return s == s[::-1],def is_palindrome(s): return s != s[::-1],def is_palindrome(s): return s != s[::-1],1,decision
+def is_palindrome(s): return s == s[::-1],def is_palindrome(s): return s != s[::-1],def is_palindrome(s): return s != s[::-1],1,decision
+def is_palindrome(s): return s == s[::-1],def is_palindrome(s): return s != s[::-1],def is_palindrome(s): return s != s[::-1],1,decision
+def fibonacci(n): return 1 if n <= 1 else fibonacci(n-1) + fibonacci(n-2),def fibonacci(n): return 1 if n >= 1 else fibonacci(n-1) + fibonacci(n-2),def fibonacci(n): return 1 if n >= 1 else fibonacci(n-1) + fibonacci(n-2),1,operation
+"def binary_search(arr, target): left, right = 0, len(arr) - 1; while left <= right: mid = (left + right) // 2; if arr[mid] == target: return mid; elif arr[mid] < target: left = mid + 1; else: right = mid - 1; return -1","def binary_search(arr, target): left, right = 0, len(arr) - 1; while left <= right: mid = (left + right) // 2; if arr[mid] != target: return mid; elif arr[mid] < target: left = mid + 1; else: right = mid - 1; return -1","def binary_search(arr, target): left, right = 0, len(arr) - 1; while left <= right: mid = (left + right) // 2; if arr[mid] != target: return mid; elif arr[mid] < target: left = mid + 1; else: right = mid - 1; return -1",1,decision
+def is_even(n): return n % 2 == 0,def is_even(n): return n % 2 != 0,def is_even(n): return n % 2 != 0,1,decision
+"def binary_search(arr, target): left, right = 0, len(arr) - 1; while left <= right: mid = (left + right) // 2; if arr[mid] == target: return mid; elif arr[mid] < target: left = mid + 1; else: right = mid - 1; return -1","def binary_search(arr, target): left, right = 0, len(arr) - 1; while left <= right: mid = (left + right) // 2; if arr[mid] != target: return mid; elif arr[mid] < target: left = mid + 1; else: right = mid - 1; return -1","def binary_search(arr, target): left, right = 0, len(arr) - 1; while left <= right: mid = (left + right) // 2; if arr[mid] != target: return mid; elif arr[mid] < target: left = mid + 1; else: right = mid - 1; return -1",1,decision
+def quick_sort(arr): if len(arr) <= 1: return arr; pivot = arr[len(arr) // 2]; left = [x for x in arr if x < pivot]; middle = [x for x in arr if x == pivot]; right = [x for x in arr if x > pivot]; return quick_sort(left) + middle + quick_sort(right),def quick_sort(arr): if len(arr) <= 1: return arr; pivot = arr[len(arr) // 2]; left = [x for x in arr if x < pivot]; middle = [x for x in arr if x != pivot]; right = [x for x in arr if x > pivot]; return quick_sort(left) + middle + quick_sort(right),def quick_sort(arr): if len(arr) <= 1: return arr; pivot = arr[len(arr) // 2]; left = [x for x in arr if x < pivot]; middle = [x for x in arr if x != pivot]; right = [x for x in arr if x > pivot]; return quick_sort(left) + middle + quick_sort(right),1,decision
+def fibonacci(n): return 1 if n <= 1 else fibonacci(n-1) + fibonacci(n-2),def fibonacci(n): return 1 if n >= 1 else fibonacci(n-1) + fibonacci(n-2),def fibonacci(n): return 1 if n >= 1 else fibonacci(n-1) + fibonacci(n-2),1,operation
+def fibonacci(n): return 1 if n <= 1 else fibonacci(n-1) + fibonacci(n-2),def fibonacci(n): return 1 if n >= 1 else fibonacci(n-1) + fibonacci(n-2),def fibonacci(n): return 1 if n >= 1 else fibonacci(n-1) + fibonacci(n-2),1,operation
+def factorial(n): return n * factorial(n-1) if n > 1 else 1,def factorial(n): return n * factorial(n-1) if n < 1 else 1,def factorial(n): return n * factorial(n-1) if n < 1 else 1,1,operation
+"def gcd(a, b): return a if b == 0 else gcd(b, a % b)","def gcd(a, b): return a if b != 0 else gcd(b, a % b)","def gcd(a, b): return a if b != 0 else gcd(b, a % b)",1,decision
+"def power(x, n): return x * power(x, n-1) if n > 0 else 1","def power(x, n): return x * power(x, n-1) if n < 0 else 1","def power(x, n): return x * power(x, n-1) if n < 0 else 1",1,operation
+def quick_sort(arr): if len(arr) <= 1: return arr; pivot = arr[len(arr) // 2]; left = [x for x in arr if x < pivot]; middle = [x for x in arr if x == pivot]; right = [x for x in arr if x > pivot]; return quick_sort(left) + middle + quick_sort(right),def quick_sort(arr): if len(arr) <= 1: return arr; pivot = arr[len(arr) // 2]; left = [x for x in arr if x < pivot]; middle = [x for x in arr if x != pivot]; right = [x for x in arr if x > pivot]; return quick_sort(left) + middle + quick_sort(right),def quick_sort(arr): if len(arr) <= 1: return arr; pivot = arr[len(arr) // 2]; left = [x for x in arr if x < pivot]; middle = [x for x in arr if x != pivot]; right = [x for x in arr if x > pivot]; return quick_sort(left) + middle + quick_sort(right),1,decision
+"def add(a, b): return a + b","def add(a, b): return a - b","def add(a, b): return a - b",1,operation
+"def power(x, n): return x * power(x, n-1) if n > 0 else 1","def power(x, n): return x * power(x, n-1) if n < 0 else 1","def power(x, n): return x * power(x, n-1) if n < 0 else 1",1,operation
+"def binary_search(arr, target): left, right = 0, len(arr) - 1; while left <= right: mid = (left + right) // 2; if arr[mid] == target: return mid; elif arr[mid] < target: left = mid + 1; else: right = mid - 1; return -1","def binary_search(arr, target): left, right = 0, len(arr) - 1; while left <= right: mid = (left + right) // 2; if arr[mid] != target: return mid; elif arr[mid] < target: left = mid + 1; else: right = mid - 1; return -1","def binary_search(arr, target): left, right = 0, len(arr) - 1; while left <= right: mid = (left + right) // 2; if arr[mid] != target: return mid; elif arr[mid] < target: left = mid + 1; else: right = mid - 1; return -1",1,decision
+def is_even(n): return n % 2 == 0,def is_even(n): return n % 2 != 0,def is_even(n): return n % 2 != 0,1,decision
+"def power(x, n): return x * power(x, n-1) if n > 0 else 1","def power(x, n): return x * power(x, n-1) if n < 0 else 1","def power(x, n): return x * power(x, n-1) if n < 0 else 1",1,operation
+"def gcd(a, b): return a if b == 0 else gcd(b, a % b)","def gcd(a, b): return a if b != 0 else gcd(b, a % b)","def gcd(a, b): return a if b != 0 else gcd(b, a % b)",1,decision
+def quick_sort(arr): if len(arr) <= 1: return arr; pivot = arr[len(arr) // 2]; left = [x for x in arr if x < pivot]; middle = [x for x in arr if x == pivot]; right = [x for x in arr if x > pivot]; return quick_sort(left) + middle + quick_sort(right),def quick_sort(arr): if len(arr) <= 1: return arr; pivot = arr[len(arr) // 2]; left = [x for x in arr if x < pivot]; middle = [x for x in arr if x != pivot]; right = [x for x in arr if x > pivot]; return quick_sort(left) + middle + quick_sort(right),def quick_sort(arr): if len(arr) <= 1: return arr; pivot = arr[len(arr) // 2]; left = [x for x in arr if x < pivot]; middle = [x for x in arr if x != pivot]; right = [x for x in arr if x > pivot]; return quick_sort(left) + middle + quick_sort(right),1,decision
+def quick_sort(arr): if len(arr) <= 1: return arr; pivot = arr[len(arr) // 2]; left = [x for x in arr if x < pivot]; middle = [x for x in arr if x == pivot]; right = [x for x in arr if x > pivot]; return quick_sort(left) + middle + quick_sort(right),def quick_sort(arr): if len(arr) <= 1: return arr; pivot = arr[len(arr) // 2]; left = [x for x in arr if x < pivot]; middle = [x for x in arr if x != pivot]; right = [x for x in arr if x > pivot]; return quick_sort(left) + middle + quick_sort(right),def quick_sort(arr): if len(arr) <= 1: return arr; pivot = arr[len(arr) // 2]; left = [x for x in arr if x < pivot]; middle = [x for x in arr if x != pivot]; right = [x for x in arr if x > pivot]; return quick_sort(left) + middle + quick_sort(right),1,decision
+"def power(x, n): return x * power(x, n-1) if n > 0 else 1","def power(x, n): return x * power(x, n-1) if n < 0 else 1","def power(x, n): return x * power(x, n-1) if n < 0 else 1",1,operation
+def quick_sort(arr): if len(arr) <= 1: return arr; pivot = arr[len(arr) // 2]; left = [x for x in arr if x < pivot]; middle = [x for x in arr if x == pivot]; right = [x for x in arr if x > pivot]; return quick_sort(left) + middle + quick_sort(right),def quick_sort(arr): if len(arr) <= 1: return arr; pivot = arr[len(arr) // 2]; left = [x for x in arr if x < pivot]; middle = [x for x in arr if x != pivot]; right = [x for x in arr if x > pivot]; return quick_sort(left) + middle + quick_sort(right),def quick_sort(arr): if len(arr) <= 1: return arr; pivot = arr[len(arr) // 2]; left = [x for x in arr if x < pivot]; middle = [x for x in arr if x != pivot]; right = [x for x in arr if x > pivot]; return quick_sort(left) + middle + quick_sort(right),1,decision
+"def binary_search(arr, target): left, right = 0, len(arr) - 1; while left <= right: mid = (left + right) // 2; if arr[mid] == target: return mid; elif arr[mid] < target: left = mid + 1; else: right = mid - 1; return -1","def binary_search(arr, target): left, right = 0, len(arr) - 1; while left <= right: mid = (left + right) // 2; if arr[mid] != target: return mid; elif arr[mid] < target: left = mid + 1; else: right = mid - 1; return -1","def binary_search(arr, target): left, right = 0, len(arr) - 1; while left <= right: mid = (left + right) // 2; if arr[mid] != target: return mid; elif arr[mid] < target: left = mid + 1; else: right = mid - 1; return -1",1,decision
+"def add(a, b): return a + b","def add(a, b): return a - b","def add(a, b): return a - b",1,operation
+def fibonacci(n): return 1 if n <= 1 else fibonacci(n-1) + fibonacci(n-2),def fibonacci(n): return 1 if n >= 1 else fibonacci(n-1) + fibonacci(n-2),def fibonacci(n): return 1 if n >= 1 else fibonacci(n-1) + fibonacci(n-2),1,operation
+def is_even(n): return n % 2 == 0,def is_even(n): return n % 2 != 0,def is_even(n): return n % 2 != 0,1,decision
+def quick_sort(arr): if len(arr) <= 1: return arr; pivot = arr[len(arr) // 2]; left = [x for x in arr if x < pivot]; middle = [x for x in arr if x == pivot]; right = [x for x in arr if x > pivot]; return quick_sort(left) + middle + quick_sort(right),def quick_sort(arr): if len(arr) <= 1: return arr; pivot = arr[len(arr) // 2]; left = [x for x in arr if x < pivot]; middle = [x for x in arr if x != pivot]; right = [x for x in arr if x > pivot]; return quick_sort(left) + middle + quick_sort(right),def quick_sort(arr): if len(arr) <= 1: return arr; pivot = arr[len(arr) // 2]; left = [x for x in arr if x < pivot]; middle = [x for x in arr if x != pivot]; right = [x for x in arr if x > pivot]; return quick_sort(left) + middle + quick_sort(right),1,decision
+"def binary_search(arr, target): left, right = 0, len(arr) - 1; while left <= right: mid = (left + right) // 2; if arr[mid] == target: return mid; elif arr[mid] < target: left = mid + 1; else: right = mid - 1; return -1","def binary_search(arr, target): left, right = 0, len(arr) - 1; while left <= right: mid = (left + right) // 2; if arr[mid] != target: return mid; elif arr[mid] < target: left = mid + 1; else: right = mid - 1; return -1","def binary_search(arr, target): left, right = 0, len(arr) - 1; while left <= right: mid = (left + right) // 2; if arr[mid] != target: return mid; elif arr[mid] < target: left = mid + 1; else: right = mid - 1; return -1",1,decision
+"def binary_search(arr, target): left, right = 0, len(arr) - 1; while left <= right: mid = (left + right) // 2; if arr[mid] == target: return mid; elif arr[mid] < target: left = mid + 1; else: right = mid - 1; return -1","def binary_search(arr, target): left, right = 0, len(arr) - 1; while left <= right: mid = (left + right) // 2; if arr[mid] != target: return mid; elif arr[mid] < target: left = mid + 1; else: right = mid - 1; return -1","def binary_search(arr, target): left, right = 0, len(arr) - 1; while left <= right: mid = (left + right) // 2; if arr[mid] != target: return mid; elif arr[mid] < target: left = mid + 1; else: right = mid - 1; return -1",1,decision
+"def power(x, n): return x * power(x, n-1) if n > 0 else 1","def power(x, n): return x * power(x, n-1) if n < 0 else 1","def power(x, n): return x * power(x, n-1) if n < 0 else 1",1,operation
+def quick_sort(arr): if len(arr) <= 1: return arr; pivot = arr[len(arr) // 2]; left = [x for x in arr if x < pivot]; middle = [x for x in arr if x == pivot]; right = [x for x in arr if x > pivot]; return quick_sort(left) + middle + quick_sort(right),def quick_sort(arr): if len(arr) <= 1: return arr; pivot = arr[len(arr) // 2]; left = [x for x in arr if x < pivot]; middle = [x for x in arr if x != pivot]; right = [x for x in arr if x > pivot]; return quick_sort(left) + middle + quick_sort(right),def quick_sort(arr): if len(arr) <= 1: return arr; pivot = arr[len(arr) // 2]; left = [x for x in arr if x < pivot]; middle = [x for x in arr if x != pivot]; right = [x for x in arr if x > pivot]; return quick_sort(left) + middle + quick_sort(right),1,decision
+def factorial(n): return n * factorial(n-1) if n > 1 else 1,def factorial(n): return n * factorial(n-1) if n < 1 else 1,def factorial(n): return n * factorial(n-1) if n < 1 else 1,1,operation
+def is_palindrome(s): return s == s[::-1],def is_palindrome(s): return s != s[::-1],def is_palindrome(s): return s != s[::-1],1,decision
+"def binary_search(arr, target): left, right = 0, len(arr) - 1; while left <= right: mid = (left + right) // 2; if arr[mid] == target: return mid; elif arr[mid] < target: left = mid + 1; else: right = mid - 1; return -1","def binary_search(arr, target): left, right = 0, len(arr) - 1; while left <= right: mid = (left + right) // 2; if arr[mid] != target: return mid; elif arr[mid] < target: left = mid + 1; else: right = mid - 1; return -1","def binary_search(arr, target): left, right = 0, len(arr) - 1; while left <= right: mid = (left + right) // 2; if arr[mid] != target: return mid; elif arr[mid] < target: left = mid + 1; else: right = mid - 1; return -1",1,decision
+def quick_sort(arr): if len(arr) <= 1: return arr; pivot = arr[len(arr) // 2]; left = [x for x in arr if x < pivot]; middle = [x for x in arr if x == pivot]; right = [x for x in arr if x > pivot]; return quick_sort(left) + middle + quick_sort(right),def quick_sort(arr): if len(arr) <= 1: return arr; pivot = arr[len(arr) // 2]; left = [x for x in arr if x < pivot]; middle = [x for x in arr if x != pivot]; right = [x for x in arr if x > pivot]; return quick_sort(left) + middle + quick_sort(right),def quick_sort(arr): if len(arr) <= 1: return arr; pivot = arr[len(arr) // 2]; left = [x for x in arr if x < pivot]; middle = [x for x in arr if x != pivot]; right = [x for x in arr if x > pivot]; return quick_sort(left) + middle + quick_sort(right),1,decision
+def is_palindrome(s): return s == s[::-1],def is_palindrome(s): return s != s[::-1],def is_palindrome(s): return s != s[::-1],1,decision
+def quick_sort(arr): if len(arr) <= 1: return arr; pivot = arr[len(arr) // 2]; left = [x for x in arr if x < pivot]; middle = [x for x in arr if x == pivot]; right = [x for x in arr if x > pivot]; return quick_sort(left) + middle + quick_sort(right),def quick_sort(arr): if len(arr) <= 1: return arr; pivot = arr[len(arr) // 2]; left = [x for x in arr if x < pivot]; middle = [x for x in arr if x != pivot]; right = [x for x in arr if x > pivot]; return quick_sort(left) + middle + quick_sort(right),def quick_sort(arr): if len(arr) <= 1: return arr; pivot = arr[len(arr) // 2]; left = [x for x in arr if x < pivot]; middle = [x for x in arr if x != pivot]; right = [x for x in arr if x > pivot]; return quick_sort(left) + middle + quick_sort(right),1,decision
+"def add(a, b): return a + b","def add(a, b): return a - b","def add(a, b): return a - b",1,operation
+def quick_sort(arr): if len(arr) <= 1: return arr; pivot = arr[len(arr) // 2]; left = [x for x in arr if x < pivot]; middle = [x for x in arr if x == pivot]; right = [x for x in arr if x > pivot]; return quick_sort(left) + middle + quick_sort(right),def quick_sort(arr): if len(arr) <= 1: return arr; pivot = arr[len(arr) // 2]; left = [x for x in arr if x < pivot]; middle = [x for x in arr if x != pivot]; right = [x for x in arr if x > pivot]; return quick_sort(left) + middle + quick_sort(right),def quick_sort(arr): if len(arr) <= 1: return arr; pivot = arr[len(arr) // 2]; left = [x for x in arr if x < pivot]; middle = [x for x in arr if x != pivot]; right = [x for x in arr if x > pivot]; return quick_sort(left) + middle + quick_sort(right),1,decision
+def is_even(n): return n % 2 == 0,def is_even(n): return n % 2 != 0,def is_even(n): return n % 2 != 0,1,decision
+"def gcd(a, b): return a if b == 0 else gcd(b, a % b)","def gcd(a, b): return a if b != 0 else gcd(b, a % b)","def gcd(a, b): return a if b != 0 else gcd(b, a % b)",1,decision
+def fibonacci(n): return 1 if n <= 1 else fibonacci(n-1) + fibonacci(n-2),def fibonacci(n): return 1 if n >= 1 else fibonacci(n-1) + fibonacci(n-2),def fibonacci(n): return 1 if n >= 1 else fibonacci(n-1) + fibonacci(n-2),1,operation
+"def binary_search(arr, target): left, right = 0, len(arr) - 1; while left <= right: mid = (left + right) // 2; if arr[mid] == target: return mid; elif arr[mid] < target: left = mid + 1; else: right = mid - 1; return -1","def binary_search(arr, target): left, right = 0, len(arr) - 1; while left <= right: mid = (left + right) // 2; if arr[mid] != target: return mid; elif arr[mid] < target: left = mid + 1; else: right = mid - 1; return -1","def binary_search(arr, target): left, right = 0, len(arr) - 1; while left <= right: mid = (left + right) // 2; if arr[mid] != target: return mid; elif arr[mid] < target: left = mid + 1; else: right = mid - 1; return -1",1,decision
+"def gcd(a, b): return a if b == 0 else gcd(b, a % b)","def gcd(a, b): return a if b != 0 else gcd(b, a % b)","def gcd(a, b): return a if b != 0 else gcd(b, a % b)",1,decision
+"def binary_search(arr, target): left, right = 0, len(arr) - 1; while left <= right: mid = (left + right) // 2; if arr[mid] == target: return mid; elif arr[mid] < target: left = mid + 1; else: right = mid - 1; return -1","def binary_search(arr, target): left, right = 0, len(arr) - 1; while left <= right: mid = (left + right) // 2; if arr[mid] != target: return mid; elif arr[mid] < target: left = mid + 1; else: right = mid - 1; return -1","def binary_search(arr, target): left, right = 0, len(arr) - 1; while left <= right: mid = (left + right) // 2; if arr[mid] != target: return mid; elif arr[mid] < target: left = mid + 1; else: right = mid - 1; return -1",1,decision
+"def power(x, n): return x * power(x, n-1) if n > 0 else 1","def power(x, n): return x * power(x, n-1) if n < 0 else 1","def power(x, n): return x * power(x, n-1) if n < 0 else 1",1,operation
+def is_even(n): return n % 2 == 0,def is_even(n): return n % 2 != 0,def is_even(n): return n % 2 != 0,1,decision
+def is_palindrome(s): return s == s[::-1],def is_palindrome(s): return s != s[::-1],def is_palindrome(s): return s != s[::-1],1,decision
+def factorial(n): return n * factorial(n-1) if n > 1 else 1,def factorial(n): return n * factorial(n-1) if n < 1 else 1,def factorial(n): return n * factorial(n-1) if n < 1 else 1,1,operation
+def is_palindrome(s): return s == s[::-1],def is_palindrome(s): return s != s[::-1],def is_palindrome(s): return s != s[::-1],1,decision
+"def binary_search(arr, target): left, right = 0, len(arr) - 1; while left <= right: mid = (left + right) // 2; if arr[mid] == target: return mid; elif arr[mid] < target: left = mid + 1; else: right = mid - 1; return -1","def binary_search(arr, target): left, right = 0, len(arr) - 1; while left <= right: mid = (left + right) // 2; if arr[mid] != target: return mid; elif arr[mid] < target: left = mid + 1; else: right = mid - 1; return -1","def binary_search(arr, target): left, right = 0, len(arr) - 1; while left <= right: mid = (left + right) // 2; if arr[mid] != target: return mid; elif arr[mid] < target: left = mid + 1; else: right = mid - 1; return -1",1,decision
+def quick_sort(arr): if len(arr) <= 1: return arr; pivot = arr[len(arr) // 2]; left = [x for x in arr if x < pivot]; middle = [x for x in arr if x == pivot]; right = [x for x in arr if x > pivot]; return quick_sort(left) + middle + quick_sort(right),def quick_sort(arr): if len(arr) <= 1: return arr; pivot = arr[len(arr) // 2]; left = [x for x in arr if x < pivot]; middle = [x for x in arr if x != pivot]; right = [x for x in arr if x > pivot]; return quick_sort(left) + middle + quick_sort(right),def quick_sort(arr): if len(arr) <= 1: return arr; pivot = arr[len(arr) // 2]; left = [x for x in arr if x < pivot]; middle = [x for x in arr if x != pivot]; right = [x for x in arr if x > pivot]; return quick_sort(left) + middle + quick_sort(right),1,decision
+"def power(x, n): return x * power(x, n-1) if n > 0 else 1","def power(x, n): return x * power(x, n-1) if n < 0 else 1","def power(x, n): return x * power(x, n-1) if n < 0 else 1",1,operation
+def quick_sort(arr): if len(arr) <= 1: return arr; pivot = arr[len(arr) // 2]; left = [x for x in arr if x < pivot]; middle = [x for x in arr if x == pivot]; right = [x for x in arr if x > pivot]; return quick_sort(left) + middle + quick_sort(right),def quick_sort(arr): if len(arr) <= 1: return arr; pivot = arr[len(arr) // 2]; left = [x for x in arr if x < pivot]; middle = [x for x in arr if x != pivot]; right = [x for x in arr if x > pivot]; return quick_sort(left) + middle + quick_sort(right),def quick_sort(arr): if len(arr) <= 1: return arr; pivot = arr[len(arr) // 2]; left = [x for x in arr if x < pivot]; middle = [x for x in arr if x != pivot]; right = [x for x in arr if x > pivot]; return quick_sort(left) + middle + quick_sort(right),1,decision
+def is_palindrome(s): return s == s[::-1],def is_palindrome(s): return s != s[::-1],def is_palindrome(s): return s != s[::-1],1,decision
+def quick_sort(arr): if len(arr) <= 1: return arr; pivot = arr[len(arr) // 2]; left = [x for x in arr if x < pivot]; middle = [x for x in arr if x == pivot]; right = [x for x in arr if x > pivot]; return quick_sort(left) + middle + quick_sort(right),def quick_sort(arr): if len(arr) <= 1: return arr; pivot = arr[len(arr) // 2]; left = [x for x in arr if x < pivot]; middle = [x for x in arr if x != pivot]; right = [x for x in arr if x > pivot]; return quick_sort(left) + middle + quick_sort(right),def quick_sort(arr): if len(arr) <= 1: return arr; pivot = arr[len(arr) // 2]; left = [x for x in arr if x < pivot]; middle = [x for x in arr if x != pivot]; right = [x for x in arr if x > pivot]; return quick_sort(left) + middle + quick_sort(right),1,decision
+"def binary_search(arr, target): left, right = 0, len(arr) - 1; while left <= right: mid = (left + right) // 2; if arr[mid] == target: return mid; elif arr[mid] < target: left = mid + 1; else: right = mid - 1; return -1","def binary_search(arr, target): left, right = 0, len(arr) - 1; while left <= right: mid = (left + right) // 2; if arr[mid] != target: return mid; elif arr[mid] < target: left = mid + 1; else: right = mid - 1; return -1","def binary_search(arr, target): left, right = 0, len(arr) - 1; while left <= right: mid = (left + right) // 2; if arr[mid] != target: return mid; elif arr[mid] < target: left = mid + 1; else: right = mid - 1; return -1",1,decision
+"def power(x, n): return x * power(x, n-1) if n > 0 else 1","def power(x, n): return x * power(x, n-1) if n < 0 else 1","def power(x, n): return x * power(x, n-1) if n < 0 else 1",1,operation
+def factorial(n): return n * factorial(n-1) if n > 1 else 1,def factorial(n): return n * factorial(n-1) if n < 1 else 1,def factorial(n): return n * factorial(n-1) if n < 1 else 1,1,operation
+def factorial(n): return n * factorial(n-1) if n > 1 else 1,def factorial(n): return n * factorial(n-1) if n < 1 else 1,def factorial(n): return n * factorial(n-1) if n < 1 else 1,1,operation
+"def power(x, n): return x * power(x, n-1) if n > 0 else 1","def power(x, n): return x * power(x, n-1) if n < 0 else 1","def power(x, n): return x * power(x, n-1) if n < 0 else 1",1,operation
+"def power(x, n): return x * power(x, n-1) if n > 0 else 1","def power(x, n): return x * power(x, n-1) if n < 0 else 1","def power(x, n): return x * power(x, n-1) if n < 0 else 1",1,operation
+def fibonacci(n): return 1 if n <= 1 else fibonacci(n-1) + fibonacci(n-2),def fibonacci(n): return 1 if n >= 1 else fibonacci(n-1) + fibonacci(n-2),def fibonacci(n): return 1 if n >= 1 else fibonacci(n-1) + fibonacci(n-2),1,operation
+def factorial(n): return n * factorial(n-1) if n > 1 else 1,def factorial(n): return n * factorial(n-1) if n < 1 else 1,def factorial(n): return n * factorial(n-1) if n < 1 else 1,1,operation
+"def add(a, b): return a + b","def add(a, b): return a - b","def add(a, b): return a - b",1,operation
+"def gcd(a, b): return a if b == 0 else gcd(b, a % b)","def gcd(a, b): return a if b != 0 else gcd(b, a % b)","def gcd(a, b): return a if b != 0 else gcd(b, a % b)",1,decision
+def fibonacci(n): return 1 if n <= 1 else fibonacci(n-1) + fibonacci(n-2),def fibonacci(n): return 1 if n >= 1 else fibonacci(n-1) + fibonacci(n-2),def fibonacci(n): return 1 if n >= 1 else fibonacci(n-1) + fibonacci(n-2),1,operation
+"def binary_search(arr, target): left, right = 0, len(arr) - 1; while left <= right: mid = (left + right) // 2; if arr[mid] == target: return mid; elif arr[mid] < target: left = mid + 1; else: right = mid - 1; return -1","def binary_search(arr, target): left, right = 0, len(arr) - 1; while left <= right: mid = (left + right) // 2; if arr[mid] != target: return mid; elif arr[mid] < target: left = mid + 1; else: right = mid - 1; return -1","def binary_search(arr, target): left, right = 0, len(arr) - 1; while left <= right: mid = (left + right) // 2; if arr[mid] != target: return mid; elif arr[mid] < target: left = mid + 1; else: right = mid - 1; return -1",1,decision
+"def binary_search(arr, target): left, right = 0, len(arr) - 1; while left <= right: mid = (left + right) // 2; if arr[mid] == target: return mid; elif arr[mid] < target: left = mid + 1; else: right = mid - 1; return -1","def binary_search(arr, target): left, right = 0, len(arr) - 1; while left <= right: mid = (left + right) // 2; if arr[mid] != target: return mid; elif arr[mid] < target: left = mid + 1; else: right = mid - 1; return -1","def binary_search(arr, target): left, right = 0, len(arr) - 1; while left <= right: mid = (left + right) // 2; if arr[mid] != target: return mid; elif arr[mid] < target: left = mid + 1; else: right = mid - 1; return -1",1,decision
+"def power(x, n): return x * power(x, n-1) if n > 0 else 1","def power(x, n): return x * power(x, n-1) if n < 0 else 1","def power(x, n): return x * power(x, n-1) if n < 0 else 1",1,operation
+"def binary_search(arr, target): left, right = 0, len(arr) - 1; while left <= right: mid = (left + right) // 2; if arr[mid] == target: return mid; elif arr[mid] < target: left = mid + 1; else: right = mid - 1; return -1","def binary_search(arr, target): left, right = 0, len(arr) - 1; while left <= right: mid = (left + right) // 2; if arr[mid] != target: return mid; elif arr[mid] < target: left = mid + 1; else: right = mid - 1; return -1","def binary_search(arr, target): left, right = 0, len(arr) - 1; while left <= right: mid = (left + right) // 2; if arr[mid] != target: return mid; elif arr[mid] < target: left = mid + 1; else: right = mid - 1; return -1",1,decision
+def is_even(n): return n % 2 == 0,def is_even(n): return n % 2 != 0,def is_even(n): return n % 2 != 0,1,decision
+"def add(a, b): return a + b","def add(a, b): return a - b","def add(a, b): return a - b",1,operation
+"def power(x, n): return x * power(x, n-1) if n > 0 else 1","def power(x, n): return x * power(x, n-1) if n < 0 else 1","def power(x, n): return x * power(x, n-1) if n < 0 else 1",1,operation
+def fibonacci(n): return 1 if n <= 1 else fibonacci(n-1) + fibonacci(n-2),def fibonacci(n): return 1 if n >= 1 else fibonacci(n-1) + fibonacci(n-2),def fibonacci(n): return 1 if n >= 1 else fibonacci(n-1) + fibonacci(n-2),1,operation
+def is_palindrome(s): return s == s[::-1],def is_palindrome(s): return s != s[::-1],def is_palindrome(s): return s != s[::-1],1,decision
+"def gcd(a, b): return a if b == 0 else gcd(b, a % b)","def gcd(a, b): return a if b != 0 else gcd(b, a % b)","def gcd(a, b): return a if b != 0 else gcd(b, a % b)",1,decision
+"def binary_search(arr, target): left, right = 0, len(arr) - 1; while left <= right: mid = (left + right) // 2; if arr[mid] == target: return mid; elif arr[mid] < target: left = mid + 1; else: right = mid - 1; return -1","def binary_search(arr, target): left, right = 0, len(arr) - 1; while left <= right: mid = (left + right) // 2; if arr[mid] != target: return mid; elif arr[mid] < target: left = mid + 1; else: right = mid - 1; return -1","def binary_search(arr, target): left, right = 0, len(arr) - 1; while left <= right: mid = (left + right) // 2; if arr[mid] != target: return mid; elif arr[mid] < target: left = mid + 1; else: right = mid - 1; return -1",1,decision
+def fibonacci(n): return 1 if n <= 1 else fibonacci(n-1) + fibonacci(n-2),def fibonacci(n): return 1 if n >= 1 else fibonacci(n-1) + fibonacci(n-2),def fibonacci(n): return 1 if n >= 1 else fibonacci(n-1) + fibonacci(n-2),1,operation
+"def add(a, b): return a + b","def add(a, b): return a - b","def add(a, b): return a - b",1,operation
+def quick_sort(arr): if len(arr) <= 1: return arr; pivot = arr[len(arr) // 2]; left = [x for x in arr if x < pivot]; middle = [x for x in arr if x == pivot]; right = [x for x in arr if x > pivot]; return quick_sort(left) + middle + quick_sort(right),def quick_sort(arr): if len(arr) <= 1: return arr; pivot = arr[len(arr) // 2]; left = [x for x in arr if x < pivot]; middle = [x for x in arr if x != pivot]; right = [x for x in arr if x > pivot]; return quick_sort(left) + middle + quick_sort(right),def quick_sort(arr): if len(arr) <= 1: return arr; pivot = arr[len(arr) // 2]; left = [x for x in arr if x < pivot]; middle = [x for x in arr if x != pivot]; right = [x for x in arr if x > pivot]; return quick_sort(left) + middle + quick_sort(right),1,decision
+"def binary_search(arr, target): left, right = 0, len(arr) - 1; while left <= right: mid = (left + right) // 2; if arr[mid] == target: return mid; elif arr[mid] < target: left = mid + 1; else: right = mid - 1; return -1","def binary_search(arr, target): left, right = 0, len(arr) - 1; while left <= right: mid = (left + right) // 2; if arr[mid] != target: return mid; elif arr[mid] < target: left = mid + 1; else: right = mid - 1; return -1","def binary_search(arr, target): left, right = 0, len(arr) - 1; while left <= right: mid = (left + right) // 2; if arr[mid] != target: return mid; elif arr[mid] < target: left = mid + 1; else: right = mid - 1; return -1",1,decision
+"def binary_search(arr, target): left, right = 0, len(arr) - 1; while left <= right: mid = (left + right) // 2; if arr[mid] == target: return mid; elif arr[mid] < target: left = mid + 1; else: right = mid - 1; return -1","def binary_search(arr, target): left, right = 0, len(arr) - 1; while left <= right: mid = (left + right) // 2; if arr[mid] != target: return mid; elif arr[mid] < target: left = mid + 1; else: right = mid - 1; return -1","def binary_search(arr, target): left, right = 0, len(arr) - 1; while left <= right: mid = (left + right) // 2; if arr[mid] != target: return mid; elif arr[mid] < target: left = mid + 1; else: right = mid - 1; return -1",1,decision
+"def power(x, n): return x * power(x, n-1) if n > 0 else 1","def power(x, n): return x * power(x, n-1) if n < 0 else 1","def power(x, n): return x * power(x, n-1) if n < 0 else 1",1,operation
+"def add(a, b): return a + b","def add(a, b): return a - b","def add(a, b): return a - b",1,operation
+def quick_sort(arr): if len(arr) <= 1: return arr; pivot = arr[len(arr) // 2]; left = [x for x in arr if x < pivot]; middle = [x for x in arr if x == pivot]; right = [x for x in arr if x > pivot]; return quick_sort(left) + middle + quick_sort(right),def quick_sort(arr): if len(arr) <= 1: return arr; pivot = arr[len(arr) // 2]; left = [x for x in arr if x < pivot]; middle = [x for x in arr if x != pivot]; right = [x for x in arr if x > pivot]; return quick_sort(left) + middle + quick_sort(right),def quick_sort(arr): if len(arr) <= 1: return arr; pivot = arr[len(arr) // 2]; left = [x for x in arr if x < pivot]; middle = [x for x in arr if x != pivot]; right = [x for x in arr if x > pivot]; return quick_sort(left) + middle + quick_sort(right),1,decision
+"def gcd(a, b): return a if b == 0 else gcd(b, a % b)","def gcd(a, b): return a if b != 0 else gcd(b, a % b)","def gcd(a, b): return a if b != 0 else gcd(b, a % b)",1,decision
+"def binary_search(arr, target): left, right = 0, len(arr) - 1; while left <= right: mid = (left + right) // 2; if arr[mid] == target: return mid; elif arr[mid] < target: left = mid + 1; else: right = mid - 1; return -1","def binary_search(arr, target): left, right = 0, len(arr) - 1; while left <= right: mid = (left + right) // 2; if arr[mid] != target: return mid; elif arr[mid] < target: left = mid + 1; else: right = mid - 1; return -1","def binary_search(arr, target): left, right = 0, len(arr) - 1; while left <= right: mid = (left + right) // 2; if arr[mid] != target: return mid; elif arr[mid] < target: left = mid + 1; else: right = mid - 1; return -1",1,decision
+def factorial(n): return n * factorial(n-1) if n > 1 else 1,def factorial(n): return n * factorial(n-1) if n < 1 else 1,def factorial(n): return n * factorial(n-1) if n < 1 else 1,1,operation
+"def binary_search(arr, target): left, right = 0, len(arr) - 1; while left <= right: mid = (left + right) // 2; if arr[mid] == target: return mid; elif arr[mid] < target: left = mid + 1; else: right = mid - 1; return -1","def binary_search(arr, target): left, right = 0, len(arr) - 1; while left <= right: mid = (left + right) // 2; if arr[mid] != target: return mid; elif arr[mid] < target: left = mid + 1; else: right = mid - 1; return -1","def binary_search(arr, target): left, right = 0, len(arr) - 1; while left <= right: mid = (left + right) // 2; if arr[mid] != target: return mid; elif arr[mid] < target: left = mid + 1; else: right = mid - 1; return -1",1,decision
+"def power(x, n): return x * power(x, n-1) if n > 0 else 1","def power(x, n): return x * power(x, n-1) if n < 0 else 1","def power(x, n): return x * power(x, n-1) if n < 0 else 1",1,operation
+"def gcd(a, b): return a if b == 0 else gcd(b, a % b)","def gcd(a, b): return a if b != 0 else gcd(b, a % b)","def gcd(a, b): return a if b != 0 else gcd(b, a % b)",1,decision
+"def binary_search(arr, target): left, right = 0, len(arr) - 1; while left <= right: mid = (left + right) // 2; if arr[mid] == target: return mid; elif arr[mid] < target: left = mid + 1; else: right = mid - 1; return -1","def binary_search(arr, target): left, right = 0, len(arr) - 1; while left <= right: mid = (left + right) // 2; if arr[mid] != target: return mid; elif arr[mid] < target: left = mid + 1; else: right = mid - 1; return -1","def binary_search(arr, target): left, right = 0, len(arr) - 1; while left <= right: mid = (left + right) // 2; if arr[mid] != target: return mid; elif arr[mid] < target: left = mid + 1; else: right = mid - 1; return -1",1,decision
+def quick_sort(arr): if len(arr) <= 1: return arr; pivot = arr[len(arr) // 2]; left = [x for x in arr if x < pivot]; middle = [x for x in arr if x == pivot]; right = [x for x in arr if x > pivot]; return quick_sort(left) + middle + quick_sort(right),def quick_sort(arr): if len(arr) <= 1: return arr; pivot = arr[len(arr) // 2]; left = [x for x in arr if x < pivot]; middle = [x for x in arr if x != pivot]; right = [x for x in arr if x > pivot]; return quick_sort(left) + middle + quick_sort(right),def quick_sort(arr): if len(arr) <= 1: return arr; pivot = arr[len(arr) // 2]; left = [x for x in arr if x < pivot]; middle = [x for x in arr if x != pivot]; right = [x for x in arr if x > pivot]; return quick_sort(left) + middle + quick_sort(right),1,decision
+def quick_sort(arr): if len(arr) <= 1: return arr; pivot = arr[len(arr) // 2]; left = [x for x in arr if x < pivot]; middle = [x for x in arr if x == pivot]; right = [x for x in arr if x > pivot]; return quick_sort(left) + middle + quick_sort(right),def quick_sort(arr): if len(arr) <= 1: return arr; pivot = arr[len(arr) // 2]; left = [x for x in arr if x < pivot]; middle = [x for x in arr if x != pivot]; right = [x for x in arr if x > pivot]; return quick_sort(left) + middle + quick_sort(right),def quick_sort(arr): if len(arr) <= 1: return arr; pivot = arr[len(arr) // 2]; left = [x for x in arr if x < pivot]; middle = [x for x in arr if x != pivot]; right = [x for x in arr if x > pivot]; return quick_sort(left) + middle + quick_sort(right),1,decision
+def is_palindrome(s): return s == s[::-1],def is_palindrome(s): return s != s[::-1],def is_palindrome(s): return s != s[::-1],1,decision
+"def gcd(a, b): return a if b == 0 else gcd(b, a % b)","def gcd(a, b): return a if b != 0 else gcd(b, a % b)","def gcd(a, b): return a if b != 0 else gcd(b, a % b)",1,decision
+def quick_sort(arr): if len(arr) <= 1: return arr; pivot = arr[len(arr) // 2]; left = [x for x in arr if x < pivot]; middle = [x for x in arr if x == pivot]; right = [x for x in arr if x > pivot]; return quick_sort(left) + middle + quick_sort(right),def quick_sort(arr): if len(arr) <= 1: return arr; pivot = arr[len(arr) // 2]; left = [x for x in arr if x < pivot]; middle = [x for x in arr if x != pivot]; right = [x for x in arr if x > pivot]; return quick_sort(left) + middle + quick_sort(right),def quick_sort(arr): if len(arr) <= 1: return arr; pivot = arr[len(arr) // 2]; left = [x for x in arr if x < pivot]; middle = [x for x in arr if x != pivot]; right = [x for x in arr if x > pivot]; return quick_sort(left) + middle + quick_sort(right),1,decision
+def is_even(n): return n % 2 == 0,def is_even(n): return n % 2 != 0,def is_even(n): return n % 2 != 0,1,decision
+def is_even(n): return n % 2 == 0,def is_even(n): return n % 2 != 0,def is_even(n): return n % 2 != 0,1,decision
+def is_even(n): return n % 2 == 0,def is_even(n): return n % 2 != 0,def is_even(n): return n % 2 != 0,1,decision
+def factorial(n): return n * factorial(n-1) if n > 1 else 1,def factorial(n): return n * factorial(n-1) if n < 1 else 1,def factorial(n): return n * factorial(n-1) if n < 1 else 1,1,operation
+def quick_sort(arr): if len(arr) <= 1: return arr; pivot = arr[len(arr) // 2]; left = [x for x in arr if x < pivot]; middle = [x for x in arr if x == pivot]; right = [x for x in arr if x > pivot]; return quick_sort(left) + middle + quick_sort(right),def quick_sort(arr): if len(arr) <= 1: return arr; pivot = arr[len(arr) // 2]; left = [x for x in arr if x < pivot]; middle = [x for x in arr if x != pivot]; right = [x for x in arr if x > pivot]; return quick_sort(left) + middle + quick_sort(right),def quick_sort(arr): if len(arr) <= 1: return arr; pivot = arr[len(arr) // 2]; left = [x for x in arr if x < pivot]; middle = [x for x in arr if x != pivot]; right = [x for x in arr if x > pivot]; return quick_sort(left) + middle + quick_sort(right),1,decision
+def is_palindrome(s): return s == s[::-1],def is_palindrome(s): return s != s[::-1],def is_palindrome(s): return s != s[::-1],1,decision
+def is_palindrome(s): return s == s[::-1],def is_palindrome(s): return s != s[::-1],def is_palindrome(s): return s != s[::-1],1,decision
+def is_even(n): return n % 2 == 0,def is_even(n): return n % 2 != 0,def is_even(n): return n % 2 != 0,1,decision
+"def add(a, b): return a + b","def add(a, b): return a - b","def add(a, b): return a - b",1,operation
+def fibonacci(n): return 1 if n <= 1 else fibonacci(n-1) + fibonacci(n-2),def fibonacci(n): return 1 if n >= 1 else fibonacci(n-1) + fibonacci(n-2),def fibonacci(n): return 1 if n >= 1 else fibonacci(n-1) + fibonacci(n-2),1,operation
+def is_palindrome(s): return s == s[::-1],def is_palindrome(s): return s != s[::-1],def is_palindrome(s): return s != s[::-1],1,decision
+"def power(x, n): return x * power(x, n-1) if n > 0 else 1","def power(x, n): return x * power(x, n-1) if n < 0 else 1","def power(x, n): return x * power(x, n-1) if n < 0 else 1",1,operation
+def factorial(n): return n * factorial(n-1) if n > 1 else 1,def factorial(n): return n * factorial(n-1) if n < 1 else 1,def factorial(n): return n * factorial(n-1) if n < 1 else 1,1,operation
+def fibonacci(n): return 1 if n <= 1 else fibonacci(n-1) + fibonacci(n-2),def fibonacci(n): return 1 if n >= 1 else fibonacci(n-1) + fibonacci(n-2),def fibonacci(n): return 1 if n >= 1 else fibonacci(n-1) + fibonacci(n-2),1,operation
+"def gcd(a, b): return a if b == 0 else gcd(b, a % b)","def gcd(a, b): return a if b != 0 else gcd(b, a % b)","def gcd(a, b): return a if b != 0 else gcd(b, a % b)",1,decision
+def factorial(n): return n * factorial(n-1) if n > 1 else 1,def factorial(n): return n * factorial(n-1) if n < 1 else 1,def factorial(n): return n * factorial(n-1) if n < 1 else 1,1,operation
+"def binary_search(arr, target): left, right = 0, len(arr) - 1; while left <= right: mid = (left + right) // 2; if arr[mid] == target: return mid; elif arr[mid] < target: left = mid + 1; else: right = mid - 1; return -1","def binary_search(arr, target): left, right = 0, len(arr) - 1; while left <= right: mid = (left + right) // 2; if arr[mid] != target: return mid; elif arr[mid] < target: left = mid + 1; else: right = mid - 1; return -1","def binary_search(arr, target): left, right = 0, len(arr) - 1; while left <= right: mid = (left + right) // 2; if arr[mid] != target: return mid; elif arr[mid] < target: left = mid + 1; else: right = mid - 1; return -1",1,decision
+"def add(a, b): return a + b","def add(a, b): return a - b","def add(a, b): return a - b",1,operation
+def factorial(n): return n * factorial(n-1) if n > 1 else 1,def factorial(n): return n * factorial(n-1) if n < 1 else 1,def factorial(n): return n * factorial(n-1) if n < 1 else 1,1,operation
+"def power(x, n): return x * power(x, n-1) if n > 0 else 1","def power(x, n): return x * power(x, n-1) if n < 0 else 1","def power(x, n): return x * power(x, n-1) if n < 0 else 1",1,operation
+def fibonacci(n): return 1 if n <= 1 else fibonacci(n-1) + fibonacci(n-2),def fibonacci(n): return 1 if n >= 1 else fibonacci(n-1) + fibonacci(n-2),def fibonacci(n): return 1 if n >= 1 else fibonacci(n-1) + fibonacci(n-2),1,operation
+def factorial(n): return n * factorial(n-1) if n > 1 else 1,def factorial(n): return n * factorial(n-1) if n < 1 else 1,def factorial(n): return n * factorial(n-1) if n < 1 else 1,1,operation
+def is_even(n): return n % 2 == 0,def is_even(n): return n % 2 != 0,def is_even(n): return n % 2 != 0,1,decision
+"def power(x, n): return x * power(x, n-1) if n > 0 else 1","def power(x, n): return x * power(x, n-1) if n < 0 else 1","def power(x, n): return x * power(x, n-1) if n < 0 else 1",1,operation
+"def power(x, n): return x * power(x, n-1) if n > 0 else 1","def power(x, n): return x * power(x, n-1) if n < 0 else 1","def power(x, n): return x * power(x, n-1) if n < 0 else 1",1,operation
+def quick_sort(arr): if len(arr) <= 1: return arr; pivot = arr[len(arr) // 2]; left = [x for x in arr if x < pivot]; middle = [x for x in arr if x == pivot]; right = [x for x in arr if x > pivot]; return quick_sort(left) + middle + quick_sort(right),def quick_sort(arr): if len(arr) <= 1: return arr; pivot = arr[len(arr) // 2]; left = [x for x in arr if x < pivot]; middle = [x for x in arr if x != pivot]; right = [x for x in arr if x > pivot]; return quick_sort(left) + middle + quick_sort(right),def quick_sort(arr): if len(arr) <= 1: return arr; pivot = arr[len(arr) // 2]; left = [x for x in arr if x < pivot]; middle = [x for x in arr if x != pivot]; right = [x for x in arr if x > pivot]; return quick_sort(left) + middle + quick_sort(right),1,decision
+"def power(x, n): return x * power(x, n-1) if n > 0 else 1","def power(x, n): return x * power(x, n-1) if n < 0 else 1","def power(x, n): return x * power(x, n-1) if n < 0 else 1",1,operation
+def is_palindrome(s): return s == s[::-1],def is_palindrome(s): return s != s[::-1],def is_palindrome(s): return s != s[::-1],1,decision
+"def power(x, n): return x * power(x, n-1) if n > 0 else 1","def power(x, n): return x * power(x, n-1) if n < 0 else 1","def power(x, n): return x * power(x, n-1) if n < 0 else 1",1,operation
+"def binary_search(arr, target): left, right = 0, len(arr) - 1; while left <= right: mid = (left + right) // 2; if arr[mid] == target: return mid; elif arr[mid] < target: left = mid + 1; else: right = mid - 1; return -1","def binary_search(arr, target): left, right = 0, len(arr) - 1; while left <= right: mid = (left + right) // 2; if arr[mid] != target: return mid; elif arr[mid] < target: left = mid + 1; else: right = mid - 1; return -1","def binary_search(arr, target): left, right = 0, len(arr) - 1; while left <= right: mid = (left + right) // 2; if arr[mid] != target: return mid; elif arr[mid] < target: left = mid + 1; else: right = mid - 1; return -1",1,decision
+"def gcd(a, b): return a if b == 0 else gcd(b, a % b)","def gcd(a, b): return a if b != 0 else gcd(b, a % b)","def gcd(a, b): return a if b != 0 else gcd(b, a % b)",1,decision
+def is_palindrome(s): return s == s[::-1],def is_palindrome(s): return s != s[::-1],def is_palindrome(s): return s != s[::-1],1,decision
+"def power(x, n): return x * power(x, n-1) if n > 0 else 1","def power(x, n): return x * power(x, n-1) if n < 0 else 1","def power(x, n): return x * power(x, n-1) if n < 0 else 1",1,operation
+"def power(x, n): return x * power(x, n-1) if n > 0 else 1","def power(x, n): return x * power(x, n-1) if n < 0 else 1","def power(x, n): return x * power(x, n-1) if n < 0 else 1",1,operation
+def is_even(n): return n % 2 == 0,def is_even(n): return n % 2 != 0,def is_even(n): return n % 2 != 0,1,decision
+def is_palindrome(s): return s == s[::-1],def is_palindrome(s): return s != s[::-1],def is_palindrome(s): return s != s[::-1],1,decision
+def is_even(n): return n % 2 == 0,def is_even(n): return n % 2 != 0,def is_even(n): return n % 2 != 0,1,decision
+"def binary_search(arr, target): left, right = 0, len(arr) - 1; while left <= right: mid = (left + right) // 2; if arr[mid] == target: return mid; elif arr[mid] < target: left = mid + 1; else: right = mid - 1; return -1","def binary_search(arr, target): left, right = 0, len(arr) - 1; while left <= right: mid = (left + right) // 2; if arr[mid] != target: return mid; elif arr[mid] < target: left = mid + 1; else: right = mid - 1; return -1","def binary_search(arr, target): left, right = 0, len(arr) - 1; while left <= right: mid = (left + right) // 2; if arr[mid] != target: return mid; elif arr[mid] < target: left = mid + 1; else: right = mid - 1; return -1",1,decision
+def factorial(n): return n * factorial(n-1) if n > 1 else 1,def factorial(n): return n * factorial(n-1) if n < 1 else 1,def factorial(n): return n * factorial(n-1) if n < 1 else 1,1,operation
+"def gcd(a, b): return a if b == 0 else gcd(b, a % b)","def gcd(a, b): return a if b != 0 else gcd(b, a % b)","def gcd(a, b): return a if b != 0 else gcd(b, a % b)",1,decision
+"def add(a, b): return a + b","def add(a, b): return a - b","def add(a, b): return a - b",1,operation
+"def power(x, n): return x * power(x, n-1) if n > 0 else 1","def power(x, n): return x * power(x, n-1) if n < 0 else 1","def power(x, n): return x * power(x, n-1) if n < 0 else 1",1,operation
+def is_even(n): return n % 2 == 0,def is_even(n): return n % 2 != 0,def is_even(n): return n % 2 != 0,1,decision
+"def binary_search(arr, target): left, right = 0, len(arr) - 1; while left <= right: mid = (left + right) // 2; if arr[mid] == target: return mid; elif arr[mid] < target: left = mid + 1; else: right = mid - 1; return -1","def binary_search(arr, target): left, right = 0, len(arr) - 1; while left <= right: mid = (left + right) // 2; if arr[mid] != target: return mid; elif arr[mid] < target: left = mid + 1; else: right = mid - 1; return -1","def binary_search(arr, target): left, right = 0, len(arr) - 1; while left <= right: mid = (left + right) // 2; if arr[mid] != target: return mid; elif arr[mid] < target: left = mid + 1; else: right = mid - 1; return -1",1,decision
+def is_even(n): return n % 2 == 0,def is_even(n): return n % 2 != 0,def is_even(n): return n % 2 != 0,1,decision
+def quick_sort(arr): if len(arr) <= 1: return arr; pivot = arr[len(arr) // 2]; left = [x for x in arr if x < pivot]; middle = [x for x in arr if x == pivot]; right = [x for x in arr if x > pivot]; return quick_sort(left) + middle + quick_sort(right),def quick_sort(arr): if len(arr) <= 1: return arr; pivot = arr[len(arr) // 2]; left = [x for x in arr if x < pivot]; middle = [x for x in arr if x != pivot]; right = [x for x in arr if x > pivot]; return quick_sort(left) + middle + quick_sort(right),def quick_sort(arr): if len(arr) <= 1: return arr; pivot = arr[len(arr) // 2]; left = [x for x in arr if x < pivot]; middle = [x for x in arr if x != pivot]; right = [x for x in arr if x > pivot]; return quick_sort(left) + middle + quick_sort(right),1,decision
+def is_even(n): return n % 2 == 0,def is_even(n): return n % 2 != 0,def is_even(n): return n % 2 != 0,1,decision
+"def binary_search(arr, target): left, right = 0, len(arr) - 1; while left <= right: mid = (left + right) // 2; if arr[mid] == target: return mid; elif arr[mid] < target: left = mid + 1; else: right = mid - 1; return -1","def binary_search(arr, target): left, right = 0, len(arr) - 1; while left <= right: mid = (left + right) // 2; if arr[mid] != target: return mid; elif arr[mid] < target: left = mid + 1; else: right = mid - 1; return -1","def binary_search(arr, target): left, right = 0, len(arr) - 1; while left <= right: mid = (left + right) // 2; if arr[mid] != target: return mid; elif arr[mid] < target: left = mid + 1; else: right = mid - 1; return -1",1,decision
+def is_palindrome(s): return s == s[::-1],def is_palindrome(s): return s != s[::-1],def is_palindrome(s): return s != s[::-1],1,decision
+"def binary_search(arr, target): left, right = 0, len(arr) - 1; while left <= right: mid = (left + right) // 2; if arr[mid] == target: return mid; elif arr[mid] < target: left = mid + 1; else: right = mid - 1; return -1","def binary_search(arr, target): left, right = 0, len(arr) - 1; while left <= right: mid = (left + right) // 2; if arr[mid] != target: return mid; elif arr[mid] < target: left = mid + 1; else: right = mid - 1; return -1","def binary_search(arr, target): left, right = 0, len(arr) - 1; while left <= right: mid = (left + right) // 2; if arr[mid] != target: return mid; elif arr[mid] < target: left = mid + 1; else: right = mid - 1; return -1",1,decision
+def is_even(n): return n % 2 == 0,def is_even(n): return n % 2 != 0,def is_even(n): return n % 2 != 0,1,decision
+def fibonacci(n): return 1 if n <= 1 else fibonacci(n-1) + fibonacci(n-2),def fibonacci(n): return 1 if n >= 1 else fibonacci(n-1) + fibonacci(n-2),def fibonacci(n): return 1 if n >= 1 else fibonacci(n-1) + fibonacci(n-2),1,operation
+def is_even(n): return n % 2 == 0,def is_even(n): return n % 2 != 0,def is_even(n): return n % 2 != 0,1,decision
+def is_palindrome(s): return s == s[::-1],def is_palindrome(s): return s != s[::-1],def is_palindrome(s): return s != s[::-1],1,decision
+"def gcd(a, b): return a if b == 0 else gcd(b, a % b)","def gcd(a, b): return a if b != 0 else gcd(b, a % b)","def gcd(a, b): return a if b != 0 else gcd(b, a % b)",1,decision
+"def gcd(a, b): return a if b == 0 else gcd(b, a % b)","def gcd(a, b): return a if b != 0 else gcd(b, a % b)","def gcd(a, b): return a if b != 0 else gcd(b, a % b)",1,decision
+def is_even(n): return n % 2 == 0,def is_even(n): return n % 2 != 0,def is_even(n): return n % 2 != 0,1,decision
+"def gcd(a, b): return a if b == 0 else gcd(b, a % b)","def gcd(a, b): return a if b != 0 else gcd(b, a % b)","def gcd(a, b): return a if b != 0 else gcd(b, a % b)",1,decision
+def is_even(n): return n % 2 == 0,def is_even(n): return n % 2 != 0,def is_even(n): return n % 2 != 0,1,decision
+def is_even(n): return n % 2 == 0,def is_even(n): return n % 2 != 0,def is_even(n): return n % 2 != 0,1,decision
+def is_even(n): return n % 2 == 0,def is_even(n): return n % 2 != 0,def is_even(n): return n % 2 != 0,1,decision
+"def gcd(a, b): return a if b == 0 else gcd(b, a % b)","def gcd(a, b): return a if b != 0 else gcd(b, a % b)","def gcd(a, b): return a if b != 0 else gcd(b, a % b)",1,decision
+def is_even(n): return n % 2 == 0,def is_even(n): return n % 2 != 0,def is_even(n): return n % 2 != 0,1,decision
+def quick_sort(arr): if len(arr) <= 1: return arr; pivot = arr[len(arr) // 2]; left = [x for x in arr if x < pivot]; middle = [x for x in arr if x == pivot]; right = [x for x in arr if x > pivot]; return quick_sort(left) + middle + quick_sort(right),def quick_sort(arr): if len(arr) <= 1: return arr; pivot = arr[len(arr) // 2]; left = [x for x in arr if x < pivot]; middle = [x for x in arr if x != pivot]; right = [x for x in arr if x > pivot]; return quick_sort(left) + middle + quick_sort(right),def quick_sort(arr): if len(arr) <= 1: return arr; pivot = arr[len(arr) // 2]; left = [x for x in arr if x < pivot]; middle = [x for x in arr if x != pivot]; right = [x for x in arr if x > pivot]; return quick_sort(left) + middle + quick_sort(right),1,decision
+def fibonacci(n): return 1 if n <= 1 else fibonacci(n-1) + fibonacci(n-2),def fibonacci(n): return 1 if n >= 1 else fibonacci(n-1) + fibonacci(n-2),def fibonacci(n): return 1 if n >= 1 else fibonacci(n-1) + fibonacci(n-2),1,operation
+def is_even(n): return n % 2 == 0,def is_even(n): return n % 2 != 0,def is_even(n): return n % 2 != 0,1,decision
+def is_even(n): return n % 2 == 0,def is_even(n): return n % 2 != 0,def is_even(n): return n % 2 != 0,1,decision
+"def binary_search(arr, target): left, right = 0, len(arr) - 1; while left <= right: mid = (left + right) // 2; if arr[mid] == target: return mid; elif arr[mid] < target: left = mid + 1; else: right = mid - 1; return -1","def binary_search(arr, target): left, right = 0, len(arr) - 1; while left <= right: mid = (left + right) // 2; if arr[mid] != target: return mid; elif arr[mid] < target: left = mid + 1; else: right = mid - 1; return -1","def binary_search(arr, target): left, right = 0, len(arr) - 1; while left <= right: mid = (left + right) // 2; if arr[mid] != target: return mid; elif arr[mid] < target: left = mid + 1; else: right = mid - 1; return -1",1,decision
+def fibonacci(n): return 1 if n <= 1 else fibonacci(n-1) + fibonacci(n-2),def fibonacci(n): return 1 if n >= 1 else fibonacci(n-1) + fibonacci(n-2),def fibonacci(n): return 1 if n >= 1 else fibonacci(n-1) + fibonacci(n-2),1,operation
+def quick_sort(arr): if len(arr) <= 1: return arr; pivot = arr[len(arr) // 2]; left = [x for x in arr if x < pivot]; middle = [x for x in arr if x == pivot]; right = [x for x in arr if x > pivot]; return quick_sort(left) + middle + quick_sort(right),def quick_sort(arr): if len(arr) <= 1: return arr; pivot = arr[len(arr) // 2]; left = [x for x in arr if x < pivot]; middle = [x for x in arr if x != pivot]; right = [x for x in arr if x > pivot]; return quick_sort(left) + middle + quick_sort(right),def quick_sort(arr): if len(arr) <= 1: return arr; pivot = arr[len(arr) // 2]; left = [x for x in arr if x < pivot]; middle = [x for x in arr if x != pivot]; right = [x for x in arr if x > pivot]; return quick_sort(left) + middle + quick_sort(right),1,decision
+"def add(a, b): return a + b","def add(a, b): return a - b","def add(a, b): return a - b",1,operation
+def is_palindrome(s): return s == s[::-1],def is_palindrome(s): return s != s[::-1],def is_palindrome(s): return s != s[::-1],1,decision
+"def gcd(a, b): return a if b == 0 else gcd(b, a % b)","def gcd(a, b): return a if b != 0 else gcd(b, a % b)","def gcd(a, b): return a if b != 0 else gcd(b, a % b)",1,decision
+"def gcd(a, b): return a if b == 0 else gcd(b, a % b)","def gcd(a, b): return a if b != 0 else gcd(b, a % b)","def gcd(a, b): return a if b != 0 else gcd(b, a % b)",1,decision
+def is_palindrome(s): return s == s[::-1],def is_palindrome(s): return s != s[::-1],def is_palindrome(s): return s != s[::-1],1,decision
+def quick_sort(arr): if len(arr) <= 1: return arr; pivot = arr[len(arr) // 2]; left = [x for x in arr if x < pivot]; middle = [x for x in arr if x == pivot]; right = [x for x in arr if x > pivot]; return quick_sort(left) + middle + quick_sort(right),def quick_sort(arr): if len(arr) <= 1: return arr; pivot = arr[len(arr) // 2]; left = [x for x in arr if x < pivot]; middle = [x for x in arr if x != pivot]; right = [x for x in arr if x > pivot]; return quick_sort(left) + middle + quick_sort(right),def quick_sort(arr): if len(arr) <= 1: return arr; pivot = arr[len(arr) // 2]; left = [x for x in arr if x < pivot]; middle = [x for x in arr if x != pivot]; right = [x for x in arr if x > pivot]; return quick_sort(left) + middle + quick_sort(right),1,decision
+def quick_sort(arr): if len(arr) <= 1: return arr; pivot = arr[len(arr) // 2]; left = [x for x in arr if x < pivot]; middle = [x for x in arr if x == pivot]; right = [x for x in arr if x > pivot]; return quick_sort(left) + middle + quick_sort(right),def quick_sort(arr): if len(arr) <= 1: return arr; pivot = arr[len(arr) // 2]; left = [x for x in arr if x < pivot]; middle = [x for x in arr if x != pivot]; right = [x for x in arr if x > pivot]; return quick_sort(left) + middle + quick_sort(right),def quick_sort(arr): if len(arr) <= 1: return arr; pivot = arr[len(arr) // 2]; left = [x for x in arr if x < pivot]; middle = [x for x in arr if x != pivot]; right = [x for x in arr if x > pivot]; return quick_sort(left) + middle + quick_sort(right),1,decision
+def factorial(n): return n * factorial(n-1) if n > 1 else 1,def factorial(n): return n * factorial(n-1) if n < 1 else 1,def factorial(n): return n * factorial(n-1) if n < 1 else 1,1,operation
+def is_even(n): return n % 2 == 0,def is_even(n): return n % 2 != 0,def is_even(n): return n % 2 != 0,1,decision
+"def power(x, n): return x * power(x, n-1) if n > 0 else 1","def power(x, n): return x * power(x, n-1) if n < 0 else 1","def power(x, n): return x * power(x, n-1) if n < 0 else 1",1,operation
+def factorial(n): return n * factorial(n-1) if n > 1 else 1,def factorial(n): return n * factorial(n-1) if n < 1 else 1,def factorial(n): return n * factorial(n-1) if n < 1 else 1,1,operation
+def fibonacci(n): return 1 if n <= 1 else fibonacci(n-1) + fibonacci(n-2),def fibonacci(n): return 1 if n >= 1 else fibonacci(n-1) + fibonacci(n-2),def fibonacci(n): return 1 if n >= 1 else fibonacci(n-1) + fibonacci(n-2),1,operation
+"def power(x, n): return x * power(x, n-1) if n > 0 else 1","def power(x, n): return x * power(x, n-1) if n < 0 else 1","def power(x, n): return x * power(x, n-1) if n < 0 else 1",1,operation
+def quick_sort(arr): if len(arr) <= 1: return arr; pivot = arr[len(arr) // 2]; left = [x for x in arr if x < pivot]; middle = [x for x in arr if x == pivot]; right = [x for x in arr if x > pivot]; return quick_sort(left) + middle + quick_sort(right),def quick_sort(arr): if len(arr) <= 1: return arr; pivot = arr[len(arr) // 2]; left = [x for x in arr if x < pivot]; middle = [x for x in arr if x != pivot]; right = [x for x in arr if x > pivot]; return quick_sort(left) + middle + quick_sort(right),def quick_sort(arr): if len(arr) <= 1: return arr; pivot = arr[len(arr) // 2]; left = [x for x in arr if x < pivot]; middle = [x for x in arr if x != pivot]; right = [x for x in arr if x > pivot]; return quick_sort(left) + middle + quick_sort(right),1,decision
+def is_palindrome(s): return s == s[::-1],def is_palindrome(s): return s != s[::-1],def is_palindrome(s): return s != s[::-1],1,decision
+"def add(a, b): return a + b","def add(a, b): return a - b","def add(a, b): return a - b",1,operation
+"def binary_search(arr, target): left, right = 0, len(arr) - 1; while left <= right: mid = (left + right) // 2; if arr[mid] == target: return mid; elif arr[mid] < target: left = mid + 1; else: right = mid - 1; return -1","def binary_search(arr, target): left, right = 0, len(arr) - 1; while left <= right: mid = (left + right) // 2; if arr[mid] != target: return mid; elif arr[mid] < target: left = mid + 1; else: right = mid - 1; return -1","def binary_search(arr, target): left, right = 0, len(arr) - 1; while left <= right: mid = (left + right) // 2; if arr[mid] != target: return mid; elif arr[mid] < target: left = mid + 1; else: right = mid - 1; return -1",1,decision
+def is_even(n): return n % 2 == 0,def is_even(n): return n % 2 != 0,def is_even(n): return n % 2 != 0,1,decision
+def is_even(n): return n % 2 == 0,def is_even(n): return n % 2 != 0,def is_even(n): return n % 2 != 0,1,decision
+def factorial(n): return n * factorial(n-1) if n > 1 else 1,def factorial(n): return n * factorial(n-1) if n < 1 else 1,def factorial(n): return n * factorial(n-1) if n < 1 else 1,1,operation
+def factorial(n): return n * factorial(n-1) if n > 1 else 1,def factorial(n): return n * factorial(n-1) if n < 1 else 1,def factorial(n): return n * factorial(n-1) if n < 1 else 1,1,operation
+def is_even(n): return n % 2 == 0,def is_even(n): return n % 2 != 0,def is_even(n): return n % 2 != 0,1,decision
+"def binary_search(arr, target): left, right = 0, len(arr) - 1; while left <= right: mid = (left + right) // 2; if arr[mid] == target: return mid; elif arr[mid] < target: left = mid + 1; else: right = mid - 1; return -1","def binary_search(arr, target): left, right = 0, len(arr) - 1; while left <= right: mid = (left + right) // 2; if arr[mid] != target: return mid; elif arr[mid] < target: left = mid + 1; else: right = mid - 1; return -1","def binary_search(arr, target): left, right = 0, len(arr) - 1; while left <= right: mid = (left + right) // 2; if arr[mid] != target: return mid; elif arr[mid] < target: left = mid + 1; else: right = mid - 1; return -1",1,decision
+def is_even(n): return n % 2 == 0,def is_even(n): return n % 2 != 0,def is_even(n): return n % 2 != 0,1,decision
+def is_even(n): return n % 2 == 0,def is_even(n): return n % 2 != 0,def is_even(n): return n % 2 != 0,1,decision
+"def power(x, n): return x * power(x, n-1) if n > 0 else 1","def power(x, n): return x * power(x, n-1) if n < 0 else 1","def power(x, n): return x * power(x, n-1) if n < 0 else 1",1,operation
+"def power(x, n): return x * power(x, n-1) if n > 0 else 1","def power(x, n): return x * power(x, n-1) if n < 0 else 1","def power(x, n): return x * power(x, n-1) if n < 0 else 1",1,operation
+"def power(x, n): return x * power(x, n-1) if n > 0 else 1","def power(x, n): return x * power(x, n-1) if n < 0 else 1","def power(x, n): return x * power(x, n-1) if n < 0 else 1",1,operation
+def is_palindrome(s): return s == s[::-1],def is_palindrome(s): return s != s[::-1],def is_palindrome(s): return s != s[::-1],1,decision
+def factorial(n): return n * factorial(n-1) if n > 1 else 1,def factorial(n): return n * factorial(n-1) if n < 1 else 1,def factorial(n): return n * factorial(n-1) if n < 1 else 1,1,operation
+"def add(a, b): return a + b","def add(a, b): return a - b","def add(a, b): return a - b",1,operation
+def fibonacci(n): return 1 if n <= 1 else fibonacci(n-1) + fibonacci(n-2),def fibonacci(n): return 1 if n >= 1 else fibonacci(n-1) + fibonacci(n-2),def fibonacci(n): return 1 if n >= 1 else fibonacci(n-1) + fibonacci(n-2),1,operation
+"def gcd(a, b): return a if b == 0 else gcd(b, a % b)","def gcd(a, b): return a if b != 0 else gcd(b, a % b)","def gcd(a, b): return a if b != 0 else gcd(b, a % b)",1,decision
+def is_palindrome(s): return s == s[::-1],def is_palindrome(s): return s != s[::-1],def is_palindrome(s): return s != s[::-1],1,decision
+def fibonacci(n): return 1 if n <= 1 else fibonacci(n-1) + fibonacci(n-2),def fibonacci(n): return 1 if n >= 1 else fibonacci(n-1) + fibonacci(n-2),def fibonacci(n): return 1 if n >= 1 else fibonacci(n-1) + fibonacci(n-2),1,operation
+def is_palindrome(s): return s == s[::-1],def is_palindrome(s): return s != s[::-1],def is_palindrome(s): return s != s[::-1],1,decision
+"def binary_search(arr, target): left, right = 0, len(arr) - 1; while left <= right: mid = (left + right) // 2; if arr[mid] == target: return mid; elif arr[mid] < target: left = mid + 1; else: right = mid - 1; return -1","def binary_search(arr, target): left, right = 0, len(arr) - 1; while left <= right: mid = (left + right) // 2; if arr[mid] != target: return mid; elif arr[mid] < target: left = mid + 1; else: right = mid - 1; return -1","def binary_search(arr, target): left, right = 0, len(arr) - 1; while left <= right: mid = (left + right) // 2; if arr[mid] != target: return mid; elif arr[mid] < target: left = mid + 1; else: right = mid - 1; return -1",1,decision
+"def power(x, n): return x * power(x, n-1) if n > 0 else 1","def power(x, n): return x * power(x, n-1) if n < 0 else 1","def power(x, n): return x * power(x, n-1) if n < 0 else 1",1,operation
+def is_even(n): return n % 2 == 0,def is_even(n): return n % 2 != 0,def is_even(n): return n % 2 != 0,1,decision
+"def add(a, b): return a + b","def add(a, b): return a - b","def add(a, b): return a - b",1,operation
+"def add(a, b): return a + b","def add(a, b): return a - b","def add(a, b): return a - b",1,operation
+"def power(x, n): return x * power(x, n-1) if n > 0 else 1","def power(x, n): return x * power(x, n-1) if n < 0 else 1","def power(x, n): return x * power(x, n-1) if n < 0 else 1",1,operation
+def quick_sort(arr): if len(arr) <= 1: return arr; pivot = arr[len(arr) // 2]; left = [x for x in arr if x < pivot]; middle = [x for x in arr if x == pivot]; right = [x for x in arr if x > pivot]; return quick_sort(left) + middle + quick_sort(right),def quick_sort(arr): if len(arr) <= 1: return arr; pivot = arr[len(arr) // 2]; left = [x for x in arr if x < pivot]; middle = [x for x in arr if x != pivot]; right = [x for x in arr if x > pivot]; return quick_sort(left) + middle + quick_sort(right),def quick_sort(arr): if len(arr) <= 1: return arr; pivot = arr[len(arr) // 2]; left = [x for x in arr if x < pivot]; middle = [x for x in arr if x != pivot]; right = [x for x in arr if x > pivot]; return quick_sort(left) + middle + quick_sort(right),1,decision
+def is_even(n): return n % 2 == 0,def is_even(n): return n % 2 != 0,def is_even(n): return n % 2 != 0,1,decision
+def is_even(n): return n % 2 == 0,def is_even(n): return n % 2 != 0,def is_even(n): return n % 2 != 0,1,decision
+"def binary_search(arr, target): left, right = 0, len(arr) - 1; while left <= right: mid = (left + right) // 2; if arr[mid] == target: return mid; elif arr[mid] < target: left = mid + 1; else: right = mid - 1; return -1","def binary_search(arr, target): left, right = 0, len(arr) - 1; while left <= right: mid = (left + right) // 2; if arr[mid] != target: return mid; elif arr[mid] < target: left = mid + 1; else: right = mid - 1; return -1","def binary_search(arr, target): left, right = 0, len(arr) - 1; while left <= right: mid = (left + right) // 2; if arr[mid] != target: return mid; elif arr[mid] < target: left = mid + 1; else: right = mid - 1; return -1",1,decision
+def quick_sort(arr): if len(arr) <= 1: return arr; pivot = arr[len(arr) // 2]; left = [x for x in arr if x < pivot]; middle = [x for x in arr if x == pivot]; right = [x for x in arr if x > pivot]; return quick_sort(left) + middle + quick_sort(right),def quick_sort(arr): if len(arr) <= 1: return arr; pivot = arr[len(arr) // 2]; left = [x for x in arr if x < pivot]; middle = [x for x in arr if x != pivot]; right = [x for x in arr if x > pivot]; return quick_sort(left) + middle + quick_sort(right),def quick_sort(arr): if len(arr) <= 1: return arr; pivot = arr[len(arr) // 2]; left = [x for x in arr if x < pivot]; middle = [x for x in arr if x != pivot]; right = [x for x in arr if x > pivot]; return quick_sort(left) + middle + quick_sort(right),1,decision
+def fibonacci(n): return 1 if n <= 1 else fibonacci(n-1) + fibonacci(n-2),def fibonacci(n): return 1 if n >= 1 else fibonacci(n-1) + fibonacci(n-2),def fibonacci(n): return 1 if n >= 1 else fibonacci(n-1) + fibonacci(n-2),1,operation
+def quick_sort(arr): if len(arr) <= 1: return arr; pivot = arr[len(arr) // 2]; left = [x for x in arr if x < pivot]; middle = [x for x in arr if x == pivot]; right = [x for x in arr if x > pivot]; return quick_sort(left) + middle + quick_sort(right),def quick_sort(arr): if len(arr) <= 1: return arr; pivot = arr[len(arr) // 2]; left = [x for x in arr if x < pivot]; middle = [x for x in arr if x != pivot]; right = [x for x in arr if x > pivot]; return quick_sort(left) + middle + quick_sort(right),def quick_sort(arr): if len(arr) <= 1: return arr; pivot = arr[len(arr) // 2]; left = [x for x in arr if x < pivot]; middle = [x for x in arr if x != pivot]; right = [x for x in arr if x > pivot]; return quick_sort(left) + middle + quick_sort(right),1,decision
+"def gcd(a, b): return a if b == 0 else gcd(b, a % b)","def gcd(a, b): return a if b != 0 else gcd(b, a % b)","def gcd(a, b): return a if b != 0 else gcd(b, a % b)",1,decision
+"def gcd(a, b): return a if b == 0 else gcd(b, a % b)","def gcd(a, b): return a if b != 0 else gcd(b, a % b)","def gcd(a, b): return a if b != 0 else gcd(b, a % b)",1,decision
+"def binary_search(arr, target): left, right = 0, len(arr) - 1; while left <= right: mid = (left + right) // 2; if arr[mid] == target: return mid; elif arr[mid] < target: left = mid + 1; else: right = mid - 1; return -1","def binary_search(arr, target): left, right = 0, len(arr) - 1; while left <= right: mid = (left + right) // 2; if arr[mid] != target: return mid; elif arr[mid] < target: left = mid + 1; else: right = mid - 1; return -1","def binary_search(arr, target): left, right = 0, len(arr) - 1; while left <= right: mid = (left + right) // 2; if arr[mid] != target: return mid; elif arr[mid] < target: left = mid + 1; else: right = mid - 1; return -1",1,decision
+def quick_sort(arr): if len(arr) <= 1: return arr; pivot = arr[len(arr) // 2]; left = [x for x in arr if x < pivot]; middle = [x for x in arr if x == pivot]; right = [x for x in arr if x > pivot]; return quick_sort(left) + middle + quick_sort(right),def quick_sort(arr): if len(arr) <= 1: return arr; pivot = arr[len(arr) // 2]; left = [x for x in arr if x < pivot]; middle = [x for x in arr if x != pivot]; right = [x for x in arr if x > pivot]; return quick_sort(left) + middle + quick_sort(right),def quick_sort(arr): if len(arr) <= 1: return arr; pivot = arr[len(arr) // 2]; left = [x for x in arr if x < pivot]; middle = [x for x in arr if x != pivot]; right = [x for x in arr if x > pivot]; return quick_sort(left) + middle + quick_sort(right),1,decision
+"def binary_search(arr, target): left, right = 0, len(arr) - 1; while left <= right: mid = (left + right) // 2; if arr[mid] == target: return mid; elif arr[mid] < target: left = mid + 1; else: right = mid - 1; return -1","def binary_search(arr, target): left, right = 0, len(arr) - 1; while left <= right: mid = (left + right) // 2; if arr[mid] != target: return mid; elif arr[mid] < target: left = mid + 1; else: right = mid - 1; return -1","def binary_search(arr, target): left, right = 0, len(arr) - 1; while left <= right: mid = (left + right) // 2; if arr[mid] != target: return mid; elif arr[mid] < target: left = mid + 1; else: right = mid - 1; return -1",1,decision
+def quick_sort(arr): if len(arr) <= 1: return arr; pivot = arr[len(arr) // 2]; left = [x for x in arr if x < pivot]; middle = [x for x in arr if x == pivot]; right = [x for x in arr if x > pivot]; return quick_sort(left) + middle + quick_sort(right),def quick_sort(arr): if len(arr) <= 1: return arr; pivot = arr[len(arr) // 2]; left = [x for x in arr if x < pivot]; middle = [x for x in arr if x != pivot]; right = [x for x in arr if x > pivot]; return quick_sort(left) + middle + quick_sort(right),def quick_sort(arr): if len(arr) <= 1: return arr; pivot = arr[len(arr) // 2]; left = [x for x in arr if x < pivot]; middle = [x for x in arr if x != pivot]; right = [x for x in arr if x > pivot]; return quick_sort(left) + middle + quick_sort(right),1,decision
+"def add(a, b): return a + b","def add(a, b): return a - b","def add(a, b): return a - b",1,operation
+def factorial(n): return n * factorial(n-1) if n > 1 else 1,def factorial(n): return n * factorial(n-1) if n < 1 else 1,def factorial(n): return n * factorial(n-1) if n < 1 else 1,1,operation
+"def add(a, b): return a + b","def add(a, b): return a - b","def add(a, b): return a - b",1,operation
+"def power(x, n): return x * power(x, n-1) if n > 0 else 1","def power(x, n): return x * power(x, n-1) if n < 0 else 1","def power(x, n): return x * power(x, n-1) if n < 0 else 1",1,operation
+def factorial(n): return n * factorial(n-1) if n > 1 else 1,def factorial(n): return n * factorial(n-1) if n < 1 else 1,def factorial(n): return n * factorial(n-1) if n < 1 else 1,1,operation
+def quick_sort(arr): if len(arr) <= 1: return arr; pivot = arr[len(arr) // 2]; left = [x for x in arr if x < pivot]; middle = [x for x in arr if x == pivot]; right = [x for x in arr if x > pivot]; return quick_sort(left) + middle + quick_sort(right),def quick_sort(arr): if len(arr) <= 1: return arr; pivot = arr[len(arr) // 2]; left = [x for x in arr if x < pivot]; middle = [x for x in arr if x != pivot]; right = [x for x in arr if x > pivot]; return quick_sort(left) + middle + quick_sort(right),def quick_sort(arr): if len(arr) <= 1: return arr; pivot = arr[len(arr) // 2]; left = [x for x in arr if x < pivot]; middle = [x for x in arr if x != pivot]; right = [x for x in arr if x > pivot]; return quick_sort(left) + middle + quick_sort(right),1,decision
+def quick_sort(arr): if len(arr) <= 1: return arr; pivot = arr[len(arr) // 2]; left = [x for x in arr if x < pivot]; middle = [x for x in arr if x == pivot]; right = [x for x in arr if x > pivot]; return quick_sort(left) + middle + quick_sort(right),def quick_sort(arr): if len(arr) <= 1: return arr; pivot = arr[len(arr) // 2]; left = [x for x in arr if x < pivot]; middle = [x for x in arr if x != pivot]; right = [x for x in arr if x > pivot]; return quick_sort(left) + middle + quick_sort(right),def quick_sort(arr): if len(arr) <= 1: return arr; pivot = arr[len(arr) // 2]; left = [x for x in arr if x < pivot]; middle = [x for x in arr if x != pivot]; right = [x for x in arr if x > pivot]; return quick_sort(left) + middle + quick_sort(right),1,decision
+"def binary_search(arr, target): left, right = 0, len(arr) - 1; while left <= right: mid = (left + right) // 2; if arr[mid] == target: return mid; elif arr[mid] < target: left = mid + 1; else: right = mid - 1; return -1","def binary_search(arr, target): left, right = 0, len(arr) - 1; while left <= right: mid = (left + right) // 2; if arr[mid] != target: return mid; elif arr[mid] < target: left = mid + 1; else: right = mid - 1; return -1","def binary_search(arr, target): left, right = 0, len(arr) - 1; while left <= right: mid = (left + right) // 2; if arr[mid] != target: return mid; elif arr[mid] < target: left = mid + 1; else: right = mid - 1; return -1",1,decision
+"def power(x, n): return x * power(x, n-1) if n > 0 else 1","def power(x, n): return x * power(x, n-1) if n < 0 else 1","def power(x, n): return x * power(x, n-1) if n < 0 else 1",1,operation
+def factorial(n): return n * factorial(n-1) if n > 1 else 1,def factorial(n): return n * factorial(n-1) if n < 1 else 1,def factorial(n): return n * factorial(n-1) if n < 1 else 1,1,operation
+"def add(a, b): return a + b","def add(a, b): return a - b","def add(a, b): return a - b",1,operation
+"def power(x, n): return x * power(x, n-1) if n > 0 else 1","def power(x, n): return x * power(x, n-1) if n < 0 else 1","def power(x, n): return x * power(x, n-1) if n < 0 else 1",1,operation
+"def gcd(a, b): return a if b == 0 else gcd(b, a % b)","def gcd(a, b): return a if b != 0 else gcd(b, a % b)","def gcd(a, b): return a if b != 0 else gcd(b, a % b)",1,decision
+"def add(a, b): return a + b","def add(a, b): return a - b","def add(a, b): return a - b",1,operation
+def quick_sort(arr): if len(arr) <= 1: return arr; pivot = arr[len(arr) // 2]; left = [x for x in arr if x < pivot]; middle = [x for x in arr if x == pivot]; right = [x for x in arr if x > pivot]; return quick_sort(left) + middle + quick_sort(right),def quick_sort(arr): if len(arr) <= 1: return arr; pivot = arr[len(arr) // 2]; left = [x for x in arr if x < pivot]; middle = [x for x in arr if x != pivot]; right = [x for x in arr if x > pivot]; return quick_sort(left) + middle + quick_sort(right),def quick_sort(arr): if len(arr) <= 1: return arr; pivot = arr[len(arr) // 2]; left = [x for x in arr if x < pivot]; middle = [x for x in arr if x != pivot]; right = [x for x in arr if x > pivot]; return quick_sort(left) + middle + quick_sort(right),1,decision
+def is_even(n): return n % 2 == 0,def is_even(n): return n % 2 != 0,def is_even(n): return n % 2 != 0,1,decision
+def factorial(n): return n * factorial(n-1) if n > 1 else 1,def factorial(n): return n * factorial(n-1) if n < 1 else 1,def factorial(n): return n * factorial(n-1) if n < 1 else 1,1,operation
+"def gcd(a, b): return a if b == 0 else gcd(b, a % b)","def gcd(a, b): return a if b != 0 else gcd(b, a % b)","def gcd(a, b): return a if b != 0 else gcd(b, a % b)",1,decision
+def is_even(n): return n % 2 == 0,def is_even(n): return n % 2 != 0,def is_even(n): return n % 2 != 0,1,decision
+def quick_sort(arr): if len(arr) <= 1: return arr; pivot = arr[len(arr) // 2]; left = [x for x in arr if x < pivot]; middle = [x for x in arr if x == pivot]; right = [x for x in arr if x > pivot]; return quick_sort(left) + middle + quick_sort(right),def quick_sort(arr): if len(arr) <= 1: return arr; pivot = arr[len(arr) // 2]; left = [x for x in arr if x < pivot]; middle = [x for x in arr if x != pivot]; right = [x for x in arr if x > pivot]; return quick_sort(left) + middle + quick_sort(right),def quick_sort(arr): if len(arr) <= 1: return arr; pivot = arr[len(arr) // 2]; left = [x for x in arr if x < pivot]; middle = [x for x in arr if x != pivot]; right = [x for x in arr if x > pivot]; return quick_sort(left) + middle + quick_sort(right),1,decision
+def factorial(n): return n * factorial(n-1) if n > 1 else 1,def factorial(n): return n * factorial(n-1) if n < 1 else 1,def factorial(n): return n * factorial(n-1) if n < 1 else 1,1,operation
+"def power(x, n): return x * power(x, n-1) if n > 0 else 1","def power(x, n): return x * power(x, n-1) if n < 0 else 1","def power(x, n): return x * power(x, n-1) if n < 0 else 1",1,operation
+"def power(x, n): return x * power(x, n-1) if n > 0 else 1","def power(x, n): return x * power(x, n-1) if n < 0 else 1","def power(x, n): return x * power(x, n-1) if n < 0 else 1",1,operation
+def factorial(n): return n * factorial(n-1) if n > 1 else 1,def factorial(n): return n * factorial(n-1) if n < 1 else 1,def factorial(n): return n * factorial(n-1) if n < 1 else 1,1,operation
+"def gcd(a, b): return a if b == 0 else gcd(b, a % b)","def gcd(a, b): return a if b != 0 else gcd(b, a % b)","def gcd(a, b): return a if b != 0 else gcd(b, a % b)",1,decision
+"def add(a, b): return a + b","def add(a, b): return a - b","def add(a, b): return a - b",1,operation
+def fibonacci(n): return 1 if n <= 1 else fibonacci(n-1) + fibonacci(n-2),def fibonacci(n): return 1 if n >= 1 else fibonacci(n-1) + fibonacci(n-2),def fibonacci(n): return 1 if n >= 1 else fibonacci(n-1) + fibonacci(n-2),1,operation
+"def power(x, n): return x * power(x, n-1) if n > 0 else 1","def power(x, n): return x * power(x, n-1) if n < 0 else 1","def power(x, n): return x * power(x, n-1) if n < 0 else 1",1,operation
+def is_palindrome(s): return s == s[::-1],def is_palindrome(s): return s != s[::-1],def is_palindrome(s): return s != s[::-1],1,decision
+"def add(a, b): return a + b","def add(a, b): return a - b","def add(a, b): return a - b",1,operation
+"def power(x, n): return x * power(x, n-1) if n > 0 else 1","def power(x, n): return x * power(x, n-1) if n < 0 else 1","def power(x, n): return x * power(x, n-1) if n < 0 else 1",1,operation
+def is_even(n): return n % 2 == 0,def is_even(n): return n % 2 != 0,def is_even(n): return n % 2 != 0,1,decision
+"def binary_search(arr, target): left, right = 0, len(arr) - 1; while left <= right: mid = (left + right) // 2; if arr[mid] == target: return mid; elif arr[mid] < target: left = mid + 1; else: right = mid - 1; return -1","def binary_search(arr, target): left, right = 0, len(arr) - 1; while left <= right: mid = (left + right) // 2; if arr[mid] != target: return mid; elif arr[mid] < target: left = mid + 1; else: right = mid - 1; return -1","def binary_search(arr, target): left, right = 0, len(arr) - 1; while left <= right: mid = (left + right) // 2; if arr[mid] != target: return mid; elif arr[mid] < target: left = mid + 1; else: right = mid - 1; return -1",1,decision
+"def power(x, n): return x * power(x, n-1) if n > 0 else 1","def power(x, n): return x * power(x, n-1) if n < 0 else 1","def power(x, n): return x * power(x, n-1) if n < 0 else 1",1,operation
+"def gcd(a, b): return a if b == 0 else gcd(b, a % b)","def gcd(a, b): return a if b != 0 else gcd(b, a % b)","def gcd(a, b): return a if b != 0 else gcd(b, a % b)",1,decision
+def factorial(n): return n * factorial(n-1) if n > 1 else 1,def factorial(n): return n * factorial(n-1) if n < 1 else 1,def factorial(n): return n * factorial(n-1) if n < 1 else 1,1,operation
+"def add(a, b): return a + b","def add(a, b): return a - b","def add(a, b): return a - b",1,operation
+"def power(x, n): return x * power(x, n-1) if n > 0 else 1","def power(x, n): return x * power(x, n-1) if n < 0 else 1","def power(x, n): return x * power(x, n-1) if n < 0 else 1",1,operation
+def factorial(n): return n * factorial(n-1) if n > 1 else 1,def factorial(n): return n * factorial(n-1) if n < 1 else 1,def factorial(n): return n * factorial(n-1) if n < 1 else 1,1,operation
+def is_even(n): return n % 2 == 0,def is_even(n): return n % 2 != 0,def is_even(n): return n % 2 != 0,1,decision
+def quick_sort(arr): if len(arr) <= 1: return arr; pivot = arr[len(arr) // 2]; left = [x for x in arr if x < pivot]; middle = [x for x in arr if x == pivot]; right = [x for x in arr if x > pivot]; return quick_sort(left) + middle + quick_sort(right),def quick_sort(arr): if len(arr) <= 1: return arr; pivot = arr[len(arr) // 2]; left = [x for x in arr if x < pivot]; middle = [x for x in arr if x != pivot]; right = [x for x in arr if x > pivot]; return quick_sort(left) + middle + quick_sort(right),def quick_sort(arr): if len(arr) <= 1: return arr; pivot = arr[len(arr) // 2]; left = [x for x in arr if x < pivot]; middle = [x for x in arr if x != pivot]; right = [x for x in arr if x > pivot]; return quick_sort(left) + middle + quick_sort(right),1,decision
+def factorial(n): return n * factorial(n-1) if n > 1 else 1,def factorial(n): return n * factorial(n-1) if n < 1 else 1,def factorial(n): return n * factorial(n-1) if n < 1 else 1,1,operation
+def fibonacci(n): return 1 if n <= 1 else fibonacci(n-1) + fibonacci(n-2),def fibonacci(n): return 1 if n >= 1 else fibonacci(n-1) + fibonacci(n-2),def fibonacci(n): return 1 if n >= 1 else fibonacci(n-1) + fibonacci(n-2),1,operation
+def fibonacci(n): return 1 if n <= 1 else fibonacci(n-1) + fibonacci(n-2),def fibonacci(n): return 1 if n >= 1 else fibonacci(n-1) + fibonacci(n-2),def fibonacci(n): return 1 if n >= 1 else fibonacci(n-1) + fibonacci(n-2),1,operation
+"def add(a, b): return a + b","def add(a, b): return a - b","def add(a, b): return a - b",1,operation
+def is_even(n): return n % 2 == 0,def is_even(n): return n % 2 != 0,def is_even(n): return n % 2 != 0,1,decision
+"def gcd(a, b): return a if b == 0 else gcd(b, a % b)","def gcd(a, b): return a if b != 0 else gcd(b, a % b)","def gcd(a, b): return a if b != 0 else gcd(b, a % b)",1,decision
+"def power(x, n): return x * power(x, n-1) if n > 0 else 1","def power(x, n): return x * power(x, n-1) if n < 0 else 1","def power(x, n): return x * power(x, n-1) if n < 0 else 1",1,operation
+def fibonacci(n): return 1 if n <= 1 else fibonacci(n-1) + fibonacci(n-2),def fibonacci(n): return 1 if n >= 1 else fibonacci(n-1) + fibonacci(n-2),def fibonacci(n): return 1 if n >= 1 else fibonacci(n-1) + fibonacci(n-2),1,operation
+"def gcd(a, b): return a if b == 0 else gcd(b, a % b)","def gcd(a, b): return a if b != 0 else gcd(b, a % b)","def gcd(a, b): return a if b != 0 else gcd(b, a % b)",1,decision
+"def binary_search(arr, target): left, right = 0, len(arr) - 1; while left <= right: mid = (left + right) // 2; if arr[mid] == target: return mid; elif arr[mid] < target: left = mid + 1; else: right = mid - 1; return -1","def binary_search(arr, target): left, right = 0, len(arr) - 1; while left <= right: mid = (left + right) // 2; if arr[mid] != target: return mid; elif arr[mid] < target: left = mid + 1; else: right = mid - 1; return -1","def binary_search(arr, target): left, right = 0, len(arr) - 1; while left <= right: mid = (left + right) // 2; if arr[mid] != target: return mid; elif arr[mid] < target: left = mid + 1; else: right = mid - 1; return -1",1,decision
+"def add(a, b): return a + b","def add(a, b): return a - b","def add(a, b): return a - b",1,operation
+def factorial(n): return n * factorial(n-1) if n > 1 else 1,def factorial(n): return n * factorial(n-1) if n < 1 else 1,def factorial(n): return n * factorial(n-1) if n < 1 else 1,1,operation
+def factorial(n): return n * factorial(n-1) if n > 1 else 1,def factorial(n): return n * factorial(n-1) if n < 1 else 1,def factorial(n): return n * factorial(n-1) if n < 1 else 1,1,operation
+"def add(a, b): return a + b","def add(a, b): return a - b","def add(a, b): return a - b",1,operation
+def quick_sort(arr): if len(arr) <= 1: return arr; pivot = arr[len(arr) // 2]; left = [x for x in arr if x < pivot]; middle = [x for x in arr if x == pivot]; right = [x for x in arr if x > pivot]; return quick_sort(left) + middle + quick_sort(right),def quick_sort(arr): if len(arr) <= 1: return arr; pivot = arr[len(arr) // 2]; left = [x for x in arr if x < pivot]; middle = [x for x in arr if x != pivot]; right = [x for x in arr if x > pivot]; return quick_sort(left) + middle + quick_sort(right),def quick_sort(arr): if len(arr) <= 1: return arr; pivot = arr[len(arr) // 2]; left = [x for x in arr if x < pivot]; middle = [x for x in arr if x != pivot]; right = [x for x in arr if x > pivot]; return quick_sort(left) + middle + quick_sort(right),1,decision
+"def power(x, n): return x * power(x, n-1) if n > 0 else 1","def power(x, n): return x * power(x, n-1) if n < 0 else 1","def power(x, n): return x * power(x, n-1) if n < 0 else 1",1,operation
+"def add(a, b): return a + b","def add(a, b): return a - b","def add(a, b): return a - b",1,operation
+def fibonacci(n): return 1 if n <= 1 else fibonacci(n-1) + fibonacci(n-2),def fibonacci(n): return 1 if n >= 1 else fibonacci(n-1) + fibonacci(n-2),def fibonacci(n): return 1 if n >= 1 else fibonacci(n-1) + fibonacci(n-2),1,operation
+"def binary_search(arr, target): left, right = 0, len(arr) - 1; while left <= right: mid = (left + right) // 2; if arr[mid] == target: return mid; elif arr[mid] < target: left = mid + 1; else: right = mid - 1; return -1","def binary_search(arr, target): left, right = 0, len(arr) - 1; while left <= right: mid = (left + right) // 2; if arr[mid] != target: return mid; elif arr[mid] < target: left = mid + 1; else: right = mid - 1; return -1","def binary_search(arr, target): left, right = 0, len(arr) - 1; while left <= right: mid = (left + right) // 2; if arr[mid] != target: return mid; elif arr[mid] < target: left = mid + 1; else: right = mid - 1; return -1",1,decision
+def fibonacci(n): return 1 if n <= 1 else fibonacci(n-1) + fibonacci(n-2),def fibonacci(n): return 1 if n >= 1 else fibonacci(n-1) + fibonacci(n-2),def fibonacci(n): return 1 if n >= 1 else fibonacci(n-1) + fibonacci(n-2),1,operation
+"def gcd(a, b): return a if b == 0 else gcd(b, a % b)","def gcd(a, b): return a if b != 0 else gcd(b, a % b)","def gcd(a, b): return a if b != 0 else gcd(b, a % b)",1,decision
+def quick_sort(arr): if len(arr) <= 1: return arr; pivot = arr[len(arr) // 2]; left = [x for x in arr if x < pivot]; middle = [x for x in arr if x == pivot]; right = [x for x in arr if x > pivot]; return quick_sort(left) + middle + quick_sort(right),def quick_sort(arr): if len(arr) <= 1: return arr; pivot = arr[len(arr) // 2]; left = [x for x in arr if x < pivot]; middle = [x for x in arr if x != pivot]; right = [x for x in arr if x > pivot]; return quick_sort(left) + middle + quick_sort(right),def quick_sort(arr): if len(arr) <= 1: return arr; pivot = arr[len(arr) // 2]; left = [x for x in arr if x < pivot]; middle = [x for x in arr if x != pivot]; right = [x for x in arr if x > pivot]; return quick_sort(left) + middle + quick_sort(right),1,decision
+def factorial(n): return n * factorial(n-1) if n > 1 else 1,def factorial(n): return n * factorial(n-1) if n < 1 else 1,def factorial(n): return n * factorial(n-1) if n < 1 else 1,1,operation
+def fibonacci(n): return 1 if n <= 1 else fibonacci(n-1) + fibonacci(n-2),def fibonacci(n): return 1 if n >= 1 else fibonacci(n-1) + fibonacci(n-2),def fibonacci(n): return 1 if n >= 1 else fibonacci(n-1) + fibonacci(n-2),1,operation
+def factorial(n): return n * factorial(n-1) if n > 1 else 1,def factorial(n): return n * factorial(n-1) if n < 1 else 1,def factorial(n): return n * factorial(n-1) if n < 1 else 1,1,operation
+def is_even(n): return n % 2 == 0,def is_even(n): return n % 2 != 0,def is_even(n): return n % 2 != 0,1,decision
+"def power(x, n): return x * power(x, n-1) if n > 0 else 1","def power(x, n): return x * power(x, n-1) if n < 0 else 1","def power(x, n): return x * power(x, n-1) if n < 0 else 1",1,operation
+"def power(x, n): return x * power(x, n-1) if n > 0 else 1","def power(x, n): return x * power(x, n-1) if n < 0 else 1","def power(x, n): return x * power(x, n-1) if n < 0 else 1",1,operation
+def fibonacci(n): return 1 if n <= 1 else fibonacci(n-1) + fibonacci(n-2),def fibonacci(n): return 1 if n >= 1 else fibonacci(n-1) + fibonacci(n-2),def fibonacci(n): return 1 if n >= 1 else fibonacci(n-1) + fibonacci(n-2),1,operation
+def factorial(n): return n * factorial(n-1) if n > 1 else 1,def factorial(n): return n * factorial(n-1) if n < 1 else 1,def factorial(n): return n * factorial(n-1) if n < 1 else 1,1,operation
+def quick_sort(arr): if len(arr) <= 1: return arr; pivot = arr[len(arr) // 2]; left = [x for x in arr if x < pivot]; middle = [x for x in arr if x == pivot]; right = [x for x in arr if x > pivot]; return quick_sort(left) + middle + quick_sort(right),def quick_sort(arr): if len(arr) <= 1: return arr; pivot = arr[len(arr) // 2]; left = [x for x in arr if x < pivot]; middle = [x for x in arr if x != pivot]; right = [x for x in arr if x > pivot]; return quick_sort(left) + middle + quick_sort(right),def quick_sort(arr): if len(arr) <= 1: return arr; pivot = arr[len(arr) // 2]; left = [x for x in arr if x < pivot]; middle = [x for x in arr if x != pivot]; right = [x for x in arr if x > pivot]; return quick_sort(left) + middle + quick_sort(right),1,decision
+def fibonacci(n): return 1 if n <= 1 else fibonacci(n-1) + fibonacci(n-2),def fibonacci(n): return 1 if n >= 1 else fibonacci(n-1) + fibonacci(n-2),def fibonacci(n): return 1 if n >= 1 else fibonacci(n-1) + fibonacci(n-2),1,operation
+def factorial(n): return n * factorial(n-1) if n > 1 else 1,def factorial(n): return n * factorial(n-1) if n < 1 else 1,def factorial(n): return n * factorial(n-1) if n < 1 else 1,1,operation
+def is_even(n): return n % 2 == 0,def is_even(n): return n % 2 != 0,def is_even(n): return n % 2 != 0,1,decision
+def fibonacci(n): return 1 if n <= 1 else fibonacci(n-1) + fibonacci(n-2),def fibonacci(n): return 1 if n >= 1 else fibonacci(n-1) + fibonacci(n-2),def fibonacci(n): return 1 if n >= 1 else fibonacci(n-1) + fibonacci(n-2),1,operation
+def factorial(n): return n * factorial(n-1) if n > 1 else 1,def factorial(n): return n * factorial(n-1) if n < 1 else 1,def factorial(n): return n * factorial(n-1) if n < 1 else 1,1,operation
+"def power(x, n): return x * power(x, n-1) if n > 0 else 1","def power(x, n): return x * power(x, n-1) if n < 0 else 1","def power(x, n): return x * power(x, n-1) if n < 0 else 1",1,operation
+"def add(a, b): return a + b","def add(a, b): return a - b","def add(a, b): return a - b",1,operation
+def fibonacci(n): return 1 if n <= 1 else fibonacci(n-1) + fibonacci(n-2),def fibonacci(n): return 1 if n >= 1 else fibonacci(n-1) + fibonacci(n-2),def fibonacci(n): return 1 if n >= 1 else fibonacci(n-1) + fibonacci(n-2),1,operation
+"def add(a, b): return a + b","def add(a, b): return a - b","def add(a, b): return a - b",1,operation
+"def add(a, b): return a + b","def add(a, b): return a - b","def add(a, b): return a - b",1,operation
+def factorial(n): return n * factorial(n-1) if n > 1 else 1,def factorial(n): return n * factorial(n-1) if n < 1 else 1,def factorial(n): return n * factorial(n-1) if n < 1 else 1,1,operation
+def is_palindrome(s): return s == s[::-1],def is_palindrome(s): return s != s[::-1],def is_palindrome(s): return s != s[::-1],1,decision
+def is_even(n): return n % 2 == 0,def is_even(n): return n % 2 != 0,def is_even(n): return n % 2 != 0,1,decision
+"def gcd(a, b): return a if b == 0 else gcd(b, a % b)","def gcd(a, b): return a if b != 0 else gcd(b, a % b)","def gcd(a, b): return a if b != 0 else gcd(b, a % b)",1,decision
+def factorial(n): return n * factorial(n-1) if n > 1 else 1,def factorial(n): return n * factorial(n-1) if n < 1 else 1,def factorial(n): return n * factorial(n-1) if n < 1 else 1,1,operation
+def factorial(n): return n * factorial(n-1) if n > 1 else 1,def factorial(n): return n * factorial(n-1) if n < 1 else 1,def factorial(n): return n * factorial(n-1) if n < 1 else 1,1,operation
+"def power(x, n): return x * power(x, n-1) if n > 0 else 1","def power(x, n): return x * power(x, n-1) if n < 0 else 1","def power(x, n): return x * power(x, n-1) if n < 0 else 1",1,operation
+"def power(x, n): return x * power(x, n-1) if n > 0 else 1","def power(x, n): return x * power(x, n-1) if n < 0 else 1","def power(x, n): return x * power(x, n-1) if n < 0 else 1",1,operation
+"def gcd(a, b): return a if b == 0 else gcd(b, a % b)","def gcd(a, b): return a if b != 0 else gcd(b, a % b)","def gcd(a, b): return a if b != 0 else gcd(b, a % b)",1,decision
+"def power(x, n): return x * power(x, n-1) if n > 0 else 1","def power(x, n): return x * power(x, n-1) if n < 0 else 1","def power(x, n): return x * power(x, n-1) if n < 0 else 1",1,operation
+"def binary_search(arr, target): left, right = 0, len(arr) - 1; while left <= right: mid = (left + right) // 2; if arr[mid] == target: return mid; elif arr[mid] < target: left = mid + 1; else: right = mid - 1; return -1","def binary_search(arr, target): left, right = 0, len(arr) - 1; while left <= right: mid = (left + right) // 2; if arr[mid] != target: return mid; elif arr[mid] < target: left = mid + 1; else: right = mid - 1; return -1","def binary_search(arr, target): left, right = 0, len(arr) - 1; while left <= right: mid = (left + right) // 2; if arr[mid] != target: return mid; elif arr[mid] < target: left = mid + 1; else: right = mid - 1; return -1",1,decision
+def is_palindrome(s): return s == s[::-1],def is_palindrome(s): return s != s[::-1],def is_palindrome(s): return s != s[::-1],1,decision
+"def binary_search(arr, target): left, right = 0, len(arr) - 1; while left <= right: mid = (left + right) // 2; if arr[mid] == target: return mid; elif arr[mid] < target: left = mid + 1; else: right = mid - 1; return -1","def binary_search(arr, target): left, right = 0, len(arr) - 1; while left <= right: mid = (left + right) // 2; if arr[mid] != target: return mid; elif arr[mid] < target: left = mid + 1; else: right = mid - 1; return -1","def binary_search(arr, target): left, right = 0, len(arr) - 1; while left <= right: mid = (left + right) // 2; if arr[mid] != target: return mid; elif arr[mid] < target: left = mid + 1; else: right = mid - 1; return -1",1,decision
+"def binary_search(arr, target): left, right = 0, len(arr) - 1; while left <= right: mid = (left + right) // 2; if arr[mid] == target: return mid; elif arr[mid] < target: left = mid + 1; else: right = mid - 1; return -1","def binary_search(arr, target): left, right = 0, len(arr) - 1; while left <= right: mid = (left + right) // 2; if arr[mid] != target: return mid; elif arr[mid] < target: left = mid + 1; else: right = mid - 1; return -1","def binary_search(arr, target): left, right = 0, len(arr) - 1; while left <= right: mid = (left + right) // 2; if arr[mid] != target: return mid; elif arr[mid] < target: left = mid + 1; else: right = mid - 1; return -1",1,decision
+def factorial(n): return n * factorial(n-1) if n > 1 else 1,def factorial(n): return n * factorial(n-1) if n < 1 else 1,def factorial(n): return n * factorial(n-1) if n < 1 else 1,1,operation
+"def power(x, n): return x * power(x, n-1) if n > 0 else 1","def power(x, n): return x * power(x, n-1) if n < 0 else 1","def power(x, n): return x * power(x, n-1) if n < 0 else 1",1,operation
+def is_palindrome(s): return s == s[::-1],def is_palindrome(s): return s != s[::-1],def is_palindrome(s): return s != s[::-1],1,decision
+def is_palindrome(s): return s == s[::-1],def is_palindrome(s): return s != s[::-1],def is_palindrome(s): return s != s[::-1],1,decision
+"def binary_search(arr, target): left, right = 0, len(arr) - 1; while left <= right: mid = (left + right) // 2; if arr[mid] == target: return mid; elif arr[mid] < target: left = mid + 1; else: right = mid - 1; return -1","def binary_search(arr, target): left, right = 0, len(arr) - 1; while left <= right: mid = (left + right) // 2; if arr[mid] != target: return mid; elif arr[mid] < target: left = mid + 1; else: right = mid - 1; return -1","def binary_search(arr, target): left, right = 0, len(arr) - 1; while left <= right: mid = (left + right) // 2; if arr[mid] != target: return mid; elif arr[mid] < target: left = mid + 1; else: right = mid - 1; return -1",1,decision
+def factorial(n): return n * factorial(n-1) if n > 1 else 1,def factorial(n): return n * factorial(n-1) if n < 1 else 1,def factorial(n): return n * factorial(n-1) if n < 1 else 1,1,operation
+def quick_sort(arr): if len(arr) <= 1: return arr; pivot = arr[len(arr) // 2]; left = [x for x in arr if x < pivot]; middle = [x for x in arr if x == pivot]; right = [x for x in arr if x > pivot]; return quick_sort(left) + middle + quick_sort(right),def quick_sort(arr): if len(arr) <= 1: return arr; pivot = arr[len(arr) // 2]; left = [x for x in arr if x < pivot]; middle = [x for x in arr if x != pivot]; right = [x for x in arr if x > pivot]; return quick_sort(left) + middle + quick_sort(right),def quick_sort(arr): if len(arr) <= 1: return arr; pivot = arr[len(arr) // 2]; left = [x for x in arr if x < pivot]; middle = [x for x in arr if x != pivot]; right = [x for x in arr if x > pivot]; return quick_sort(left) + middle + quick_sort(right),1,decision
+def factorial(n): return n * factorial(n-1) if n > 1 else 1,def factorial(n): return n * factorial(n-1) if n < 1 else 1,def factorial(n): return n * factorial(n-1) if n < 1 else 1,1,operation
+"def binary_search(arr, target): left, right = 0, len(arr) - 1; while left <= right: mid = (left + right) // 2; if arr[mid] == target: return mid; elif arr[mid] < target: left = mid + 1; else: right = mid - 1; return -1","def binary_search(arr, target): left, right = 0, len(arr) - 1; while left <= right: mid = (left + right) // 2; if arr[mid] != target: return mid; elif arr[mid] < target: left = mid + 1; else: right = mid - 1; return -1","def binary_search(arr, target): left, right = 0, len(arr) - 1; while left <= right: mid = (left + right) // 2; if arr[mid] != target: return mid; elif arr[mid] < target: left = mid + 1; else: right = mid - 1; return -1",1,decision
+"def power(x, n): return x * power(x, n-1) if n > 0 else 1","def power(x, n): return x * power(x, n-1) if n < 0 else 1","def power(x, n): return x * power(x, n-1) if n < 0 else 1",1,operation
+"def gcd(a, b): return a if b == 0 else gcd(b, a % b)","def gcd(a, b): return a if b != 0 else gcd(b, a % b)","def gcd(a, b): return a if b != 0 else gcd(b, a % b)",1,decision
+def fibonacci(n): return 1 if n <= 1 else fibonacci(n-1) + fibonacci(n-2),def fibonacci(n): return 1 if n >= 1 else fibonacci(n-1) + fibonacci(n-2),def fibonacci(n): return 1 if n >= 1 else fibonacci(n-1) + fibonacci(n-2),1,operation
+def is_palindrome(s): return s == s[::-1],def is_palindrome(s): return s != s[::-1],def is_palindrome(s): return s != s[::-1],1,decision
+def fibonacci(n): return 1 if n <= 1 else fibonacci(n-1) + fibonacci(n-2),def fibonacci(n): return 1 if n >= 1 else fibonacci(n-1) + fibonacci(n-2),def fibonacci(n): return 1 if n >= 1 else fibonacci(n-1) + fibonacci(n-2),1,operation
+"def binary_search(arr, target): left, right = 0, len(arr) - 1; while left <= right: mid = (left + right) // 2; if arr[mid] == target: return mid; elif arr[mid] < target: left = mid + 1; else: right = mid - 1; return -1","def binary_search(arr, target): left, right = 0, len(arr) - 1; while left <= right: mid = (left + right) // 2; if arr[mid] != target: return mid; elif arr[mid] < target: left = mid + 1; else: right = mid - 1; return -1","def binary_search(arr, target): left, right = 0, len(arr) - 1; while left <= right: mid = (left + right) // 2; if arr[mid] != target: return mid; elif arr[mid] < target: left = mid + 1; else: right = mid - 1; return -1",1,decision
+def factorial(n): return n * factorial(n-1) if n > 1 else 1,def factorial(n): return n * factorial(n-1) if n < 1 else 1,def factorial(n): return n * factorial(n-1) if n < 1 else 1,1,operation
+"def gcd(a, b): return a if b == 0 else gcd(b, a % b)","def gcd(a, b): return a if b != 0 else gcd(b, a % b)","def gcd(a, b): return a if b != 0 else gcd(b, a % b)",1,decision
+def is_even(n): return n % 2 == 0,def is_even(n): return n % 2 != 0,def is_even(n): return n % 2 != 0,1,decision
+def fibonacci(n): return 1 if n <= 1 else fibonacci(n-1) + fibonacci(n-2),def fibonacci(n): return 1 if n >= 1 else fibonacci(n-1) + fibonacci(n-2),def fibonacci(n): return 1 if n >= 1 else fibonacci(n-1) + fibonacci(n-2),1,operation
+"def binary_search(arr, target): left, right = 0, len(arr) - 1; while left <= right: mid = (left + right) // 2; if arr[mid] == target: return mid; elif arr[mid] < target: left = mid + 1; else: right = mid - 1; return -1","def binary_search(arr, target): left, right = 0, len(arr) - 1; while left <= right: mid = (left + right) // 2; if arr[mid] != target: return mid; elif arr[mid] < target: left = mid + 1; else: right = mid - 1; return -1","def binary_search(arr, target): left, right = 0, len(arr) - 1; while left <= right: mid = (left + right) // 2; if arr[mid] != target: return mid; elif arr[mid] < target: left = mid + 1; else: right = mid - 1; return -1",1,decision
+def fibonacci(n): return 1 if n <= 1 else fibonacci(n-1) + fibonacci(n-2),def fibonacci(n): return 1 if n >= 1 else fibonacci(n-1) + fibonacci(n-2),def fibonacci(n): return 1 if n >= 1 else fibonacci(n-1) + fibonacci(n-2),1,operation
+def factorial(n): return n * factorial(n-1) if n > 1 else 1,def factorial(n): return n * factorial(n-1) if n < 1 else 1,def factorial(n): return n * factorial(n-1) if n < 1 else 1,1,operation
+def is_even(n): return n % 2 == 0,def is_even(n): return n % 2 != 0,def is_even(n): return n % 2 != 0,1,decision
+"def gcd(a, b): return a if b == 0 else gcd(b, a % b)","def gcd(a, b): return a if b != 0 else gcd(b, a % b)","def gcd(a, b): return a if b != 0 else gcd(b, a % b)",1,decision
+"def gcd(a, b): return a if b == 0 else gcd(b, a % b)","def gcd(a, b): return a if b != 0 else gcd(b, a % b)","def gcd(a, b): return a if b != 0 else gcd(b, a % b)",1,decision
+"def add(a, b): return a + b","def add(a, b): return a - b","def add(a, b): return a - b",1,operation
+def fibonacci(n): return 1 if n <= 1 else fibonacci(n-1) + fibonacci(n-2),def fibonacci(n): return 1 if n >= 1 else fibonacci(n-1) + fibonacci(n-2),def fibonacci(n): return 1 if n >= 1 else fibonacci(n-1) + fibonacci(n-2),1,operation
+"def gcd(a, b): return a if b == 0 else gcd(b, a % b)","def gcd(a, b): return a if b != 0 else gcd(b, a % b)","def gcd(a, b): return a if b != 0 else gcd(b, a % b)",1,decision
+"def gcd(a, b): return a if b == 0 else gcd(b, a % b)","def gcd(a, b): return a if b != 0 else gcd(b, a % b)","def gcd(a, b): return a if b != 0 else gcd(b, a % b)",1,decision
+def fibonacci(n): return 1 if n <= 1 else fibonacci(n-1) + fibonacci(n-2),def fibonacci(n): return 1 if n >= 1 else fibonacci(n-1) + fibonacci(n-2),def fibonacci(n): return 1 if n >= 1 else fibonacci(n-1) + fibonacci(n-2),1,operation
+def quick_sort(arr): if len(arr) <= 1: return arr; pivot = arr[len(arr) // 2]; left = [x for x in arr if x < pivot]; middle = [x for x in arr if x == pivot]; right = [x for x in arr if x > pivot]; return quick_sort(left) + middle + quick_sort(right),def quick_sort(arr): if len(arr) <= 1: return arr; pivot = arr[len(arr) // 2]; left = [x for x in arr if x < pivot]; middle = [x for x in arr if x != pivot]; right = [x for x in arr if x > pivot]; return quick_sort(left) + middle + quick_sort(right),def quick_sort(arr): if len(arr) <= 1: return arr; pivot = arr[len(arr) // 2]; left = [x for x in arr if x < pivot]; middle = [x for x in arr if x != pivot]; right = [x for x in arr if x > pivot]; return quick_sort(left) + middle + quick_sort(right),1,decision
+def factorial(n): return n * factorial(n-1) if n > 1 else 1,def factorial(n): return n * factorial(n-1) if n < 1 else 1,def factorial(n): return n * factorial(n-1) if n < 1 else 1,1,operation
+def quick_sort(arr): if len(arr) <= 1: return arr; pivot = arr[len(arr) // 2]; left = [x for x in arr if x < pivot]; middle = [x for x in arr if x == pivot]; right = [x for x in arr if x > pivot]; return quick_sort(left) + middle + quick_sort(right),def quick_sort(arr): if len(arr) <= 1: return arr; pivot = arr[len(arr) // 2]; left = [x for x in arr if x < pivot]; middle = [x for x in arr if x != pivot]; right = [x for x in arr if x > pivot]; return quick_sort(left) + middle + quick_sort(right),def quick_sort(arr): if len(arr) <= 1: return arr; pivot = arr[len(arr) // 2]; left = [x for x in arr if x < pivot]; middle = [x for x in arr if x != pivot]; right = [x for x in arr if x > pivot]; return quick_sort(left) + middle + quick_sort(right),1,decision
+def quick_sort(arr): if len(arr) <= 1: return arr; pivot = arr[len(arr) // 2]; left = [x for x in arr if x < pivot]; middle = [x for x in arr if x == pivot]; right = [x for x in arr if x > pivot]; return quick_sort(left) + middle + quick_sort(right),def quick_sort(arr): if len(arr) <= 1: return arr; pivot = arr[len(arr) // 2]; left = [x for x in arr if x < pivot]; middle = [x for x in arr if x != pivot]; right = [x for x in arr if x > pivot]; return quick_sort(left) + middle + quick_sort(right),def quick_sort(arr): if len(arr) <= 1: return arr; pivot = arr[len(arr) // 2]; left = [x for x in arr if x < pivot]; middle = [x for x in arr if x != pivot]; right = [x for x in arr if x > pivot]; return quick_sort(left) + middle + quick_sort(right),1,decision
+def is_palindrome(s): return s == s[::-1],def is_palindrome(s): return s != s[::-1],def is_palindrome(s): return s != s[::-1],1,decision
+def is_even(n): return n % 2 == 0,def is_even(n): return n % 2 != 0,def is_even(n): return n % 2 != 0,1,decision
+def fibonacci(n): return 1 if n <= 1 else fibonacci(n-1) + fibonacci(n-2),def fibonacci(n): return 1 if n >= 1 else fibonacci(n-1) + fibonacci(n-2),def fibonacci(n): return 1 if n >= 1 else fibonacci(n-1) + fibonacci(n-2),1,operation
+def is_even(n): return n % 2 == 0,def is_even(n): return n % 2 != 0,def is_even(n): return n % 2 != 0,1,decision
+def factorial(n): return n * factorial(n-1) if n > 1 else 1,def factorial(n): return n * factorial(n-1) if n < 1 else 1,def factorial(n): return n * factorial(n-1) if n < 1 else 1,1,operation
+def is_palindrome(s): return s == s[::-1],def is_palindrome(s): return s != s[::-1],def is_palindrome(s): return s != s[::-1],1,decision
+def factorial(n): return n * factorial(n-1) if n > 1 else 1,def factorial(n): return n * factorial(n-1) if n < 1 else 1,def factorial(n): return n * factorial(n-1) if n < 1 else 1,1,operation
+"def power(x, n): return x * power(x, n-1) if n > 0 else 1","def power(x, n): return x * power(x, n-1) if n < 0 else 1","def power(x, n): return x * power(x, n-1) if n < 0 else 1",1,operation
+def is_even(n): return n % 2 == 0,def is_even(n): return n % 2 != 0,def is_even(n): return n % 2 != 0,1,decision
+"def gcd(a, b): return a if b == 0 else gcd(b, a % b)","def gcd(a, b): return a if b != 0 else gcd(b, a % b)","def gcd(a, b): return a if b != 0 else gcd(b, a % b)",1,decision
+def factorial(n): return n * factorial(n-1) if n > 1 else 1,def factorial(n): return n * factorial(n-1) if n < 1 else 1,def factorial(n): return n * factorial(n-1) if n < 1 else 1,1,operation
+"def gcd(a, b): return a if b == 0 else gcd(b, a % b)","def gcd(a, b): return a if b != 0 else gcd(b, a % b)","def gcd(a, b): return a if b != 0 else gcd(b, a % b)",1,decision
+"def gcd(a, b): return a if b == 0 else gcd(b, a % b)","def gcd(a, b): return a if b != 0 else gcd(b, a % b)","def gcd(a, b): return a if b != 0 else gcd(b, a % b)",1,decision
+"def power(x, n): return x * power(x, n-1) if n > 0 else 1","def power(x, n): return x * power(x, n-1) if n < 0 else 1","def power(x, n): return x * power(x, n-1) if n < 0 else 1",1,operation
+"def power(x, n): return x * power(x, n-1) if n > 0 else 1","def power(x, n): return x * power(x, n-1) if n < 0 else 1","def power(x, n): return x * power(x, n-1) if n < 0 else 1",1,operation
+def is_even(n): return n % 2 == 0,def is_even(n): return n % 2 != 0,def is_even(n): return n % 2 != 0,1,decision
+"def binary_search(arr, target): left, right = 0, len(arr) - 1; while left <= right: mid = (left + right) // 2; if arr[mid] == target: return mid; elif arr[mid] < target: left = mid + 1; else: right = mid - 1; return -1","def binary_search(arr, target): left, right = 0, len(arr) - 1; while left <= right: mid = (left + right) // 2; if arr[mid] != target: return mid; elif arr[mid] < target: left = mid + 1; else: right = mid - 1; return -1","def binary_search(arr, target): left, right = 0, len(arr) - 1; while left <= right: mid = (left + right) // 2; if arr[mid] != target: return mid; elif arr[mid] < target: left = mid + 1; else: right = mid - 1; return -1",1,decision
+"def power(x, n): return x * power(x, n-1) if n > 0 else 1","def power(x, n): return x * power(x, n-1) if n < 0 else 1","def power(x, n): return x * power(x, n-1) if n < 0 else 1",1,operation
+"def add(a, b): return a + b","def add(a, b): return a - b","def add(a, b): return a - b",1,operation
+def is_even(n): return n % 2 == 0,def is_even(n): return n % 2 != 0,def is_even(n): return n % 2 != 0,1,decision
+def factorial(n): return n * factorial(n-1) if n > 1 else 1,def factorial(n): return n * factorial(n-1) if n < 1 else 1,def factorial(n): return n * factorial(n-1) if n < 1 else 1,1,operation
+def quick_sort(arr): if len(arr) <= 1: return arr; pivot = arr[len(arr) // 2]; left = [x for x in arr if x < pivot]; middle = [x for x in arr if x == pivot]; right = [x for x in arr if x > pivot]; return quick_sort(left) + middle + quick_sort(right),def quick_sort(arr): if len(arr) <= 1: return arr; pivot = arr[len(arr) // 2]; left = [x for x in arr if x < pivot]; middle = [x for x in arr if x != pivot]; right = [x for x in arr if x > pivot]; return quick_sort(left) + middle + quick_sort(right),def quick_sort(arr): if len(arr) <= 1: return arr; pivot = arr[len(arr) // 2]; left = [x for x in arr if x < pivot]; middle = [x for x in arr if x != pivot]; right = [x for x in arr if x > pivot]; return quick_sort(left) + middle + quick_sort(right),1,decision
+def is_even(n): return n % 2 == 0,def is_even(n): return n % 2 != 0,def is_even(n): return n % 2 != 0,1,decision
+"def power(x, n): return x * power(x, n-1) if n > 0 else 1","def power(x, n): return x * power(x, n-1) if n < 0 else 1","def power(x, n): return x * power(x, n-1) if n < 0 else 1",1,operation
+def is_palindrome(s): return s == s[::-1],def is_palindrome(s): return s != s[::-1],def is_palindrome(s): return s != s[::-1],1,decision
+"def binary_search(arr, target): left, right = 0, len(arr) - 1; while left <= right: mid = (left + right) // 2; if arr[mid] == target: return mid; elif arr[mid] < target: left = mid + 1; else: right = mid - 1; return -1","def binary_search(arr, target): left, right = 0, len(arr) - 1; while left <= right: mid = (left + right) // 2; if arr[mid] != target: return mid; elif arr[mid] < target: left = mid + 1; else: right = mid - 1; return -1","def binary_search(arr, target): left, right = 0, len(arr) - 1; while left <= right: mid = (left + right) // 2; if arr[mid] != target: return mid; elif arr[mid] < target: left = mid + 1; else: right = mid - 1; return -1",1,decision
+def factorial(n): return n * factorial(n-1) if n > 1 else 1,def factorial(n): return n * factorial(n-1) if n < 1 else 1,def factorial(n): return n * factorial(n-1) if n < 1 else 1,1,operation
+"def binary_search(arr, target): left, right = 0, len(arr) - 1; while left <= right: mid = (left + right) // 2; if arr[mid] == target: return mid; elif arr[mid] < target: left = mid + 1; else: right = mid - 1; return -1","def binary_search(arr, target): left, right = 0, len(arr) - 1; while left <= right: mid = (left + right) // 2; if arr[mid] != target: return mid; elif arr[mid] < target: left = mid + 1; else: right = mid - 1; return -1","def binary_search(arr, target): left, right = 0, len(arr) - 1; while left <= right: mid = (left + right) // 2; if arr[mid] != target: return mid; elif arr[mid] < target: left = mid + 1; else: right = mid - 1; return -1",1,decision
+"def add(a, b): return a + b","def add(a, b): return a - b","def add(a, b): return a - b",1,operation
+"def add(a, b): return a + b","def add(a, b): return a - b","def add(a, b): return a - b",1,operation
+def factorial(n): return n * factorial(n-1) if n > 1 else 1,def factorial(n): return n * factorial(n-1) if n < 1 else 1,def factorial(n): return n * factorial(n-1) if n < 1 else 1,1,operation
+def factorial(n): return n * factorial(n-1) if n > 1 else 1,def factorial(n): return n * factorial(n-1) if n < 1 else 1,def factorial(n): return n * factorial(n-1) if n < 1 else 1,1,operation
+def factorial(n): return n * factorial(n-1) if n > 1 else 1,def factorial(n): return n * factorial(n-1) if n < 1 else 1,def factorial(n): return n * factorial(n-1) if n < 1 else 1,1,operation
+def fibonacci(n): return 1 if n <= 1 else fibonacci(n-1) + fibonacci(n-2),def fibonacci(n): return 1 if n >= 1 else fibonacci(n-1) + fibonacci(n-2),def fibonacci(n): return 1 if n >= 1 else fibonacci(n-1) + fibonacci(n-2),1,operation
+def factorial(n): return n * factorial(n-1) if n > 1 else 1,def factorial(n): return n * factorial(n-1) if n < 1 else 1,def factorial(n): return n * factorial(n-1) if n < 1 else 1,1,operation
+"def add(a, b): return a + b","def add(a, b): return a - b","def add(a, b): return a - b",1,operation
+"def binary_search(arr, target): left, right = 0, len(arr) - 1; while left <= right: mid = (left + right) // 2; if arr[mid] == target: return mid; elif arr[mid] < target: left = mid + 1; else: right = mid - 1; return -1","def binary_search(arr, target): left, right = 0, len(arr) - 1; while left <= right: mid = (left + right) // 2; if arr[mid] != target: return mid; elif arr[mid] < target: left = mid + 1; else: right = mid - 1; return -1","def binary_search(arr, target): left, right = 0, len(arr) - 1; while left <= right: mid = (left + right) // 2; if arr[mid] != target: return mid; elif arr[mid] < target: left = mid + 1; else: right = mid - 1; return -1",1,decision
+"def gcd(a, b): return a if b == 0 else gcd(b, a % b)","def gcd(a, b): return a if b != 0 else gcd(b, a % b)","def gcd(a, b): return a if b != 0 else gcd(b, a % b)",1,decision
+"def binary_search(arr, target): left, right = 0, len(arr) - 1; while left <= right: mid = (left + right) // 2; if arr[mid] == target: return mid; elif arr[mid] < target: left = mid + 1; else: right = mid - 1; return -1","def binary_search(arr, target): left, right = 0, len(arr) - 1; while left <= right: mid = (left + right) // 2; if arr[mid] != target: return mid; elif arr[mid] < target: left = mid + 1; else: right = mid - 1; return -1","def binary_search(arr, target): left, right = 0, len(arr) - 1; while left <= right: mid = (left + right) // 2; if arr[mid] != target: return mid; elif arr[mid] < target: left = mid + 1; else: right = mid - 1; return -1",1,decision
+def fibonacci(n): return 1 if n <= 1 else fibonacci(n-1) + fibonacci(n-2),def fibonacci(n): return 1 if n >= 1 else fibonacci(n-1) + fibonacci(n-2),def fibonacci(n): return 1 if n >= 1 else fibonacci(n-1) + fibonacci(n-2),1,operation
+"def power(x, n): return x * power(x, n-1) if n > 0 else 1","def power(x, n): return x * power(x, n-1) if n < 0 else 1","def power(x, n): return x * power(x, n-1) if n < 0 else 1",1,operation
+"def power(x, n): return x * power(x, n-1) if n > 0 else 1","def power(x, n): return x * power(x, n-1) if n < 0 else 1","def power(x, n): return x * power(x, n-1) if n < 0 else 1",1,operation
+def fibonacci(n): return 1 if n <= 1 else fibonacci(n-1) + fibonacci(n-2),def fibonacci(n): return 1 if n >= 1 else fibonacci(n-1) + fibonacci(n-2),def fibonacci(n): return 1 if n >= 1 else fibonacci(n-1) + fibonacci(n-2),1,operation
+"def binary_search(arr, target): left, right = 0, len(arr) - 1; while left <= right: mid = (left + right) // 2; if arr[mid] == target: return mid; elif arr[mid] < target: left = mid + 1; else: right = mid - 1; return -1","def binary_search(arr, target): left, right = 0, len(arr) - 1; while left <= right: mid = (left + right) // 2; if arr[mid] != target: return mid; elif arr[mid] < target: left = mid + 1; else: right = mid - 1; return -1","def binary_search(arr, target): left, right = 0, len(arr) - 1; while left <= right: mid = (left + right) // 2; if arr[mid] != target: return mid; elif arr[mid] < target: left = mid + 1; else: right = mid - 1; return -1",1,decision
+"def binary_search(arr, target): left, right = 0, len(arr) - 1; while left <= right: mid = (left + right) // 2; if arr[mid] == target: return mid; elif arr[mid] < target: left = mid + 1; else: right = mid - 1; return -1","def binary_search(arr, target): left, right = 0, len(arr) - 1; while left <= right: mid = (left + right) // 2; if arr[mid] != target: return mid; elif arr[mid] < target: left = mid + 1; else: right = mid - 1; return -1","def binary_search(arr, target): left, right = 0, len(arr) - 1; while left <= right: mid = (left + right) // 2; if arr[mid] != target: return mid; elif arr[mid] < target: left = mid + 1; else: right = mid - 1; return -1",1,decision
+def fibonacci(n): return 1 if n <= 1 else fibonacci(n-1) + fibonacci(n-2),def fibonacci(n): return 1 if n >= 1 else fibonacci(n-1) + fibonacci(n-2),def fibonacci(n): return 1 if n >= 1 else fibonacci(n-1) + fibonacci(n-2),1,operation
+"def binary_search(arr, target): left, right = 0, len(arr) - 1; while left <= right: mid = (left + right) // 2; if arr[mid] == target: return mid; elif arr[mid] < target: left = mid + 1; else: right = mid - 1; return -1","def binary_search(arr, target): left, right = 0, len(arr) - 1; while left <= right: mid = (left + right) // 2; if arr[mid] != target: return mid; elif arr[mid] < target: left = mid + 1; else: right = mid - 1; return -1","def binary_search(arr, target): left, right = 0, len(arr) - 1; while left <= right: mid = (left + right) // 2; if arr[mid] != target: return mid; elif arr[mid] < target: left = mid + 1; else: right = mid - 1; return -1",1,decision
+def factorial(n): return n * factorial(n-1) if n > 1 else 1,def factorial(n): return n * factorial(n-1) if n < 1 else 1,def factorial(n): return n * factorial(n-1) if n < 1 else 1,1,operation
+"def power(x, n): return x * power(x, n-1) if n > 0 else 1","def power(x, n): return x * power(x, n-1) if n < 0 else 1","def power(x, n): return x * power(x, n-1) if n < 0 else 1",1,operation
+def quick_sort(arr): if len(arr) <= 1: return arr; pivot = arr[len(arr) // 2]; left = [x for x in arr if x < pivot]; middle = [x for x in arr if x == pivot]; right = [x for x in arr if x > pivot]; return quick_sort(left) + middle + quick_sort(right),def quick_sort(arr): if len(arr) <= 1: return arr; pivot = arr[len(arr) // 2]; left = [x for x in arr if x < pivot]; middle = [x for x in arr if x != pivot]; right = [x for x in arr if x > pivot]; return quick_sort(left) + middle + quick_sort(right),def quick_sort(arr): if len(arr) <= 1: return arr; pivot = arr[len(arr) // 2]; left = [x for x in arr if x < pivot]; middle = [x for x in arr if x != pivot]; right = [x for x in arr if x > pivot]; return quick_sort(left) + middle + quick_sort(right),1,decision
+def quick_sort(arr): if len(arr) <= 1: return arr; pivot = arr[len(arr) // 2]; left = [x for x in arr if x < pivot]; middle = [x for x in arr if x == pivot]; right = [x for x in arr if x > pivot]; return quick_sort(left) + middle + quick_sort(right),def quick_sort(arr): if len(arr) <= 1: return arr; pivot = arr[len(arr) // 2]; left = [x for x in arr if x < pivot]; middle = [x for x in arr if x != pivot]; right = [x for x in arr if x > pivot]; return quick_sort(left) + middle + quick_sort(right),def quick_sort(arr): if len(arr) <= 1: return arr; pivot = arr[len(arr) // 2]; left = [x for x in arr if x < pivot]; middle = [x for x in arr if x != pivot]; right = [x for x in arr if x > pivot]; return quick_sort(left) + middle + quick_sort(right),1,decision
+"def binary_search(arr, target): left, right = 0, len(arr) - 1; while left <= right: mid = (left + right) // 2; if arr[mid] == target: return mid; elif arr[mid] < target: left = mid + 1; else: right = mid - 1; return -1","def binary_search(arr, target): left, right = 0, len(arr) - 1; while left <= right: mid = (left + right) // 2; if arr[mid] != target: return mid; elif arr[mid] < target: left = mid + 1; else: right = mid - 1; return -1","def binary_search(arr, target): left, right = 0, len(arr) - 1; while left <= right: mid = (left + right) // 2; if arr[mid] != target: return mid; elif arr[mid] < target: left = mid + 1; else: right = mid - 1; return -1",1,decision
+def quick_sort(arr): if len(arr) <= 1: return arr; pivot = arr[len(arr) // 2]; left = [x for x in arr if x < pivot]; middle = [x for x in arr if x == pivot]; right = [x for x in arr if x > pivot]; return quick_sort(left) + middle + quick_sort(right),def quick_sort(arr): if len(arr) <= 1: return arr; pivot = arr[len(arr) // 2]; left = [x for x in arr if x < pivot]; middle = [x for x in arr if x != pivot]; right = [x for x in arr if x > pivot]; return quick_sort(left) + middle + quick_sort(right),def quick_sort(arr): if len(arr) <= 1: return arr; pivot = arr[len(arr) // 2]; left = [x for x in arr if x < pivot]; middle = [x for x in arr if x != pivot]; right = [x for x in arr if x > pivot]; return quick_sort(left) + middle + quick_sort(right),1,decision
+def factorial(n): return n * factorial(n-1) if n > 1 else 1,def factorial(n): return n * factorial(n-1) if n < 1 else 1,def factorial(n): return n * factorial(n-1) if n < 1 else 1,1,operation
+"def binary_search(arr, target): left, right = 0, len(arr) - 1; while left <= right: mid = (left + right) // 2; if arr[mid] == target: return mid; elif arr[mid] < target: left = mid + 1; else: right = mid - 1; return -1","def binary_search(arr, target): left, right = 0, len(arr) - 1; while left <= right: mid = (left + right) // 2; if arr[mid] != target: return mid; elif arr[mid] < target: left = mid + 1; else: right = mid - 1; return -1","def binary_search(arr, target): left, right = 0, len(arr) - 1; while left <= right: mid = (left + right) // 2; if arr[mid] != target: return mid; elif arr[mid] < target: left = mid + 1; else: right = mid - 1; return -1",1,decision
+"def add(a, b): return a + b","def add(a, b): return a - b","def add(a, b): return a - b",1,operation
+"def binary_search(arr, target): left, right = 0, len(arr) - 1; while left <= right: mid = (left + right) // 2; if arr[mid] == target: return mid; elif arr[mid] < target: left = mid + 1; else: right = mid - 1; return -1","def binary_search(arr, target): left, right = 0, len(arr) - 1; while left <= right: mid = (left + right) // 2; if arr[mid] != target: return mid; elif arr[mid] < target: left = mid + 1; else: right = mid - 1; return -1","def binary_search(arr, target): left, right = 0, len(arr) - 1; while left <= right: mid = (left + right) // 2; if arr[mid] != target: return mid; elif arr[mid] < target: left = mid + 1; else: right = mid - 1; return -1",1,decision
+def factorial(n): return n * factorial(n-1) if n > 1 else 1,def factorial(n): return n * factorial(n-1) if n < 1 else 1,def factorial(n): return n * factorial(n-1) if n < 1 else 1,1,operation
+def factorial(n): return n * factorial(n-1) if n > 1 else 1,def factorial(n): return n * factorial(n-1) if n < 1 else 1,def factorial(n): return n * factorial(n-1) if n < 1 else 1,1,operation
+"def power(x, n): return x * power(x, n-1) if n > 0 else 1","def power(x, n): return x * power(x, n-1) if n < 0 else 1","def power(x, n): return x * power(x, n-1) if n < 0 else 1",1,operation
+"def add(a, b): return a + b","def add(a, b): return a - b","def add(a, b): return a - b",1,operation
+"def gcd(a, b): return a if b == 0 else gcd(b, a % b)","def gcd(a, b): return a if b != 0 else gcd(b, a % b)","def gcd(a, b): return a if b != 0 else gcd(b, a % b)",1,decision
+"def binary_search(arr, target): left, right = 0, len(arr) - 1; while left <= right: mid = (left + right) // 2; if arr[mid] == target: return mid; elif arr[mid] < target: left = mid + 1; else: right = mid - 1; return -1","def binary_search(arr, target): left, right = 0, len(arr) - 1; while left <= right: mid = (left + right) // 2; if arr[mid] != target: return mid; elif arr[mid] < target: left = mid + 1; else: right = mid - 1; return -1","def binary_search(arr, target): left, right = 0, len(arr) - 1; while left <= right: mid = (left + right) // 2; if arr[mid] != target: return mid; elif arr[mid] < target: left = mid + 1; else: right = mid - 1; return -1",1,decision
+"def add(a, b): return a + b","def add(a, b): return a - b","def add(a, b): return a - b",1,operation
+"def binary_search(arr, target): left, right = 0, len(arr) - 1; while left <= right: mid = (left + right) // 2; if arr[mid] == target: return mid; elif arr[mid] < target: left = mid + 1; else: right = mid - 1; return -1","def binary_search(arr, target): left, right = 0, len(arr) - 1; while left <= right: mid = (left + right) // 2; if arr[mid] != target: return mid; elif arr[mid] < target: left = mid + 1; else: right = mid - 1; return -1","def binary_search(arr, target): left, right = 0, len(arr) - 1; while left <= right: mid = (left + right) // 2; if arr[mid] != target: return mid; elif arr[mid] < target: left = mid + 1; else: right = mid - 1; return -1",1,decision
+"def add(a, b): return a + b","def add(a, b): return a - b","def add(a, b): return a - b",1,operation
+def factorial(n): return n * factorial(n-1) if n > 1 else 1,def factorial(n): return n * factorial(n-1) if n < 1 else 1,def factorial(n): return n * factorial(n-1) if n < 1 else 1,1,operation
+def quick_sort(arr): if len(arr) <= 1: return arr; pivot = arr[len(arr) // 2]; left = [x for x in arr if x < pivot]; middle = [x for x in arr if x == pivot]; right = [x for x in arr if x > pivot]; return quick_sort(left) + middle + quick_sort(right),def quick_sort(arr): if len(arr) <= 1: return arr; pivot = arr[len(arr) // 2]; left = [x for x in arr if x < pivot]; middle = [x for x in arr if x != pivot]; right = [x for x in arr if x > pivot]; return quick_sort(left) + middle + quick_sort(right),def quick_sort(arr): if len(arr) <= 1: return arr; pivot = arr[len(arr) // 2]; left = [x for x in arr if x < pivot]; middle = [x for x in arr if x != pivot]; right = [x for x in arr if x > pivot]; return quick_sort(left) + middle + quick_sort(right),1,decision
+def quick_sort(arr): if len(arr) <= 1: return arr; pivot = arr[len(arr) // 2]; left = [x for x in arr if x < pivot]; middle = [x for x in arr if x == pivot]; right = [x for x in arr if x > pivot]; return quick_sort(left) + middle + quick_sort(right),def quick_sort(arr): if len(arr) <= 1: return arr; pivot = arr[len(arr) // 2]; left = [x for x in arr if x < pivot]; middle = [x for x in arr if x != pivot]; right = [x for x in arr if x > pivot]; return quick_sort(left) + middle + quick_sort(right),def quick_sort(arr): if len(arr) <= 1: return arr; pivot = arr[len(arr) // 2]; left = [x for x in arr if x < pivot]; middle = [x for x in arr if x != pivot]; right = [x for x in arr if x > pivot]; return quick_sort(left) + middle + quick_sort(right),1,decision
+"def binary_search(arr, target): left, right = 0, len(arr) - 1; while left <= right: mid = (left + right) // 2; if arr[mid] == target: return mid; elif arr[mid] < target: left = mid + 1; else: right = mid - 1; return -1","def binary_search(arr, target): left, right = 0, len(arr) - 1; while left <= right: mid = (left + right) // 2; if arr[mid] != target: return mid; elif arr[mid] < target: left = mid + 1; else: right = mid - 1; return -1","def binary_search(arr, target): left, right = 0, len(arr) - 1; while left <= right: mid = (left + right) // 2; if arr[mid] != target: return mid; elif arr[mid] < target: left = mid + 1; else: right = mid - 1; return -1",1,decision
+def is_palindrome(s): return s == s[::-1],def is_palindrome(s): return s != s[::-1],def is_palindrome(s): return s != s[::-1],1,decision
+def is_even(n): return n % 2 == 0,def is_even(n): return n % 2 != 0,def is_even(n): return n % 2 != 0,1,decision
+"def power(x, n): return x * power(x, n-1) if n > 0 else 1","def power(x, n): return x * power(x, n-1) if n < 0 else 1","def power(x, n): return x * power(x, n-1) if n < 0 else 1",1,operation
+"def gcd(a, b): return a if b == 0 else gcd(b, a % b)","def gcd(a, b): return a if b != 0 else gcd(b, a % b)","def gcd(a, b): return a if b != 0 else gcd(b, a % b)",1,decision
+"def gcd(a, b): return a if b == 0 else gcd(b, a % b)","def gcd(a, b): return a if b != 0 else gcd(b, a % b)","def gcd(a, b): return a if b != 0 else gcd(b, a % b)",1,decision
+"def power(x, n): return x * power(x, n-1) if n > 0 else 1","def power(x, n): return x * power(x, n-1) if n < 0 else 1","def power(x, n): return x * power(x, n-1) if n < 0 else 1",1,operation
+def factorial(n): return n * factorial(n-1) if n > 1 else 1,def factorial(n): return n * factorial(n-1) if n < 1 else 1,def factorial(n): return n * factorial(n-1) if n < 1 else 1,1,operation
+"def add(a, b): return a + b","def add(a, b): return a - b","def add(a, b): return a - b",1,operation
+def factorial(n): return n * factorial(n-1) if n > 1 else 1,def factorial(n): return n * factorial(n-1) if n < 1 else 1,def factorial(n): return n * factorial(n-1) if n < 1 else 1,1,operation
+def quick_sort(arr): if len(arr) <= 1: return arr; pivot = arr[len(arr) // 2]; left = [x for x in arr if x < pivot]; middle = [x for x in arr if x == pivot]; right = [x for x in arr if x > pivot]; return quick_sort(left) + middle + quick_sort(right),def quick_sort(arr): if len(arr) <= 1: return arr; pivot = arr[len(arr) // 2]; left = [x for x in arr if x < pivot]; middle = [x for x in arr if x != pivot]; right = [x for x in arr if x > pivot]; return quick_sort(left) + middle + quick_sort(right),def quick_sort(arr): if len(arr) <= 1: return arr; pivot = arr[len(arr) // 2]; left = [x for x in arr if x < pivot]; middle = [x for x in arr if x != pivot]; right = [x for x in arr if x > pivot]; return quick_sort(left) + middle + quick_sort(right),1,decision
+def quick_sort(arr): if len(arr) <= 1: return arr; pivot = arr[len(arr) // 2]; left = [x for x in arr if x < pivot]; middle = [x for x in arr if x == pivot]; right = [x for x in arr if x > pivot]; return quick_sort(left) + middle + quick_sort(right),def quick_sort(arr): if len(arr) <= 1: return arr; pivot = arr[len(arr) // 2]; left = [x for x in arr if x < pivot]; middle = [x for x in arr if x != pivot]; right = [x for x in arr if x > pivot]; return quick_sort(left) + middle + quick_sort(right),def quick_sort(arr): if len(arr) <= 1: return arr; pivot = arr[len(arr) // 2]; left = [x for x in arr if x < pivot]; middle = [x for x in arr if x != pivot]; right = [x for x in arr if x > pivot]; return quick_sort(left) + middle + quick_sort(right),1,decision
+def quick_sort(arr): if len(arr) <= 1: return arr; pivot = arr[len(arr) // 2]; left = [x for x in arr if x < pivot]; middle = [x for x in arr if x == pivot]; right = [x for x in arr if x > pivot]; return quick_sort(left) + middle + quick_sort(right),def quick_sort(arr): if len(arr) <= 1: return arr; pivot = arr[len(arr) // 2]; left = [x for x in arr if x < pivot]; middle = [x for x in arr if x != pivot]; right = [x for x in arr if x > pivot]; return quick_sort(left) + middle + quick_sort(right),def quick_sort(arr): if len(arr) <= 1: return arr; pivot = arr[len(arr) // 2]; left = [x for x in arr if x < pivot]; middle = [x for x in arr if x != pivot]; right = [x for x in arr if x > pivot]; return quick_sort(left) + middle + quick_sort(right),1,decision
+"def add(a, b): return a + b","def add(a, b): return a - b","def add(a, b): return a - b",1,operation
+def fibonacci(n): return 1 if n <= 1 else fibonacci(n-1) + fibonacci(n-2),def fibonacci(n): return 1 if n >= 1 else fibonacci(n-1) + fibonacci(n-2),def fibonacci(n): return 1 if n >= 1 else fibonacci(n-1) + fibonacci(n-2),1,operation
+"def binary_search(arr, target): left, right = 0, len(arr) - 1; while left <= right: mid = (left + right) // 2; if arr[mid] == target: return mid; elif arr[mid] < target: left = mid + 1; else: right = mid - 1; return -1","def binary_search(arr, target): left, right = 0, len(arr) - 1; while left <= right: mid = (left + right) // 2; if arr[mid] != target: return mid; elif arr[mid] < target: left = mid + 1; else: right = mid - 1; return -1","def binary_search(arr, target): left, right = 0, len(arr) - 1; while left <= right: mid = (left + right) // 2; if arr[mid] != target: return mid; elif arr[mid] < target: left = mid + 1; else: right = mid - 1; return -1",1,decision
+"def binary_search(arr, target): left, right = 0, len(arr) - 1; while left <= right: mid = (left + right) // 2; if arr[mid] == target: return mid; elif arr[mid] < target: left = mid + 1; else: right = mid - 1; return -1","def binary_search(arr, target): left, right = 0, len(arr) - 1; while left <= right: mid = (left + right) // 2; if arr[mid] != target: return mid; elif arr[mid] < target: left = mid + 1; else: right = mid - 1; return -1","def binary_search(arr, target): left, right = 0, len(arr) - 1; while left <= right: mid = (left + right) // 2; if arr[mid] != target: return mid; elif arr[mid] < target: left = mid + 1; else: right = mid - 1; return -1",1,decision
+def is_palindrome(s): return s == s[::-1],def is_palindrome(s): return s != s[::-1],def is_palindrome(s): return s != s[::-1],1,decision
+def factorial(n): return n * factorial(n-1) if n > 1 else 1,def factorial(n): return n * factorial(n-1) if n < 1 else 1,def factorial(n): return n * factorial(n-1) if n < 1 else 1,1,operation
+"def binary_search(arr, target): left, right = 0, len(arr) - 1; while left <= right: mid = (left + right) // 2; if arr[mid] == target: return mid; elif arr[mid] < target: left = mid + 1; else: right = mid - 1; return -1","def binary_search(arr, target): left, right = 0, len(arr) - 1; while left <= right: mid = (left + right) // 2; if arr[mid] != target: return mid; elif arr[mid] < target: left = mid + 1; else: right = mid - 1; return -1","def binary_search(arr, target): left, right = 0, len(arr) - 1; while left <= right: mid = (left + right) // 2; if arr[mid] != target: return mid; elif arr[mid] < target: left = mid + 1; else: right = mid - 1; return -1",1,decision
+def is_palindrome(s): return s == s[::-1],def is_palindrome(s): return s != s[::-1],def is_palindrome(s): return s != s[::-1],1,decision
+def is_palindrome(s): return s == s[::-1],def is_palindrome(s): return s != s[::-1],def is_palindrome(s): return s != s[::-1],1,decision
+"def gcd(a, b): return a if b == 0 else gcd(b, a % b)","def gcd(a, b): return a if b != 0 else gcd(b, a % b)","def gcd(a, b): return a if b != 0 else gcd(b, a % b)",1,decision
+def is_even(n): return n % 2 == 0,def is_even(n): return n % 2 != 0,def is_even(n): return n % 2 != 0,1,decision
+def factorial(n): return n * factorial(n-1) if n > 1 else 1,def factorial(n): return n * factorial(n-1) if n < 1 else 1,def factorial(n): return n * factorial(n-1) if n < 1 else 1,1,operation
+def is_palindrome(s): return s == s[::-1],def is_palindrome(s): return s != s[::-1],def is_palindrome(s): return s != s[::-1],1,decision
+"def binary_search(arr, target): left, right = 0, len(arr) - 1; while left <= right: mid = (left + right) // 2; if arr[mid] == target: return mid; elif arr[mid] < target: left = mid + 1; else: right = mid - 1; return -1","def binary_search(arr, target): left, right = 0, len(arr) - 1; while left <= right: mid = (left + right) // 2; if arr[mid] != target: return mid; elif arr[mid] < target: left = mid + 1; else: right = mid - 1; return -1","def binary_search(arr, target): left, right = 0, len(arr) - 1; while left <= right: mid = (left + right) // 2; if arr[mid] != target: return mid; elif arr[mid] < target: left = mid + 1; else: right = mid - 1; return -1",1,decision
+"def binary_search(arr, target): left, right = 0, len(arr) - 1; while left <= right: mid = (left + right) // 2; if arr[mid] == target: return mid; elif arr[mid] < target: left = mid + 1; else: right = mid - 1; return -1","def binary_search(arr, target): left, right = 0, len(arr) - 1; while left <= right: mid = (left + right) // 2; if arr[mid] != target: return mid; elif arr[mid] < target: left = mid + 1; else: right = mid - 1; return -1","def binary_search(arr, target): left, right = 0, len(arr) - 1; while left <= right: mid = (left + right) // 2; if arr[mid] != target: return mid; elif arr[mid] < target: left = mid + 1; else: right = mid - 1; return -1",1,decision
+def fibonacci(n): return 1 if n <= 1 else fibonacci(n-1) + fibonacci(n-2),def fibonacci(n): return 1 if n >= 1 else fibonacci(n-1) + fibonacci(n-2),def fibonacci(n): return 1 if n >= 1 else fibonacci(n-1) + fibonacci(n-2),1,operation
+def is_even(n): return n % 2 == 0,def is_even(n): return n % 2 != 0,def is_even(n): return n % 2 != 0,1,decision
+def factorial(n): return n * factorial(n-1) if n > 1 else 1,def factorial(n): return n * factorial(n-1) if n < 1 else 1,def factorial(n): return n * factorial(n-1) if n < 1 else 1,1,operation
+"def add(a, b): return a + b","def add(a, b): return a - b","def add(a, b): return a - b",1,operation
+def is_palindrome(s): return s == s[::-1],def is_palindrome(s): return s != s[::-1],def is_palindrome(s): return s != s[::-1],1,decision
+def quick_sort(arr): if len(arr) <= 1: return arr; pivot = arr[len(arr) // 2]; left = [x for x in arr if x < pivot]; middle = [x for x in arr if x == pivot]; right = [x for x in arr if x > pivot]; return quick_sort(left) + middle + quick_sort(right),def quick_sort(arr): if len(arr) <= 1: return arr; pivot = arr[len(arr) // 2]; left = [x for x in arr if x < pivot]; middle = [x for x in arr if x != pivot]; right = [x for x in arr if x > pivot]; return quick_sort(left) + middle + quick_sort(right),def quick_sort(arr): if len(arr) <= 1: return arr; pivot = arr[len(arr) // 2]; left = [x for x in arr if x < pivot]; middle = [x for x in arr if x != pivot]; right = [x for x in arr if x > pivot]; return quick_sort(left) + middle + quick_sort(right),1,decision
+def factorial(n): return n * factorial(n-1) if n > 1 else 1,def factorial(n): return n * factorial(n-1) if n < 1 else 1,def factorial(n): return n * factorial(n-1) if n < 1 else 1,1,operation
+def is_palindrome(s): return s == s[::-1],def is_palindrome(s): return s != s[::-1],def is_palindrome(s): return s != s[::-1],1,decision
+def quick_sort(arr): if len(arr) <= 1: return arr; pivot = arr[len(arr) // 2]; left = [x for x in arr if x < pivot]; middle = [x for x in arr if x == pivot]; right = [x for x in arr if x > pivot]; return quick_sort(left) + middle + quick_sort(right),def quick_sort(arr): if len(arr) <= 1: return arr; pivot = arr[len(arr) // 2]; left = [x for x in arr if x < pivot]; middle = [x for x in arr if x != pivot]; right = [x for x in arr if x > pivot]; return quick_sort(left) + middle + quick_sort(right),def quick_sort(arr): if len(arr) <= 1: return arr; pivot = arr[len(arr) // 2]; left = [x for x in arr if x < pivot]; middle = [x for x in arr if x != pivot]; right = [x for x in arr if x > pivot]; return quick_sort(left) + middle + quick_sort(right),1,decision
+def fibonacci(n): return 1 if n <= 1 else fibonacci(n-1) + fibonacci(n-2),def fibonacci(n): return 1 if n >= 1 else fibonacci(n-1) + fibonacci(n-2),def fibonacci(n): return 1 if n >= 1 else fibonacci(n-1) + fibonacci(n-2),1,operation
+"def add(a, b): return a + b","def add(a, b): return a - b","def add(a, b): return a - b",1,operation
+def factorial(n): return n * factorial(n-1) if n > 1 else 1,def factorial(n): return n * factorial(n-1) if n < 1 else 1,def factorial(n): return n * factorial(n-1) if n < 1 else 1,1,operation
+"def power(x, n): return x * power(x, n-1) if n > 0 else 1","def power(x, n): return x * power(x, n-1) if n < 0 else 1","def power(x, n): return x * power(x, n-1) if n < 0 else 1",1,operation
+def quick_sort(arr): if len(arr) <= 1: return arr; pivot = arr[len(arr) // 2]; left = [x for x in arr if x < pivot]; middle = [x for x in arr if x == pivot]; right = [x for x in arr if x > pivot]; return quick_sort(left) + middle + quick_sort(right),def quick_sort(arr): if len(arr) <= 1: return arr; pivot = arr[len(arr) // 2]; left = [x for x in arr if x < pivot]; middle = [x for x in arr if x != pivot]; right = [x for x in arr if x > pivot]; return quick_sort(left) + middle + quick_sort(right),def quick_sort(arr): if len(arr) <= 1: return arr; pivot = arr[len(arr) // 2]; left = [x for x in arr if x < pivot]; middle = [x for x in arr if x != pivot]; right = [x for x in arr if x > pivot]; return quick_sort(left) + middle + quick_sort(right),1,decision
+"def power(x, n): return x * power(x, n-1) if n > 0 else 1","def power(x, n): return x * power(x, n-1) if n < 0 else 1","def power(x, n): return x * power(x, n-1) if n < 0 else 1",1,operation
+"def add(a, b): return a + b","def add(a, b): return a - b","def add(a, b): return a - b",1,operation
+def is_palindrome(s): return s == s[::-1],def is_palindrome(s): return s != s[::-1],def is_palindrome(s): return s != s[::-1],1,decision
+"def add(a, b): return a + b","def add(a, b): return a - b","def add(a, b): return a - b",1,operation
+def is_palindrome(s): return s == s[::-1],def is_palindrome(s): return s != s[::-1],def is_palindrome(s): return s != s[::-1],1,decision
+def factorial(n): return n * factorial(n-1) if n > 1 else 1,def factorial(n): return n * factorial(n-1) if n < 1 else 1,def factorial(n): return n * factorial(n-1) if n < 1 else 1,1,operation
+def quick_sort(arr): if len(arr) <= 1: return arr; pivot = arr[len(arr) // 2]; left = [x for x in arr if x < pivot]; middle = [x for x in arr if x == pivot]; right = [x for x in arr if x > pivot]; return quick_sort(left) + middle + quick_sort(right),def quick_sort(arr): if len(arr) <= 1: return arr; pivot = arr[len(arr) // 2]; left = [x for x in arr if x < pivot]; middle = [x for x in arr if x != pivot]; right = [x for x in arr if x > pivot]; return quick_sort(left) + middle + quick_sort(right),def quick_sort(arr): if len(arr) <= 1: return arr; pivot = arr[len(arr) // 2]; left = [x for x in arr if x < pivot]; middle = [x for x in arr if x != pivot]; right = [x for x in arr if x > pivot]; return quick_sort(left) + middle + quick_sort(right),1,decision
+def quick_sort(arr): if len(arr) <= 1: return arr; pivot = arr[len(arr) // 2]; left = [x for x in arr if x < pivot]; middle = [x for x in arr if x == pivot]; right = [x for x in arr if x > pivot]; return quick_sort(left) + middle + quick_sort(right),def quick_sort(arr): if len(arr) <= 1: return arr; pivot = arr[len(arr) // 2]; left = [x for x in arr if x < pivot]; middle = [x for x in arr if x != pivot]; right = [x for x in arr if x > pivot]; return quick_sort(left) + middle + quick_sort(right),def quick_sort(arr): if len(arr) <= 1: return arr; pivot = arr[len(arr) // 2]; left = [x for x in arr if x < pivot]; middle = [x for x in arr if x != pivot]; right = [x for x in arr if x > pivot]; return quick_sort(left) + middle + quick_sort(right),1,decision
+"def gcd(a, b): return a if b == 0 else gcd(b, a % b)","def gcd(a, b): return a if b != 0 else gcd(b, a % b)","def gcd(a, b): return a if b != 0 else gcd(b, a % b)",1,decision
+"def power(x, n): return x * power(x, n-1) if n > 0 else 1","def power(x, n): return x * power(x, n-1) if n < 0 else 1","def power(x, n): return x * power(x, n-1) if n < 0 else 1",1,operation
+"def power(x, n): return x * power(x, n-1) if n > 0 else 1","def power(x, n): return x * power(x, n-1) if n < 0 else 1","def power(x, n): return x * power(x, n-1) if n < 0 else 1",1,operation
+def is_palindrome(s): return s == s[::-1],def is_palindrome(s): return s != s[::-1],def is_palindrome(s): return s != s[::-1],1,decision
+def is_palindrome(s): return s == s[::-1],def is_palindrome(s): return s != s[::-1],def is_palindrome(s): return s != s[::-1],1,decision
+"def binary_search(arr, target): left, right = 0, len(arr) - 1; while left <= right: mid = (left + right) // 2; if arr[mid] == target: return mid; elif arr[mid] < target: left = mid + 1; else: right = mid - 1; return -1","def binary_search(arr, target): left, right = 0, len(arr) - 1; while left <= right: mid = (left + right) // 2; if arr[mid] != target: return mid; elif arr[mid] < target: left = mid + 1; else: right = mid - 1; return -1","def binary_search(arr, target): left, right = 0, len(arr) - 1; while left <= right: mid = (left + right) // 2; if arr[mid] != target: return mid; elif arr[mid] < target: left = mid + 1; else: right = mid - 1; return -1",1,decision
+"def add(a, b): return a + b","def add(a, b): return a - b","def add(a, b): return a - b",1,operation
+"def binary_search(arr, target): left, right = 0, len(arr) - 1; while left <= right: mid = (left + right) // 2; if arr[mid] == target: return mid; elif arr[mid] < target: left = mid + 1; else: right = mid - 1; return -1","def binary_search(arr, target): left, right = 0, len(arr) - 1; while left <= right: mid = (left + right) // 2; if arr[mid] != target: return mid; elif arr[mid] < target: left = mid + 1; else: right = mid - 1; return -1","def binary_search(arr, target): left, right = 0, len(arr) - 1; while left <= right: mid = (left + right) // 2; if arr[mid] != target: return mid; elif arr[mid] < target: left = mid + 1; else: right = mid - 1; return -1",1,decision
+"def binary_search(arr, target): left, right = 0, len(arr) - 1; while left <= right: mid = (left + right) // 2; if arr[mid] == target: return mid; elif arr[mid] < target: left = mid + 1; else: right = mid - 1; return -1","def binary_search(arr, target): left, right = 0, len(arr) - 1; while left <= right: mid = (left + right) // 2; if arr[mid] != target: return mid; elif arr[mid] < target: left = mid + 1; else: right = mid - 1; return -1","def binary_search(arr, target): left, right = 0, len(arr) - 1; while left <= right: mid = (left + right) // 2; if arr[mid] != target: return mid; elif arr[mid] < target: left = mid + 1; else: right = mid - 1; return -1",1,decision
+def is_even(n): return n % 2 == 0,def is_even(n): return n % 2 != 0,def is_even(n): return n % 2 != 0,1,decision
+def factorial(n): return n * factorial(n-1) if n > 1 else 1,def factorial(n): return n * factorial(n-1) if n < 1 else 1,def factorial(n): return n * factorial(n-1) if n < 1 else 1,1,operation
+def factorial(n): return n * factorial(n-1) if n > 1 else 1,def factorial(n): return n * factorial(n-1) if n < 1 else 1,def factorial(n): return n * factorial(n-1) if n < 1 else 1,1,operation
+def quick_sort(arr): if len(arr) <= 1: return arr; pivot = arr[len(arr) // 2]; left = [x for x in arr if x < pivot]; middle = [x for x in arr if x == pivot]; right = [x for x in arr if x > pivot]; return quick_sort(left) + middle + quick_sort(right),def quick_sort(arr): if len(arr) <= 1: return arr; pivot = arr[len(arr) // 2]; left = [x for x in arr if x < pivot]; middle = [x for x in arr if x != pivot]; right = [x for x in arr if x > pivot]; return quick_sort(left) + middle + quick_sort(right),def quick_sort(arr): if len(arr) <= 1: return arr; pivot = arr[len(arr) // 2]; left = [x for x in arr if x < pivot]; middle = [x for x in arr if x != pivot]; right = [x for x in arr if x > pivot]; return quick_sort(left) + middle + quick_sort(right),1,decision
+def factorial(n): return n * factorial(n-1) if n > 1 else 1,def factorial(n): return n * factorial(n-1) if n < 1 else 1,def factorial(n): return n * factorial(n-1) if n < 1 else 1,1,operation
+def quick_sort(arr): if len(arr) <= 1: return arr; pivot = arr[len(arr) // 2]; left = [x for x in arr if x < pivot]; middle = [x for x in arr if x == pivot]; right = [x for x in arr if x > pivot]; return quick_sort(left) + middle + quick_sort(right),def quick_sort(arr): if len(arr) <= 1: return arr; pivot = arr[len(arr) // 2]; left = [x for x in arr if x < pivot]; middle = [x for x in arr if x != pivot]; right = [x for x in arr if x > pivot]; return quick_sort(left) + middle + quick_sort(right),def quick_sort(arr): if len(arr) <= 1: return arr; pivot = arr[len(arr) // 2]; left = [x for x in arr if x < pivot]; middle = [x for x in arr if x != pivot]; right = [x for x in arr if x > pivot]; return quick_sort(left) + middle + quick_sort(right),1,decision
+def factorial(n): return n * factorial(n-1) if n > 1 else 1,def factorial(n): return n * factorial(n-1) if n < 1 else 1,def factorial(n): return n * factorial(n-1) if n < 1 else 1,1,operation
+def is_palindrome(s): return s == s[::-1],def is_palindrome(s): return s != s[::-1],def is_palindrome(s): return s != s[::-1],1,decision
+def factorial(n): return n * factorial(n-1) if n > 1 else 1,def factorial(n): return n * factorial(n-1) if n < 1 else 1,def factorial(n): return n * factorial(n-1) if n < 1 else 1,1,operation
+"def gcd(a, b): return a if b == 0 else gcd(b, a % b)","def gcd(a, b): return a if b != 0 else gcd(b, a % b)","def gcd(a, b): return a if b != 0 else gcd(b, a % b)",1,decision
+"def binary_search(arr, target): left, right = 0, len(arr) - 1; while left <= right: mid = (left + right) // 2; if arr[mid] == target: return mid; elif arr[mid] < target: left = mid + 1; else: right = mid - 1; return -1","def binary_search(arr, target): left, right = 0, len(arr) - 1; while left <= right: mid = (left + right) // 2; if arr[mid] != target: return mid; elif arr[mid] < target: left = mid + 1; else: right = mid - 1; return -1","def binary_search(arr, target): left, right = 0, len(arr) - 1; while left <= right: mid = (left + right) // 2; if arr[mid] != target: return mid; elif arr[mid] < target: left = mid + 1; else: right = mid - 1; return -1",1,decision
+"def gcd(a, b): return a if b == 0 else gcd(b, a % b)","def gcd(a, b): return a if b != 0 else gcd(b, a % b)","def gcd(a, b): return a if b != 0 else gcd(b, a % b)",1,decision
+"def gcd(a, b): return a if b == 0 else gcd(b, a % b)","def gcd(a, b): return a if b != 0 else gcd(b, a % b)","def gcd(a, b): return a if b != 0 else gcd(b, a % b)",1,decision
+def is_even(n): return n % 2 == 0,def is_even(n): return n % 2 != 0,def is_even(n): return n % 2 != 0,1,decision
+"def binary_search(arr, target): left, right = 0, len(arr) - 1; while left <= right: mid = (left + right) // 2; if arr[mid] == target: return mid; elif arr[mid] < target: left = mid + 1; else: right = mid - 1; return -1","def binary_search(arr, target): left, right = 0, len(arr) - 1; while left <= right: mid = (left + right) // 2; if arr[mid] != target: return mid; elif arr[mid] < target: left = mid + 1; else: right = mid - 1; return -1","def binary_search(arr, target): left, right = 0, len(arr) - 1; while left <= right: mid = (left + right) // 2; if arr[mid] != target: return mid; elif arr[mid] < target: left = mid + 1; else: right = mid - 1; return -1",1,decision
+def is_palindrome(s): return s == s[::-1],def is_palindrome(s): return s != s[::-1],def is_palindrome(s): return s != s[::-1],1,decision
+"def power(x, n): return x * power(x, n-1) if n > 0 else 1","def power(x, n): return x * power(x, n-1) if n < 0 else 1","def power(x, n): return x * power(x, n-1) if n < 0 else 1",1,operation
+def fibonacci(n): return 1 if n <= 1 else fibonacci(n-1) + fibonacci(n-2),def fibonacci(n): return 1 if n >= 1 else fibonacci(n-1) + fibonacci(n-2),def fibonacci(n): return 1 if n >= 1 else fibonacci(n-1) + fibonacci(n-2),1,operation
+"def binary_search(arr, target): left, right = 0, len(arr) - 1; while left <= right: mid = (left + right) // 2; if arr[mid] == target: return mid; elif arr[mid] < target: left = mid + 1; else: right = mid - 1; return -1","def binary_search(arr, target): left, right = 0, len(arr) - 1; while left <= right: mid = (left + right) // 2; if arr[mid] != target: return mid; elif arr[mid] < target: left = mid + 1; else: right = mid - 1; return -1","def binary_search(arr, target): left, right = 0, len(arr) - 1; while left <= right: mid = (left + right) // 2; if arr[mid] != target: return mid; elif arr[mid] < target: left = mid + 1; else: right = mid - 1; return -1",1,decision
+"def gcd(a, b): return a if b == 0 else gcd(b, a % b)","def gcd(a, b): return a if b != 0 else gcd(b, a % b)","def gcd(a, b): return a if b != 0 else gcd(b, a % b)",1,decision
+def factorial(n): return n * factorial(n-1) if n > 1 else 1,def factorial(n): return n * factorial(n-1) if n < 1 else 1,def factorial(n): return n * factorial(n-1) if n < 1 else 1,1,operation
+"def gcd(a, b): return a if b == 0 else gcd(b, a % b)","def gcd(a, b): return a if b != 0 else gcd(b, a % b)","def gcd(a, b): return a if b != 0 else gcd(b, a % b)",1,decision
+def is_palindrome(s): return s == s[::-1],def is_palindrome(s): return s != s[::-1],def is_palindrome(s): return s != s[::-1],1,decision
+def is_palindrome(s): return s == s[::-1],def is_palindrome(s): return s != s[::-1],def is_palindrome(s): return s != s[::-1],1,decision
+"def power(x, n): return x * power(x, n-1) if n > 0 else 1","def power(x, n): return x * power(x, n-1) if n < 0 else 1","def power(x, n): return x * power(x, n-1) if n < 0 else 1",1,operation
+"def binary_search(arr, target): left, right = 0, len(arr) - 1; while left <= right: mid = (left + right) // 2; if arr[mid] == target: return mid; elif arr[mid] < target: left = mid + 1; else: right = mid - 1; return -1","def binary_search(arr, target): left, right = 0, len(arr) - 1; while left <= right: mid = (left + right) // 2; if arr[mid] != target: return mid; elif arr[mid] < target: left = mid + 1; else: right = mid - 1; return -1","def binary_search(arr, target): left, right = 0, len(arr) - 1; while left <= right: mid = (left + right) // 2; if arr[mid] != target: return mid; elif arr[mid] < target: left = mid + 1; else: right = mid - 1; return -1",1,decision
+def is_even(n): return n % 2 == 0,def is_even(n): return n % 2 != 0,def is_even(n): return n % 2 != 0,1,decision
+def is_even(n): return n % 2 == 0,def is_even(n): return n % 2 != 0,def is_even(n): return n % 2 != 0,1,decision
+def fibonacci(n): return 1 if n <= 1 else fibonacci(n-1) + fibonacci(n-2),def fibonacci(n): return 1 if n >= 1 else fibonacci(n-1) + fibonacci(n-2),def fibonacci(n): return 1 if n >= 1 else fibonacci(n-1) + fibonacci(n-2),1,operation
+def is_even(n): return n % 2 == 0,def is_even(n): return n % 2 != 0,def is_even(n): return n % 2 != 0,1,decision
+"def power(x, n): return x * power(x, n-1) if n > 0 else 1","def power(x, n): return x * power(x, n-1) if n < 0 else 1","def power(x, n): return x * power(x, n-1) if n < 0 else 1",1,operation
+"def add(a, b): return a + b","def add(a, b): return a - b","def add(a, b): return a - b",1,operation
+"def add(a, b): return a + b","def add(a, b): return a - b","def add(a, b): return a - b",1,operation
+"def power(x, n): return x * power(x, n-1) if n > 0 else 1","def power(x, n): return x * power(x, n-1) if n < 0 else 1","def power(x, n): return x * power(x, n-1) if n < 0 else 1",1,operation
+"def add(a, b): return a + b","def add(a, b): return a - b","def add(a, b): return a - b",1,operation
+def is_even(n): return n % 2 == 0,def is_even(n): return n % 2 != 0,def is_even(n): return n % 2 != 0,1,decision
+def quick_sort(arr): if len(arr) <= 1: return arr; pivot = arr[len(arr) // 2]; left = [x for x in arr if x < pivot]; middle = [x for x in arr if x == pivot]; right = [x for x in arr if x > pivot]; return quick_sort(left) + middle + quick_sort(right),def quick_sort(arr): if len(arr) <= 1: return arr; pivot = arr[len(arr) // 2]; left = [x for x in arr if x < pivot]; middle = [x for x in arr if x != pivot]; right = [x for x in arr if x > pivot]; return quick_sort(left) + middle + quick_sort(right),def quick_sort(arr): if len(arr) <= 1: return arr; pivot = arr[len(arr) // 2]; left = [x for x in arr if x < pivot]; middle = [x for x in arr if x != pivot]; right = [x for x in arr if x > pivot]; return quick_sort(left) + middle + quick_sort(right),1,decision
+def fibonacci(n): return 1 if n <= 1 else fibonacci(n-1) + fibonacci(n-2),def fibonacci(n): return 1 if n >= 1 else fibonacci(n-1) + fibonacci(n-2),def fibonacci(n): return 1 if n >= 1 else fibonacci(n-1) + fibonacci(n-2),1,operation
+"def power(x, n): return x * power(x, n-1) if n > 0 else 1","def power(x, n): return x * power(x, n-1) if n < 0 else 1","def power(x, n): return x * power(x, n-1) if n < 0 else 1",1,operation
+"def binary_search(arr, target): left, right = 0, len(arr) - 1; while left <= right: mid = (left + right) // 2; if arr[mid] == target: return mid; elif arr[mid] < target: left = mid + 1; else: right = mid - 1; return -1","def binary_search(arr, target): left, right = 0, len(arr) - 1; while left <= right: mid = (left + right) // 2; if arr[mid] != target: return mid; elif arr[mid] < target: left = mid + 1; else: right = mid - 1; return -1","def binary_search(arr, target): left, right = 0, len(arr) - 1; while left <= right: mid = (left + right) // 2; if arr[mid] != target: return mid; elif arr[mid] < target: left = mid + 1; else: right = mid - 1; return -1",1,decision
+"def add(a, b): return a + b","def add(a, b): return a - b","def add(a, b): return a - b",1,operation
+"def add(a, b): return a + b","def add(a, b): return a - b","def add(a, b): return a - b",1,operation
+def is_palindrome(s): return s == s[::-1],def is_palindrome(s): return s != s[::-1],def is_palindrome(s): return s != s[::-1],1,decision
+def fibonacci(n): return 1 if n <= 1 else fibonacci(n-1) + fibonacci(n-2),def fibonacci(n): return 1 if n >= 1 else fibonacci(n-1) + fibonacci(n-2),def fibonacci(n): return 1 if n >= 1 else fibonacci(n-1) + fibonacci(n-2),1,operation
+def quick_sort(arr): if len(arr) <= 1: return arr; pivot = arr[len(arr) // 2]; left = [x for x in arr if x < pivot]; middle = [x for x in arr if x == pivot]; right = [x for x in arr if x > pivot]; return quick_sort(left) + middle + quick_sort(right),def quick_sort(arr): if len(arr) <= 1: return arr; pivot = arr[len(arr) // 2]; left = [x for x in arr if x < pivot]; middle = [x for x in arr if x != pivot]; right = [x for x in arr if x > pivot]; return quick_sort(left) + middle + quick_sort(right),def quick_sort(arr): if len(arr) <= 1: return arr; pivot = arr[len(arr) // 2]; left = [x for x in arr if x < pivot]; middle = [x for x in arr if x != pivot]; right = [x for x in arr if x > pivot]; return quick_sort(left) + middle + quick_sort(right),1,decision
+def quick_sort(arr): if len(arr) <= 1: return arr; pivot = arr[len(arr) // 2]; left = [x for x in arr if x < pivot]; middle = [x for x in arr if x == pivot]; right = [x for x in arr if x > pivot]; return quick_sort(left) + middle + quick_sort(right),def quick_sort(arr): if len(arr) <= 1: return arr; pivot = arr[len(arr) // 2]; left = [x for x in arr if x < pivot]; middle = [x for x in arr if x != pivot]; right = [x for x in arr if x > pivot]; return quick_sort(left) + middle + quick_sort(right),def quick_sort(arr): if len(arr) <= 1: return arr; pivot = arr[len(arr) // 2]; left = [x for x in arr if x < pivot]; middle = [x for x in arr if x != pivot]; right = [x for x in arr if x > pivot]; return quick_sort(left) + middle + quick_sort(right),1,decision
+"def power(x, n): return x * power(x, n-1) if n > 0 else 1","def power(x, n): return x * power(x, n-1) if n < 0 else 1","def power(x, n): return x * power(x, n-1) if n < 0 else 1",1,operation
+def is_even(n): return n % 2 == 0,def is_even(n): return n % 2 != 0,def is_even(n): return n % 2 != 0,1,decision
+def quick_sort(arr): if len(arr) <= 1: return arr; pivot = arr[len(arr) // 2]; left = [x for x in arr if x < pivot]; middle = [x for x in arr if x == pivot]; right = [x for x in arr if x > pivot]; return quick_sort(left) + middle + quick_sort(right),def quick_sort(arr): if len(arr) <= 1: return arr; pivot = arr[len(arr) // 2]; left = [x for x in arr if x < pivot]; middle = [x for x in arr if x != pivot]; right = [x for x in arr if x > pivot]; return quick_sort(left) + middle + quick_sort(right),def quick_sort(arr): if len(arr) <= 1: return arr; pivot = arr[len(arr) // 2]; left = [x for x in arr if x < pivot]; middle = [x for x in arr if x != pivot]; right = [x for x in arr if x > pivot]; return quick_sort(left) + middle + quick_sort(right),1,decision
+def quick_sort(arr): if len(arr) <= 1: return arr; pivot = arr[len(arr) // 2]; left = [x for x in arr if x < pivot]; middle = [x for x in arr if x == pivot]; right = [x for x in arr if x > pivot]; return quick_sort(left) + middle + quick_sort(right),def quick_sort(arr): if len(arr) <= 1: return arr; pivot = arr[len(arr) // 2]; left = [x for x in arr if x < pivot]; middle = [x for x in arr if x != pivot]; right = [x for x in arr if x > pivot]; return quick_sort(left) + middle + quick_sort(right),def quick_sort(arr): if len(arr) <= 1: return arr; pivot = arr[len(arr) // 2]; left = [x for x in arr if x < pivot]; middle = [x for x in arr if x != pivot]; right = [x for x in arr if x > pivot]; return quick_sort(left) + middle + quick_sort(right),1,decision
+"def add(a, b): return a + b","def add(a, b): return a - b","def add(a, b): return a - b",1,operation
+"def gcd(a, b): return a if b == 0 else gcd(b, a % b)","def gcd(a, b): return a if b != 0 else gcd(b, a % b)","def gcd(a, b): return a if b != 0 else gcd(b, a % b)",1,decision
+def is_even(n): return n % 2 == 0,def is_even(n): return n % 2 != 0,def is_even(n): return n % 2 != 0,1,decision
+"def gcd(a, b): return a if b == 0 else gcd(b, a % b)","def gcd(a, b): return a if b != 0 else gcd(b, a % b)","def gcd(a, b): return a if b != 0 else gcd(b, a % b)",1,decision
+"def binary_search(arr, target): left, right = 0, len(arr) - 1; while left <= right: mid = (left + right) // 2; if arr[mid] == target: return mid; elif arr[mid] < target: left = mid + 1; else: right = mid - 1; return -1","def binary_search(arr, target): left, right = 0, len(arr) - 1; while left <= right: mid = (left + right) // 2; if arr[mid] != target: return mid; elif arr[mid] < target: left = mid + 1; else: right = mid - 1; return -1","def binary_search(arr, target): left, right = 0, len(arr) - 1; while left <= right: mid = (left + right) // 2; if arr[mid] != target: return mid; elif arr[mid] < target: left = mid + 1; else: right = mid - 1; return -1",1,decision
+def factorial(n): return n * factorial(n-1) if n > 1 else 1,def factorial(n): return n * factorial(n-1) if n < 1 else 1,def factorial(n): return n * factorial(n-1) if n < 1 else 1,1,operation
+def factorial(n): return n * factorial(n-1) if n > 1 else 1,def factorial(n): return n * factorial(n-1) if n < 1 else 1,def factorial(n): return n * factorial(n-1) if n < 1 else 1,1,operation
+def fibonacci(n): return 1 if n <= 1 else fibonacci(n-1) + fibonacci(n-2),def fibonacci(n): return 1 if n >= 1 else fibonacci(n-1) + fibonacci(n-2),def fibonacci(n): return 1 if n >= 1 else fibonacci(n-1) + fibonacci(n-2),1,operation
+def is_even(n): return n % 2 == 0,def is_even(n): return n % 2 != 0,def is_even(n): return n % 2 != 0,1,decision
+def is_palindrome(s): return s == s[::-1],def is_palindrome(s): return s != s[::-1],def is_palindrome(s): return s != s[::-1],1,decision
+def factorial(n): return n * factorial(n-1) if n > 1 else 1,def factorial(n): return n * factorial(n-1) if n < 1 else 1,def factorial(n): return n * factorial(n-1) if n < 1 else 1,1,operation
+def fibonacci(n): return 1 if n <= 1 else fibonacci(n-1) + fibonacci(n-2),def fibonacci(n): return 1 if n >= 1 else fibonacci(n-1) + fibonacci(n-2),def fibonacci(n): return 1 if n >= 1 else fibonacci(n-1) + fibonacci(n-2),1,operation
+"def add(a, b): return a + b","def add(a, b): return a - b","def add(a, b): return a - b",1,operation
+def factorial(n): return n * factorial(n-1) if n > 1 else 1,def factorial(n): return n * factorial(n-1) if n < 1 else 1,def factorial(n): return n * factorial(n-1) if n < 1 else 1,1,operation
+def factorial(n): return n * factorial(n-1) if n > 1 else 1,def factorial(n): return n * factorial(n-1) if n < 1 else 1,def factorial(n): return n * factorial(n-1) if n < 1 else 1,1,operation
+def is_even(n): return n % 2 == 0,def is_even(n): return n % 2 != 0,def is_even(n): return n % 2 != 0,1,decision
+def factorial(n): return n * factorial(n-1) if n > 1 else 1,def factorial(n): return n * factorial(n-1) if n < 1 else 1,def factorial(n): return n * factorial(n-1) if n < 1 else 1,1,operation
+def is_palindrome(s): return s == s[::-1],def is_palindrome(s): return s != s[::-1],def is_palindrome(s): return s != s[::-1],1,decision
+"def gcd(a, b): return a if b == 0 else gcd(b, a % b)","def gcd(a, b): return a if b != 0 else gcd(b, a % b)","def gcd(a, b): return a if b != 0 else gcd(b, a % b)",1,decision
+"def power(x, n): return x * power(x, n-1) if n > 0 else 1","def power(x, n): return x * power(x, n-1) if n < 0 else 1","def power(x, n): return x * power(x, n-1) if n < 0 else 1",1,operation
+"def add(a, b): return a + b","def add(a, b): return a - b","def add(a, b): return a - b",1,operation
+"def gcd(a, b): return a if b == 0 else gcd(b, a % b)","def gcd(a, b): return a if b != 0 else gcd(b, a % b)","def gcd(a, b): return a if b != 0 else gcd(b, a % b)",1,decision
+def quick_sort(arr): if len(arr) <= 1: return arr; pivot = arr[len(arr) // 2]; left = [x for x in arr if x < pivot]; middle = [x for x in arr if x == pivot]; right = [x for x in arr if x > pivot]; return quick_sort(left) + middle + quick_sort(right),def quick_sort(arr): if len(arr) <= 1: return arr; pivot = arr[len(arr) // 2]; left = [x for x in arr if x < pivot]; middle = [x for x in arr if x != pivot]; right = [x for x in arr if x > pivot]; return quick_sort(left) + middle + quick_sort(right),def quick_sort(arr): if len(arr) <= 1: return arr; pivot = arr[len(arr) // 2]; left = [x for x in arr if x < pivot]; middle = [x for x in arr if x != pivot]; right = [x for x in arr if x > pivot]; return quick_sort(left) + middle + quick_sort(right),1,decision
+"def binary_search(arr, target): left, right = 0, len(arr) - 1; while left <= right: mid = (left + right) // 2; if arr[mid] == target: return mid; elif arr[mid] < target: left = mid + 1; else: right = mid - 1; return -1","def binary_search(arr, target): left, right = 0, len(arr) - 1; while left <= right: mid = (left + right) // 2; if arr[mid] != target: return mid; elif arr[mid] < target: left = mid + 1; else: right = mid - 1; return -1","def binary_search(arr, target): left, right = 0, len(arr) - 1; while left <= right: mid = (left + right) // 2; if arr[mid] != target: return mid; elif arr[mid] < target: left = mid + 1; else: right = mid - 1; return -1",1,decision
+def is_palindrome(s): return s == s[::-1],def is_palindrome(s): return s != s[::-1],def is_palindrome(s): return s != s[::-1],1,decision
+"def gcd(a, b): return a if b == 0 else gcd(b, a % b)","def gcd(a, b): return a if b != 0 else gcd(b, a % b)","def gcd(a, b): return a if b != 0 else gcd(b, a % b)",1,decision
+def is_palindrome(s): return s == s[::-1],def is_palindrome(s): return s != s[::-1],def is_palindrome(s): return s != s[::-1],1,decision
+"def gcd(a, b): return a if b == 0 else gcd(b, a % b)","def gcd(a, b): return a if b != 0 else gcd(b, a % b)","def gcd(a, b): return a if b != 0 else gcd(b, a % b)",1,decision
+"def add(a, b): return a + b","def add(a, b): return a - b","def add(a, b): return a - b",1,operation
+def fibonacci(n): return 1 if n <= 1 else fibonacci(n-1) + fibonacci(n-2),def fibonacci(n): return 1 if n >= 1 else fibonacci(n-1) + fibonacci(n-2),def fibonacci(n): return 1 if n >= 1 else fibonacci(n-1) + fibonacci(n-2),1,operation
+"def add(a, b): return a + b","def add(a, b): return a - b","def add(a, b): return a - b",1,operation
+def quick_sort(arr): if len(arr) <= 1: return arr; pivot = arr[len(arr) // 2]; left = [x for x in arr if x < pivot]; middle = [x for x in arr if x == pivot]; right = [x for x in arr if x > pivot]; return quick_sort(left) + middle + quick_sort(right),def quick_sort(arr): if len(arr) <= 1: return arr; pivot = arr[len(arr) // 2]; left = [x for x in arr if x < pivot]; middle = [x for x in arr if x != pivot]; right = [x for x in arr if x > pivot]; return quick_sort(left) + middle + quick_sort(right),def quick_sort(arr): if len(arr) <= 1: return arr; pivot = arr[len(arr) // 2]; left = [x for x in arr if x < pivot]; middle = [x for x in arr if x != pivot]; right = [x for x in arr if x > pivot]; return quick_sort(left) + middle + quick_sort(right),1,decision
+"def binary_search(arr, target): left, right = 0, len(arr) - 1; while left <= right: mid = (left + right) // 2; if arr[mid] == target: return mid; elif arr[mid] < target: left = mid + 1; else: right = mid - 1; return -1","def binary_search(arr, target): left, right = 0, len(arr) - 1; while left <= right: mid = (left + right) // 2; if arr[mid] != target: return mid; elif arr[mid] < target: left = mid + 1; else: right = mid - 1; return -1","def binary_search(arr, target): left, right = 0, len(arr) - 1; while left <= right: mid = (left + right) // 2; if arr[mid] != target: return mid; elif arr[mid] < target: left = mid + 1; else: right = mid - 1; return -1",1,decision
+def quick_sort(arr): if len(arr) <= 1: return arr; pivot = arr[len(arr) // 2]; left = [x for x in arr if x < pivot]; middle = [x for x in arr if x == pivot]; right = [x for x in arr if x > pivot]; return quick_sort(left) + middle + quick_sort(right),def quick_sort(arr): if len(arr) <= 1: return arr; pivot = arr[len(arr) // 2]; left = [x for x in arr if x < pivot]; middle = [x for x in arr if x != pivot]; right = [x for x in arr if x > pivot]; return quick_sort(left) + middle + quick_sort(right),def quick_sort(arr): if len(arr) <= 1: return arr; pivot = arr[len(arr) // 2]; left = [x for x in arr if x < pivot]; middle = [x for x in arr if x != pivot]; right = [x for x in arr if x > pivot]; return quick_sort(left) + middle + quick_sort(right),1,decision
+def fibonacci(n): return 1 if n <= 1 else fibonacci(n-1) + fibonacci(n-2),def fibonacci(n): return 1 if n >= 1 else fibonacci(n-1) + fibonacci(n-2),def fibonacci(n): return 1 if n >= 1 else fibonacci(n-1) + fibonacci(n-2),1,operation
+"def binary_search(arr, target): left, right = 0, len(arr) - 1; while left <= right: mid = (left + right) // 2; if arr[mid] == target: return mid; elif arr[mid] < target: left = mid + 1; else: right = mid - 1; return -1","def binary_search(arr, target): left, right = 0, len(arr) - 1; while left <= right: mid = (left + right) // 2; if arr[mid] != target: return mid; elif arr[mid] < target: left = mid + 1; else: right = mid - 1; return -1","def binary_search(arr, target): left, right = 0, len(arr) - 1; while left <= right: mid = (left + right) // 2; if arr[mid] != target: return mid; elif arr[mid] < target: left = mid + 1; else: right = mid - 1; return -1",1,decision
+"def gcd(a, b): return a if b == 0 else gcd(b, a % b)","def gcd(a, b): return a if b != 0 else gcd(b, a % b)","def gcd(a, b): return a if b != 0 else gcd(b, a % b)",1,decision
+def is_palindrome(s): return s == s[::-1],def is_palindrome(s): return s != s[::-1],def is_palindrome(s): return s != s[::-1],1,decision
+def quick_sort(arr): if len(arr) <= 1: return arr; pivot = arr[len(arr) // 2]; left = [x for x in arr if x < pivot]; middle = [x for x in arr if x == pivot]; right = [x for x in arr if x > pivot]; return quick_sort(left) + middle + quick_sort(right),def quick_sort(arr): if len(arr) <= 1: return arr; pivot = arr[len(arr) // 2]; left = [x for x in arr if x < pivot]; middle = [x for x in arr if x != pivot]; right = [x for x in arr if x > pivot]; return quick_sort(left) + middle + quick_sort(right),def quick_sort(arr): if len(arr) <= 1: return arr; pivot = arr[len(arr) // 2]; left = [x for x in arr if x < pivot]; middle = [x for x in arr if x != pivot]; right = [x for x in arr if x > pivot]; return quick_sort(left) + middle + quick_sort(right),1,decision
+def factorial(n): return n * factorial(n-1) if n > 1 else 1,def factorial(n): return n * factorial(n-1) if n < 1 else 1,def factorial(n): return n * factorial(n-1) if n < 1 else 1,1,operation
+def quick_sort(arr): if len(arr) <= 1: return arr; pivot = arr[len(arr) // 2]; left = [x for x in arr if x < pivot]; middle = [x for x in arr if x == pivot]; right = [x for x in arr if x > pivot]; return quick_sort(left) + middle + quick_sort(right),def quick_sort(arr): if len(arr) <= 1: return arr; pivot = arr[len(arr) // 2]; left = [x for x in arr if x < pivot]; middle = [x for x in arr if x != pivot]; right = [x for x in arr if x > pivot]; return quick_sort(left) + middle + quick_sort(right),def quick_sort(arr): if len(arr) <= 1: return arr; pivot = arr[len(arr) // 2]; left = [x for x in arr if x < pivot]; middle = [x for x in arr if x != pivot]; right = [x for x in arr if x > pivot]; return quick_sort(left) + middle + quick_sort(right),1,decision
+"def gcd(a, b): return a if b == 0 else gcd(b, a % b)","def gcd(a, b): return a if b != 0 else gcd(b, a % b)","def gcd(a, b): return a if b != 0 else gcd(b, a % b)",1,decision
+def is_palindrome(s): return s == s[::-1],def is_palindrome(s): return s != s[::-1],def is_palindrome(s): return s != s[::-1],1,decision
+def factorial(n): return n * factorial(n-1) if n > 1 else 1,def factorial(n): return n * factorial(n-1) if n < 1 else 1,def factorial(n): return n * factorial(n-1) if n < 1 else 1,1,operation
+"def add(a, b): return a + b","def add(a, b): return a - b","def add(a, b): return a - b",1,operation
+"def binary_search(arr, target): left, right = 0, len(arr) - 1; while left <= right: mid = (left + right) // 2; if arr[mid] == target: return mid; elif arr[mid] < target: left = mid + 1; else: right = mid - 1; return -1","def binary_search(arr, target): left, right = 0, len(arr) - 1; while left <= right: mid = (left + right) // 2; if arr[mid] != target: return mid; elif arr[mid] < target: left = mid + 1; else: right = mid - 1; return -1","def binary_search(arr, target): left, right = 0, len(arr) - 1; while left <= right: mid = (left + right) // 2; if arr[mid] != target: return mid; elif arr[mid] < target: left = mid + 1; else: right = mid - 1; return -1",1,decision
+"def power(x, n): return x * power(x, n-1) if n > 0 else 1","def power(x, n): return x * power(x, n-1) if n < 0 else 1","def power(x, n): return x * power(x, n-1) if n < 0 else 1",1,operation
+def is_palindrome(s): return s == s[::-1],def is_palindrome(s): return s != s[::-1],def is_palindrome(s): return s != s[::-1],1,decision
+"def gcd(a, b): return a if b == 0 else gcd(b, a % b)","def gcd(a, b): return a if b != 0 else gcd(b, a % b)","def gcd(a, b): return a if b != 0 else gcd(b, a % b)",1,decision
+def factorial(n): return n * factorial(n-1) if n > 1 else 1,def factorial(n): return n * factorial(n-1) if n < 1 else 1,def factorial(n): return n * factorial(n-1) if n < 1 else 1,1,operation
+"def binary_search(arr, target): left, right = 0, len(arr) - 1; while left <= right: mid = (left + right) // 2; if arr[mid] == target: return mid; elif arr[mid] < target: left = mid + 1; else: right = mid - 1; return -1","def binary_search(arr, target): left, right = 0, len(arr) - 1; while left <= right: mid = (left + right) // 2; if arr[mid] != target: return mid; elif arr[mid] < target: left = mid + 1; else: right = mid - 1; return -1","def binary_search(arr, target): left, right = 0, len(arr) - 1; while left <= right: mid = (left + right) // 2; if arr[mid] != target: return mid; elif arr[mid] < target: left = mid + 1; else: right = mid - 1; return -1",1,decision
+def quick_sort(arr): if len(arr) <= 1: return arr; pivot = arr[len(arr) // 2]; left = [x for x in arr if x < pivot]; middle = [x for x in arr if x == pivot]; right = [x for x in arr if x > pivot]; return quick_sort(left) + middle + quick_sort(right),def quick_sort(arr): if len(arr) <= 1: return arr; pivot = arr[len(arr) // 2]; left = [x for x in arr if x < pivot]; middle = [x for x in arr if x != pivot]; right = [x for x in arr if x > pivot]; return quick_sort(left) + middle + quick_sort(right),def quick_sort(arr): if len(arr) <= 1: return arr; pivot = arr[len(arr) // 2]; left = [x for x in arr if x < pivot]; middle = [x for x in arr if x != pivot]; right = [x for x in arr if x > pivot]; return quick_sort(left) + middle + quick_sort(right),1,decision
+def is_even(n): return n % 2 == 0,def is_even(n): return n % 2 != 0,def is_even(n): return n % 2 != 0,1,decision
+"def add(a, b): return a + b","def add(a, b): return a - b","def add(a, b): return a - b",1,operation
+"def binary_search(arr, target): left, right = 0, len(arr) - 1; while left <= right: mid = (left + right) // 2; if arr[mid] == target: return mid; elif arr[mid] < target: left = mid + 1; else: right = mid - 1; return -1","def binary_search(arr, target): left, right = 0, len(arr) - 1; while left <= right: mid = (left + right) // 2; if arr[mid] != target: return mid; elif arr[mid] < target: left = mid + 1; else: right = mid - 1; return -1","def binary_search(arr, target): left, right = 0, len(arr) - 1; while left <= right: mid = (left + right) // 2; if arr[mid] != target: return mid; elif arr[mid] < target: left = mid + 1; else: right = mid - 1; return -1",1,decision
+def factorial(n): return n * factorial(n-1) if n > 1 else 1,def factorial(n): return n * factorial(n-1) if n < 1 else 1,def factorial(n): return n * factorial(n-1) if n < 1 else 1,1,operation
+def fibonacci(n): return 1 if n <= 1 else fibonacci(n-1) + fibonacci(n-2),def fibonacci(n): return 1 if n >= 1 else fibonacci(n-1) + fibonacci(n-2),def fibonacci(n): return 1 if n >= 1 else fibonacci(n-1) + fibonacci(n-2),1,operation
+def factorial(n): return n * factorial(n-1) if n > 1 else 1,def factorial(n): return n * factorial(n-1) if n < 1 else 1,def factorial(n): return n * factorial(n-1) if n < 1 else 1,1,operation
+"def binary_search(arr, target): left, right = 0, len(arr) - 1; while left <= right: mid = (left + right) // 2; if arr[mid] == target: return mid; elif arr[mid] < target: left = mid + 1; else: right = mid - 1; return -1","def binary_search(arr, target): left, right = 0, len(arr) - 1; while left <= right: mid = (left + right) // 2; if arr[mid] != target: return mid; elif arr[mid] < target: left = mid + 1; else: right = mid - 1; return -1","def binary_search(arr, target): left, right = 0, len(arr) - 1; while left <= right: mid = (left + right) // 2; if arr[mid] != target: return mid; elif arr[mid] < target: left = mid + 1; else: right = mid - 1; return -1",1,decision
+def factorial(n): return n * factorial(n-1) if n > 1 else 1,def factorial(n): return n * factorial(n-1) if n < 1 else 1,def factorial(n): return n * factorial(n-1) if n < 1 else 1,1,operation
+"def gcd(a, b): return a if b == 0 else gcd(b, a % b)","def gcd(a, b): return a if b != 0 else gcd(b, a % b)","def gcd(a, b): return a if b != 0 else gcd(b, a % b)",1,decision
+"def binary_search(arr, target): left, right = 0, len(arr) - 1; while left <= right: mid = (left + right) // 2; if arr[mid] == target: return mid; elif arr[mid] < target: left = mid + 1; else: right = mid - 1; return -1","def binary_search(arr, target): left, right = 0, len(arr) - 1; while left <= right: mid = (left + right) // 2; if arr[mid] != target: return mid; elif arr[mid] < target: left = mid + 1; else: right = mid - 1; return -1","def binary_search(arr, target): left, right = 0, len(arr) - 1; while left <= right: mid = (left + right) // 2; if arr[mid] != target: return mid; elif arr[mid] < target: left = mid + 1; else: right = mid - 1; return -1",1,decision
+"def power(x, n): return x * power(x, n-1) if n > 0 else 1","def power(x, n): return x * power(x, n-1) if n < 0 else 1","def power(x, n): return x * power(x, n-1) if n < 0 else 1",1,operation
+def is_even(n): return n % 2 == 0,def is_even(n): return n % 2 != 0,def is_even(n): return n % 2 != 0,1,decision
+"def binary_search(arr, target): left, right = 0, len(arr) - 1; while left <= right: mid = (left + right) // 2; if arr[mid] == target: return mid; elif arr[mid] < target: left = mid + 1; else: right = mid - 1; return -1","def binary_search(arr, target): left, right = 0, len(arr) - 1; while left <= right: mid = (left + right) // 2; if arr[mid] != target: return mid; elif arr[mid] < target: left = mid + 1; else: right = mid - 1; return -1","def binary_search(arr, target): left, right = 0, len(arr) - 1; while left <= right: mid = (left + right) // 2; if arr[mid] != target: return mid; elif arr[mid] < target: left = mid + 1; else: right = mid - 1; return -1",1,decision
+"def gcd(a, b): return a if b == 0 else gcd(b, a % b)","def gcd(a, b): return a if b != 0 else gcd(b, a % b)","def gcd(a, b): return a if b != 0 else gcd(b, a % b)",1,decision
+def is_palindrome(s): return s == s[::-1],def is_palindrome(s): return s != s[::-1],def is_palindrome(s): return s != s[::-1],1,decision
+def is_even(n): return n % 2 == 0,def is_even(n): return n % 2 != 0,def is_even(n): return n % 2 != 0,1,decision
+"def power(x, n): return x * power(x, n-1) if n > 0 else 1","def power(x, n): return x * power(x, n-1) if n < 0 else 1","def power(x, n): return x * power(x, n-1) if n < 0 else 1",1,operation
+def factorial(n): return n * factorial(n-1) if n > 1 else 1,def factorial(n): return n * factorial(n-1) if n < 1 else 1,def factorial(n): return n * factorial(n-1) if n < 1 else 1,1,operation
+def quick_sort(arr): if len(arr) <= 1: return arr; pivot = arr[len(arr) // 2]; left = [x for x in arr if x < pivot]; middle = [x for x in arr if x == pivot]; right = [x for x in arr if x > pivot]; return quick_sort(left) + middle + quick_sort(right),def quick_sort(arr): if len(arr) <= 1: return arr; pivot = arr[len(arr) // 2]; left = [x for x in arr if x < pivot]; middle = [x for x in arr if x != pivot]; right = [x for x in arr if x > pivot]; return quick_sort(left) + middle + quick_sort(right),def quick_sort(arr): if len(arr) <= 1: return arr; pivot = arr[len(arr) // 2]; left = [x for x in arr if x < pivot]; middle = [x for x in arr if x != pivot]; right = [x for x in arr if x > pivot]; return quick_sort(left) + middle + quick_sort(right),1,decision
+def is_even(n): return n % 2 == 0,def is_even(n): return n % 2 != 0,def is_even(n): return n % 2 != 0,1,decision
+def quick_sort(arr): if len(arr) <= 1: return arr; pivot = arr[len(arr) // 2]; left = [x for x in arr if x < pivot]; middle = [x for x in arr if x == pivot]; right = [x for x in arr if x > pivot]; return quick_sort(left) + middle + quick_sort(right),def quick_sort(arr): if len(arr) <= 1: return arr; pivot = arr[len(arr) // 2]; left = [x for x in arr if x < pivot]; middle = [x for x in arr if x != pivot]; right = [x for x in arr if x > pivot]; return quick_sort(left) + middle + quick_sort(right),def quick_sort(arr): if len(arr) <= 1: return arr; pivot = arr[len(arr) // 2]; left = [x for x in arr if x < pivot]; middle = [x for x in arr if x != pivot]; right = [x for x in arr if x > pivot]; return quick_sort(left) + middle + quick_sort(right),1,decision
+"def add(a, b): return a + b","def add(a, b): return a - b","def add(a, b): return a - b",1,operation
+def is_palindrome(s): return s == s[::-1],def is_palindrome(s): return s != s[::-1],def is_palindrome(s): return s != s[::-1],1,decision
+"def binary_search(arr, target): left, right = 0, len(arr) - 1; while left <= right: mid = (left + right) // 2; if arr[mid] == target: return mid; elif arr[mid] < target: left = mid + 1; else: right = mid - 1; return -1","def binary_search(arr, target): left, right = 0, len(arr) - 1; while left <= right: mid = (left + right) // 2; if arr[mid] != target: return mid; elif arr[mid] < target: left = mid + 1; else: right = mid - 1; return -1","def binary_search(arr, target): left, right = 0, len(arr) - 1; while left <= right: mid = (left + right) // 2; if arr[mid] != target: return mid; elif arr[mid] < target: left = mid + 1; else: right = mid - 1; return -1",1,decision
+def factorial(n): return n * factorial(n-1) if n > 1 else 1,def factorial(n): return n * factorial(n-1) if n < 1 else 1,def factorial(n): return n * factorial(n-1) if n < 1 else 1,1,operation
+"def add(a, b): return a + b","def add(a, b): return a - b","def add(a, b): return a - b",1,operation
+def fibonacci(n): return 1 if n <= 1 else fibonacci(n-1) + fibonacci(n-2),def fibonacci(n): return 1 if n >= 1 else fibonacci(n-1) + fibonacci(n-2),def fibonacci(n): return 1 if n >= 1 else fibonacci(n-1) + fibonacci(n-2),1,operation
+def fibonacci(n): return 1 if n <= 1 else fibonacci(n-1) + fibonacci(n-2),def fibonacci(n): return 1 if n >= 1 else fibonacci(n-1) + fibonacci(n-2),def fibonacci(n): return 1 if n >= 1 else fibonacci(n-1) + fibonacci(n-2),1,operation
+"def power(x, n): return x * power(x, n-1) if n > 0 else 1","def power(x, n): return x * power(x, n-1) if n < 0 else 1","def power(x, n): return x * power(x, n-1) if n < 0 else 1",1,operation
+"def binary_search(arr, target): left, right = 0, len(arr) - 1; while left <= right: mid = (left + right) // 2; if arr[mid] == target: return mid; elif arr[mid] < target: left = mid + 1; else: right = mid - 1; return -1","def binary_search(arr, target): left, right = 0, len(arr) - 1; while left <= right: mid = (left + right) // 2; if arr[mid] != target: return mid; elif arr[mid] < target: left = mid + 1; else: right = mid - 1; return -1","def binary_search(arr, target): left, right = 0, len(arr) - 1; while left <= right: mid = (left + right) // 2; if arr[mid] != target: return mid; elif arr[mid] < target: left = mid + 1; else: right = mid - 1; return -1",1,decision
+"def power(x, n): return x * power(x, n-1) if n > 0 else 1","def power(x, n): return x * power(x, n-1) if n < 0 else 1","def power(x, n): return x * power(x, n-1) if n < 0 else 1",1,operation
+"def power(x, n): return x * power(x, n-1) if n > 0 else 1","def power(x, n): return x * power(x, n-1) if n < 0 else 1","def power(x, n): return x * power(x, n-1) if n < 0 else 1",1,operation
+def fibonacci(n): return 1 if n <= 1 else fibonacci(n-1) + fibonacci(n-2),def fibonacci(n): return 1 if n >= 1 else fibonacci(n-1) + fibonacci(n-2),def fibonacci(n): return 1 if n >= 1 else fibonacci(n-1) + fibonacci(n-2),1,operation