0,C,1,0,L2,L2
1,T,def factorial(n): if n == 0: return 1 else: return n * factorial(n-1),0,階乗計算 (再帰),py_factorial_recursive
2,T,def fibonacci(n): a, b = 0, 1; for _ in range(n): print(a); a, b = b, a + b,0,フィボナッチ数列,py_fibonacci
3,T,def is_prime(n): if n < 2: return False; for i in range(2, int(n**0.5) + 1): if n % i == 0: return False; return True,0,素数判定,py_is_prime
4,T,def merge_sort(arr): if len(arr) <= 1: return arr; mid = len(arr) // 2; left = arr[:mid]; right = arr[mid:]; return merge(merge_sort(left), merge_sort(right)),0,マージソート (定義のみ),py_merge_sort_def
5,T,def binary_search(arr, target): low, high = 0, len(arr) - 1; while low <= high: mid = (low + high) // 2; if arr[mid] == target: return mid; elif arr[mid] < target: low = mid + 1; else: high = mid - 1; return -1,0,二分探索 (定義のみ),py_binary_search_def