original_code
stringclasses 9
values | modified_code
stringclasses 9
values | changed_line
stringclasses 9
values | line_number
int64 1
1
| mutation_type
stringclasses 2
values |
|---|---|---|---|---|
def binary_search(arr, target): left, right = 0, len(arr) - 1; while left <= 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
|
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.