submission_id
int32 10
42.5k
| func_code
stringlengths 22
782
| assignment_id
stringlengths 4
23
| func_name
stringlengths 4
23
| description
stringlengths 26
128
| test
stringlengths 45
1.22k
| correct
bool 2
classes | user
stringlengths 36
36
| academic_year
int32 2.02k
2.02k
|
|---|---|---|---|---|---|---|---|---|
9,266 | def reverse_list(list_1):
return list_1[::-1] | reverse_recur | reverse_list | Recursively reverse a list of elements. | assert reverse_list([])==[] and reverse_list([0])==[0] and reverse_list([9650, 12103, -1947378123, -109345868112896702250879906349988323457, 85, -74, -10050, 787, -3])==[-3, 787, -10050, -74, 85, -109345868112896702250879906349988323457, -1947378123, 12103, 9650] and reverse_list([9650, 12103, -1947378123, -109345868112896702250879906349988323457])==[-109345868112896702250879906349988323457, -1947378123, 12103, 9650] and reverse_list([0, 0])==[0, 0] and reverse_list([85, -74, -10050, 787, 9650, 12103, -1947378123, -109345868112896702250879906349988323457, -3])==[-3, -109345868112896702250879906349988323457, -1947378123, 12103, 9650, 787, -10050, -74, 85] and reverse_list([85, -74, -10050, 787, -3, 9650, 12103, -1947378123, -109345868112896702250879906349988323457])==[-109345868112896702250879906349988323457, -1947378123, 12103, 9650, -3, 787, -10050, -74, 85] | true | 7a72123c-6850-4e9f-b407-211283f04a4c | 2,016 |
18,477 | def reverse_list(list_1):
return list_1[::-1] | reverse_recur | reverse_list | Recursively reverse a list of elements. | assert reverse_list([])==[] and reverse_list([0])==[0] and reverse_list([9650, 12103, -1947378123, -109345868112896702250879906349988323457, 85, -74, -10050, 787, -3])==[-3, 787, -10050, -74, 85, -109345868112896702250879906349988323457, -1947378123, 12103, 9650] and reverse_list([9650, 12103, -1947378123, -109345868112896702250879906349988323457])==[-109345868112896702250879906349988323457, -1947378123, 12103, 9650] and reverse_list([0, 0])==[0, 0] and reverse_list([85, -74, -10050, 787, 9650, 12103, -1947378123, -109345868112896702250879906349988323457, -3])==[-3, -109345868112896702250879906349988323457, -1947378123, 12103, 9650, 787, -10050, -74, 85] and reverse_list([85, -74, -10050, 787, -3, 9650, 12103, -1947378123, -109345868112896702250879906349988323457])==[-109345868112896702250879906349988323457, -1947378123, 12103, 9650, -3, 787, -10050, -74, 85] | true | 7a72123c-6850-4e9f-b407-211283f04a4c | 2,016 |
27,762 | def fibonacci(n):
if n == 1 or n == 0:
return 1
return fibonacci(n - 1) + fibonacci(n - 2) | fibonacci_recur | fibonacci | Recursively compute the value of the fibonacci series at position n. | assert fibonacci(0)==0 and fibonacci(1)==1 and fibonacci(2)==1 and fibonacci(10)==55 and fibonacci(23)==28657 | false | 6cbd9686-8a3c-4d12-8a1a-70c661732027 | 2,016 |
12,322 | def fibonacci(n):
if n == 1 or n == 0:
return 1
return fibonacci(n - 1) + fibonacci(n - 2) | fibonacci_recur | fibonacci | Recursively compute the value of the fibonacci series at position n. | assert fibonacci(0)==0 and fibonacci(1)==1 and fibonacci(2)==1 and fibonacci(10)==55 and fibonacci(23)==28657 | false | 6cbd9686-8a3c-4d12-8a1a-70c661732027 | 2,016 |
6,358 | def partition(A, p, r):
q = j = p
while j < r:
if A[j] <= A[r]:
A[q], A[j] = A[j], A[q]
q += 1
j += 1
A[q], A[r] = A[r], A[q]
return q
def quicksort(A, p, r):
if r <= p:
return
q = partition(A, p, r)
quicksort(A, p, q - 1)
quicksort(A, q + 1, r) | quicksort | quicksort | Sort a list by recursively partitionioning list until sorted. | assert quicksort([],0,0)==None and quicksort([],0,0)==None and quicksort([5, 4, 3, 2, 1],0,4)==None and quicksort([5, 4, 3, 2, 1],0,4)==None and quicksort([5, 5, 5, 5],0,3)==None and quicksort([5, 5, 5, 5],0,3)==None and quicksort([5675, 564, 987, 154132, 8976, 0, -16221, 87526, 9826732986],0,8)==None and quicksort([5675, 564, 987, 154132, 8976, 0, -16221, 87526, 9826732986],0,8)==None | true | 6cbd9686-8a3c-4d12-8a1a-70c661732027 | 2,016 |
30,635 | def partition(A, p, r):
q = j = p
while j < r:
if A[j] <= A[r]:
A[q], A[j] = A[j], A[q]
q += 1
j += 1
A[q], A[r] = A[r], A[q]
return q
def quicksort(A, p, r):
if r <= p:
return
q = partition(A, p, r)
quicksort(A, p, q - 1)
quicksort(A, q + 1, r) | quicksort | quicksort | Sort a list by recursively partitionioning list until sorted. | assert quicksort([],0,0)==None and quicksort([],0,0)==None and quicksort([5, 4, 3, 2, 1],0,4)==None and quicksort([5, 4, 3, 2, 1],0,4)==None and quicksort([5, 5, 5, 5],0,3)==None and quicksort([5, 5, 5, 5],0,3)==None and quicksort([5675, 564, 987, 154132, 8976, 0, -16221, 87526, 9826732986],0,8)==None and quicksort([5675, 564, 987, 154132, 8976, 0, -16221, 87526, 9826732986],0,8)==None | true | 6cbd9686-8a3c-4d12-8a1a-70c661732027 | 2,016 |
34,143 | def fibonacci(pos):
import sys
prev = 0
curr = 1
i = 0
if pos == 0:
return 1
else:
while i < pos + 1:
curr = prev + curr
prev = curr - prev
i = i + 1
return prev | fibonacci_recur | fibonacci | Recursively compute the value of the fibonacci series at position n. | assert fibonacci(0)==0 and fibonacci(1)==1 and fibonacci(2)==1 and fibonacci(10)==55 and fibonacci(23)==28657 | false | 7a72123c-6850-4e9f-b407-211283f04a4c | 2,016 |
3,055 | def fibonacci(pos):
import sys
prev = 0
curr = 1
i = 0
if pos == 0:
return 1
else:
while i < pos + 1:
curr = prev + curr
prev = curr - prev
i = i + 1
return prev | fibonacci_recur | fibonacci | Recursively compute the value of the fibonacci series at position n. | assert fibonacci(0)==0 and fibonacci(1)==1 and fibonacci(2)==1 and fibonacci(10)==55 and fibonacci(23)==28657 | false | 7a72123c-6850-4e9f-b407-211283f04a4c | 2,016 |
24,680 | def selectionsort(a):
i = 0
while i < len(a):
p = i
j = i + 1
while j < len(a):
if a[j] < a[p]:
p = j
j += 1
tmp = a[p]
a[p] = a[i]
a[i] = tmp
i += 1 | selectionsort | selectionsort | Sort a list by repeatedly move minimimum of remaining sublist to front. | assert selectionsort([])==None and selectionsort([])==None and selectionsort([0])==None and selectionsort([0])==None | true | 6cbd9686-8a3c-4d12-8a1a-70c661732027 | 2,016 |
28,541 | def selectionsort(a):
i = 0
while i < len(a):
p = i
j = i + 1
while j < len(a):
if a[j] < a[p]:
p = j
j += 1
tmp = a[p]
a[p] = a[i]
a[i] = tmp
i += 1 | selectionsort | selectionsort | Sort a list by repeatedly move minimimum of remaining sublist to front. | assert selectionsort([])==None and selectionsort([])==None and selectionsort([0])==None and selectionsort([0])==None | true | 6cbd9686-8a3c-4d12-8a1a-70c661732027 | 2,016 |
11,289 | def selectionsort(a):
i = 0
while i < len(a):
p = i
j = i + 1
while j < len(a):
if a[j] < a[p]:
p = j
j += 1
tmp = a[p]
a[p] = a[i]
a[i] = tmp
i += 1 | selectionsort | selectionsort | Sort a list by repeatedly move minimimum of remaining sublist to front. | assert selectionsort([])==None and selectionsort([])==None and selectionsort([0])==None and selectionsort([0])==None | true | 6cbd9686-8a3c-4d12-8a1a-70c661732027 | 2,016 |
35,415 | def partition(a, p, r):
q = j = p
while j < r:
if a[j] < a[r]:
a[q], a[j] = a[j], a[q]
q += 1
j += 1
a[q], a[r] = a[r], a[q]
return q
def quicksort(A, p, r):
if r <= p:
return
q = partition(A, p, r)
quicksort(A, p, q - 1)
quicksort(A, q + 1, r) | quicksort | quicksort | Sort a list by recursively partitionioning list until sorted. | assert quicksort([],0,0)==None and quicksort([],0,0)==None and quicksort([5, 4, 3, 2, 1],0,4)==None and quicksort([5, 4, 3, 2, 1],0,4)==None and quicksort([5, 5, 5, 5],0,3)==None and quicksort([5, 5, 5, 5],0,3)==None and quicksort([5675, 564, 987, 154132, 8976, 0, -16221, 87526, 9826732986],0,8)==None and quicksort([5675, 564, 987, 154132, 8976, 0, -16221, 87526, 9826732986],0,8)==None | true | 1a650795-f8bf-47db-90f0-c896555da6d7 | 2,016 |
32,784 | def partition(a, p, r):
q = j = p
while j < r:
if a[j] < a[r]:
a[q], a[j] = a[j], a[q]
q += 1
j += 1
a[q], a[r] = a[r], a[q]
return q
def quicksort(A, p, r):
if r <= p:
return
q = partition(A, p, r)
quicksort(A, p, q - 1)
quicksort(A, q + 1, r) | quicksort | quicksort | Sort a list by recursively partitionioning list until sorted. | assert quicksort([],0,0)==None and quicksort([],0,0)==None and quicksort([5, 4, 3, 2, 1],0,4)==None and quicksort([5, 4, 3, 2, 1],0,4)==None and quicksort([5, 5, 5, 5],0,3)==None and quicksort([5, 5, 5, 5],0,3)==None and quicksort([5675, 564, 987, 154132, 8976, 0, -16221, 87526, 9826732986],0,8)==None and quicksort([5675, 564, 987, 154132, 8976, 0, -16221, 87526, 9826732986],0,8)==None | true | 1a650795-f8bf-47db-90f0-c896555da6d7 | 2,016 |
22,432 | def fibonacci(n):
if n == 0 or n == 1:
return 1
return fibonacci(n - 1) + fibonacci(n - 2) | fibonacci_recur | fibonacci | Recursively compute the value of the fibonacci series at position n. | assert fibonacci(0)==0 and fibonacci(1)==1 and fibonacci(2)==1 and fibonacci(10)==55 and fibonacci(23)==28657 | false | 1a650795-f8bf-47db-90f0-c896555da6d7 | 2,016 |
32,581 | def fibonacci(n):
if n == 0 or n == 1:
return 1
return fibonacci(n - 1) + fibonacci(n - 2) | fibonacci_recur | fibonacci | Recursively compute the value of the fibonacci series at position n. | assert fibonacci(0)==0 and fibonacci(1)==1 and fibonacci(2)==1 and fibonacci(10)==55 and fibonacci(23)==28657 | false | 1a650795-f8bf-47db-90f0-c896555da6d7 | 2,016 |
33,363 | def power(n, m):
if m == 0:
return 1
else:
return n * power(n, m - 1) | power | power | Raise m to the power of n. | assert power(0,0)==1 and power(62,4)==14776336 and power(-14012,0)==1 | true | 9675c8b9-337a-4fd1-bb8f-8e3510c7f703 | 2,016 |
14,489 | def power(n, m):
if m == 0:
return 1
else:
return n * power(n, m - 1) | power | power | Raise m to the power of n. | assert power(0,0)==1 and power(62,4)==14776336 and power(-14012,0)==1 | true | 9675c8b9-337a-4fd1-bb8f-8e3510c7f703 | 2,016 |
42,311 | def partition(A, p, r):
q = j = p
while j < r:
if A[j] <= A[r]:
A[q], A[j] = A[j], A[q]
q += 1
j += 1
A[q], A[r] = A[r], A[q]
return q
def quicksort(A, p, r):
if r <= p:
return
q = partition(A, p, r)
quicksort(A, p, q - 1)
quicksort(A, q + 1, r) | quicksort | quicksort | Sort a list by recursively partitionioning list until sorted. | assert quicksort([],0,0)==None and quicksort([],0,0)==None and quicksort([5, 4, 3, 2, 1],0,4)==None and quicksort([5, 4, 3, 2, 1],0,4)==None and quicksort([5, 5, 5, 5],0,3)==None and quicksort([5, 5, 5, 5],0,3)==None and quicksort([5675, 564, 987, 154132, 8976, 0, -16221, 87526, 9826732986],0,8)==None and quicksort([5675, 564, 987, 154132, 8976, 0, -16221, 87526, 9826732986],0,8)==None | true | 7a72123c-6850-4e9f-b407-211283f04a4c | 2,016 |
19,546 | def partition(A, p, r):
q = j = p
while j < r:
if A[j] <= A[r]:
A[q], A[j] = A[j], A[q]
q += 1
j += 1
A[q], A[r] = A[r], A[q]
return q
def quicksort(A, p, r):
if r <= p:
return
q = partition(A, p, r)
quicksort(A, p, q - 1)
quicksort(A, q + 1, r) | quicksort | quicksort | Sort a list by recursively partitionioning list until sorted. | assert quicksort([],0,0)==None and quicksort([],0,0)==None and quicksort([5, 4, 3, 2, 1],0,4)==None and quicksort([5, 4, 3, 2, 1],0,4)==None and quicksort([5, 5, 5, 5],0,3)==None and quicksort([5, 5, 5, 5],0,3)==None and quicksort([5675, 564, 987, 154132, 8976, 0, -16221, 87526, 9826732986],0,8)==None and quicksort([5675, 564, 987, 154132, 8976, 0, -16221, 87526, 9826732986],0,8)==None | true | 7a72123c-6850-4e9f-b407-211283f04a4c | 2,016 |
8,993 | def minimum(m):
if len(m) == 1:
return m[0]
else:
a = m.pop()
b = m.pop()
if a < b:
m.append(a)
else:
m.append(b)
return minimum(m) | minimum | minimum | Return the minimum element in a list of numbers. | assert minimum([0])==0 and minimum([2, 10, 23, 9, 187])==2 and minimum([-2, -26, 7, -123, -1236521])==-1236521 and minimum([3896, 3673, 45, 16715, 23673])==45 | true | 9675c8b9-337a-4fd1-bb8f-8e3510c7f703 | 2,016 |
40,725 | def minimum(m):
if len(m) == 1:
return m[0]
else:
a = m.pop()
b = m.pop()
if a < b:
m.append(a)
else:
m.append(b)
return minimum(m) | minimum | minimum | Return the minimum element in a list of numbers. | assert minimum([0])==0 and minimum([2, 10, 23, 9, 187])==2 and minimum([-2, -26, 7, -123, -1236521])==-1236521 and minimum([3896, 3673, 45, 16715, 23673])==45 | true | 9675c8b9-337a-4fd1-bb8f-8e3510c7f703 | 2,016 |
10,185 | def maximum(m):
if len(m) == 1:
return m[0]
else:
a = m.pop()
b = m.pop()
if a > b:
m.append(a)
else:
m.append(b)
return maximum(m) | maximum | maximum | Return the maximum element in a list of numbers. | assert maximum([0])==0 and maximum([67, 1, 2, -2, 0])==67 and maximum([0, -2, 2, 1, 67])==67 and maximum([-10, -23, -45, -9, -45617])==-9 | true | 9675c8b9-337a-4fd1-bb8f-8e3510c7f703 | 2,016 |
325 | def maximum(m):
if len(m) == 1:
return m[0]
else:
a = m.pop()
b = m.pop()
if a > b:
m.append(a)
else:
m.append(b)
return maximum(m) | maximum | maximum | Return the maximum element in a list of numbers. | assert maximum([0])==0 and maximum([67, 1, 2, -2, 0])==67 and maximum([0, -2, 2, 1, 67])==67 and maximum([-10, -23, -45, -9, -45617])==-9 | true | 9675c8b9-337a-4fd1-bb8f-8e3510c7f703 | 2,016 |
10,622 | def reverse_list(m):
if len(m) == 1:
return m
else:
return [m.pop()] + reverse_list(m) | reverse_recur | reverse_list | Recursively reverse a list of elements. | assert reverse_list([])==[] and reverse_list([0])==[0] and reverse_list([9650, 12103, -1947378123, -109345868112896702250879906349988323457, 85, -74, -10050, 787, -3])==[-3, 787, -10050, -74, 85, -109345868112896702250879906349988323457, -1947378123, 12103, 9650] and reverse_list([9650, 12103, -1947378123, -109345868112896702250879906349988323457])==[-109345868112896702250879906349988323457, -1947378123, 12103, 9650] and reverse_list([0, 0])==[0, 0] and reverse_list([85, -74, -10050, 787, 9650, 12103, -1947378123, -109345868112896702250879906349988323457, -3])==[-3, -109345868112896702250879906349988323457, -1947378123, 12103, 9650, 787, -10050, -74, 85] and reverse_list([85, -74, -10050, 787, -3, 9650, 12103, -1947378123, -109345868112896702250879906349988323457])==[-109345868112896702250879906349988323457, -1947378123, 12103, 9650, -3, 787, -10050, -74, 85] | false | 9675c8b9-337a-4fd1-bb8f-8e3510c7f703 | 2,016 |
15,920 | def reverse_list(m):
if len(m) == 0:
return m
else:
return [m.pop()] + reverse_list(m) | reverse_recur | reverse_list | Recursively reverse a list of elements. | assert reverse_list([])==[] and reverse_list([0])==[0] and reverse_list([9650, 12103, -1947378123, -109345868112896702250879906349988323457, 85, -74, -10050, 787, -3])==[-3, 787, -10050, -74, 85, -109345868112896702250879906349988323457, -1947378123, 12103, 9650] and reverse_list([9650, 12103, -1947378123, -109345868112896702250879906349988323457])==[-109345868112896702250879906349988323457, -1947378123, 12103, 9650] and reverse_list([0, 0])==[0, 0] and reverse_list([85, -74, -10050, 787, 9650, 12103, -1947378123, -109345868112896702250879906349988323457, -3])==[-3, -109345868112896702250879906349988323457, -1947378123, 12103, 9650, 787, -10050, -74, 85] and reverse_list([85, -74, -10050, 787, -3, 9650, 12103, -1947378123, -109345868112896702250879906349988323457])==[-109345868112896702250879906349988323457, -1947378123, 12103, 9650, -3, 787, -10050, -74, 85] | true | 9675c8b9-337a-4fd1-bb8f-8e3510c7f703 | 2,016 |
8,472 | def reverse_list(m):
if len(m) == 0:
return m
else:
return [m.pop()] + reverse_list(m) | reverse_recur | reverse_list | Recursively reverse a list of elements. | assert reverse_list([])==[] and reverse_list([0])==[0] and reverse_list([9650, 12103, -1947378123, -109345868112896702250879906349988323457, 85, -74, -10050, 787, -3])==[-3, 787, -10050, -74, 85, -109345868112896702250879906349988323457, -1947378123, 12103, 9650] and reverse_list([9650, 12103, -1947378123, -109345868112896702250879906349988323457])==[-109345868112896702250879906349988323457, -1947378123, 12103, 9650] and reverse_list([0, 0])==[0, 0] and reverse_list([85, -74, -10050, 787, 9650, 12103, -1947378123, -109345868112896702250879906349988323457, -3])==[-3, -109345868112896702250879906349988323457, -1947378123, 12103, 9650, 787, -10050, -74, 85] and reverse_list([85, -74, -10050, 787, -3, 9650, 12103, -1947378123, -109345868112896702250879906349988323457])==[-109345868112896702250879906349988323457, -1947378123, 12103, 9650, -3, 787, -10050, -74, 85] | true | 9675c8b9-337a-4fd1-bb8f-8e3510c7f703 | 2,016 |
37,101 | def reverse_list(m):
if len(m) == 0:
return m
else:
return [m.pop()] + reverse_list(m) | reverse_recur | reverse_list | Recursively reverse a list of elements. | assert reverse_list([])==[] and reverse_list([0])==[0] and reverse_list([9650, 12103, -1947378123, -109345868112896702250879906349988323457, 85, -74, -10050, 787, -3])==[-3, 787, -10050, -74, 85, -109345868112896702250879906349988323457, -1947378123, 12103, 9650] and reverse_list([9650, 12103, -1947378123, -109345868112896702250879906349988323457])==[-109345868112896702250879906349988323457, -1947378123, 12103, 9650] and reverse_list([0, 0])==[0, 0] and reverse_list([85, -74, -10050, 787, 9650, 12103, -1947378123, -109345868112896702250879906349988323457, -3])==[-3, -109345868112896702250879906349988323457, -1947378123, 12103, 9650, 787, -10050, -74, 85] and reverse_list([85, -74, -10050, 787, -3, 9650, 12103, -1947378123, -109345868112896702250879906349988323457])==[-109345868112896702250879906349988323457, -1947378123, 12103, 9650, -3, 787, -10050, -74, 85] | true | 9675c8b9-337a-4fd1-bb8f-8e3510c7f703 | 2,016 |
17,708 | def selectionsort(n):
i = 0
while i < len(n):
position = i
j = i + 1
while j < len(n):
if n[j] < n[position]:
position = j
j = j + 1
val = n[position]
n[position] = n[i]
n[i] = val
i = i + 1 | selectionsort | selectionsort | Sort a list by repeatedly move minimimum of remaining sublist to front. | assert selectionsort([])==None and selectionsort([])==None and selectionsort([0])==None and selectionsort([0])==None | true | 7a72123c-6850-4e9f-b407-211283f04a4c | 2,016 |
31,396 | def selectionsort(n):
i = 0
while i < len(n):
position = i
j = i + 1
while j < len(n):
if n[j] < n[position]:
position = j
j = j + 1
val = n[position]
n[position] = n[i]
n[i] = val
i = i + 1 | selectionsort | selectionsort | Sort a list by repeatedly move minimimum of remaining sublist to front. | assert selectionsort([])==None and selectionsort([])==None and selectionsort([0])==None and selectionsort([0])==None | true | 7a72123c-6850-4e9f-b407-211283f04a4c | 2,016 |
39,677 | def selectionsort(n):
i = 0
while i < len(n):
position = i
j = i + 1
while j < len(n):
if n[j] < n[position]:
position = j
j = j + 1
val = n[position]
n[position] = n[i]
n[i] = val
i = i + 1 | selectionsort | selectionsort | Sort a list by repeatedly move minimimum of remaining sublist to front. | assert selectionsort([])==None and selectionsort([])==None and selectionsort([0])==None and selectionsort([0])==None | true | 7a72123c-6850-4e9f-b407-211283f04a4c | 2,016 |
10,984 | def power(a, b):
if b == 0:
return 1
return a * power(a, b - 1) | power | power | Raise m to the power of n. | assert power(0,0)==1 and power(62,4)==14776336 and power(-14012,0)==1 | true | 712c50ed-0c17-44f1-a863-183f2d9a5e14 | 2,016 |
34,172 | def power(a, b):
if b == 0:
return 1
return a * power(a, b - 1) | power | power | Raise m to the power of n. | assert power(0,0)==1 and power(62,4)==14776336 and power(-14012,0)==1 | true | 712c50ed-0c17-44f1-a863-183f2d9a5e14 | 2,016 |
25,889 | def minimum(value):
if len(value) == 1:
return value[0]
if value[0] < value[1]:
value.remove(value[1])
return minimum(value)
else:
value.remove(value[0])
return minimum(value) | minimum | minimum | Return the minimum element in a list of numbers. | assert minimum([0])==0 and minimum([2, 10, 23, 9, 187])==2 and minimum([-2, -26, 7, -123, -1236521])==-1236521 and minimum([3896, 3673, 45, 16715, 23673])==45 | true | 712c50ed-0c17-44f1-a863-183f2d9a5e14 | 2,016 |
7,384 | def minimum(value):
if len(value) == 1:
return value[0]
if value[0] < value[1]:
value.remove(value[1])
return minimum(value)
else:
value.remove(value[0])
return minimum(value) | minimum | minimum | Return the minimum element in a list of numbers. | assert minimum([0])==0 and minimum([2, 10, 23, 9, 187])==2 and minimum([-2, -26, 7, -123, -1236521])==-1236521 and minimum([3896, 3673, 45, 16715, 23673])==45 | true | 712c50ed-0c17-44f1-a863-183f2d9a5e14 | 2,016 |
897 | def minimum(value):
if len(value) == 1:
return value[0]
if value[0] < value[1]:
value.remove(value[1])
return minimum(value)
else:
value.remove(value[0])
return minimum(value) | minimum | minimum | Return the minimum element in a list of numbers. | assert minimum([0])==0 and minimum([2, 10, 23, 9, 187])==2 and minimum([-2, -26, 7, -123, -1236521])==-1236521 and minimum([3896, 3673, 45, 16715, 23673])==45 | true | 712c50ed-0c17-44f1-a863-183f2d9a5e14 | 2,016 |
5,849 | def maximum(number):
if len(number) == 1:
return number[0]
if number[0] > number[1]:
number.remove(number[1])
return maximum(number)
else:
number.remove(number[0])
return maximum(number) | maximum | maximum | Return the maximum element in a list of numbers. | assert maximum([0])==0 and maximum([67, 1, 2, -2, 0])==67 and maximum([0, -2, 2, 1, 67])==67 and maximum([-10, -23, -45, -9, -45617])==-9 | true | 712c50ed-0c17-44f1-a863-183f2d9a5e14 | 2,016 |
4,595 | def maximum(number):
if len(number) == 1:
return number[0]
if number[0] > number[1]:
number.remove(number[1])
return maximum(number)
else:
number.remove(number[0])
return maximum(number) | maximum | maximum | Return the maximum element in a list of numbers. | assert maximum([0])==0 and maximum([67, 1, 2, -2, 0])==67 and maximum([0, -2, 2, 1, 67])==67 and maximum([-10, -23, -45, -9, -45617])==-9 | true | 712c50ed-0c17-44f1-a863-183f2d9a5e14 | 2,016 |
15,422 | def count_letters(s):
number = 0
if not s:
return 0
else:
number += 1
return number + count_letters(s[1:]) | count_letters | count_letters | Return the number of lettres in a string. | assert count_letters('')==0 and count_letters('0')==1 and count_letters('##')==2 and count_letters('t')==1 and count_letters('fqfseqfseqsse')==13 | true | 712c50ed-0c17-44f1-a863-183f2d9a5e14 | 2,016 |
37,277 | def count_letters(s):
number = 0
if not s:
return 0
else:
number += 1
return number + count_letters(s[1:]) | count_letters | count_letters | Return the number of lettres in a string. | assert count_letters('')==0 and count_letters('0')==1 and count_letters('##')==2 and count_letters('t')==1 and count_letters('fqfseqfseqsse')==13 | true | 712c50ed-0c17-44f1-a863-183f2d9a5e14 | 2,016 |
41,057 | def quicksort(a, p, r):
if r <= p:
return
q = partition(a, p, r)
quicksort(a, p, q - 1)
quicksort(a, q + 1, r)
def minimum(a):
quicksort(a, 0, len(a) - 1)
return a[0] | minimum | minimum | Return the minimum element in a list of numbers. | assert minimum([0])==0 and minimum([2, 10, 23, 9, 187])==2 and minimum([-2, -26, 7, -123, -1236521])==-1236521 and minimum([3896, 3673, 45, 16715, 23673])==45 | false | 41c113b8-6f57-4003-bed3-3587b2376170 | 2,016 |
3,249 | def quicksort(a, p, r):
if r <= p:
return
q = partition(a, p, r)
quicksort(a, p, q - 1)
quicksort(a, q + 1, r)
def minimum(a):
quicksort(a, 0, len(a) - 1)
return a[0] | minimum | minimum | Return the minimum element in a list of numbers. | assert minimum([0])==0 and minimum([2, 10, 23, 9, 187])==2 and minimum([-2, -26, 7, -123, -1236521])==-1236521 and minimum([3896, 3673, 45, 16715, 23673])==45 | false | 41c113b8-6f57-4003-bed3-3587b2376170 | 2,016 |
41,175 | def reverse_list(value):
if len(value) == 0:
return []
return [value[-1]] + reverse_list(value[:-1]) | reverse_recur | reverse_list | Recursively reverse a list of elements. | assert reverse_list([])==[] and reverse_list([0])==[0] and reverse_list([9650, 12103, -1947378123, -109345868112896702250879906349988323457, 85, -74, -10050, 787, -3])==[-3, 787, -10050, -74, 85, -109345868112896702250879906349988323457, -1947378123, 12103, 9650] and reverse_list([9650, 12103, -1947378123, -109345868112896702250879906349988323457])==[-109345868112896702250879906349988323457, -1947378123, 12103, 9650] and reverse_list([0, 0])==[0, 0] and reverse_list([85, -74, -10050, 787, 9650, 12103, -1947378123, -109345868112896702250879906349988323457, -3])==[-3, -109345868112896702250879906349988323457, -1947378123, 12103, 9650, 787, -10050, -74, 85] and reverse_list([85, -74, -10050, 787, -3, 9650, 12103, -1947378123, -109345868112896702250879906349988323457])==[-109345868112896702250879906349988323457, -1947378123, 12103, 9650, -3, 787, -10050, -74, 85] | true | 712c50ed-0c17-44f1-a863-183f2d9a5e14 | 2,016 |
25,872 | def reverse_list(value):
if len(value) == 0:
return []
return [value[-1]] + reverse_list(value[:-1]) | reverse_recur | reverse_list | Recursively reverse a list of elements. | assert reverse_list([])==[] and reverse_list([0])==[0] and reverse_list([9650, 12103, -1947378123, -109345868112896702250879906349988323457, 85, -74, -10050, 787, -3])==[-3, 787, -10050, -74, 85, -109345868112896702250879906349988323457, -1947378123, 12103, 9650] and reverse_list([9650, 12103, -1947378123, -109345868112896702250879906349988323457])==[-109345868112896702250879906349988323457, -1947378123, 12103, 9650] and reverse_list([0, 0])==[0, 0] and reverse_list([85, -74, -10050, 787, 9650, 12103, -1947378123, -109345868112896702250879906349988323457, -3])==[-3, -109345868112896702250879906349988323457, -1947378123, 12103, 9650, 787, -10050, -74, 85] and reverse_list([85, -74, -10050, 787, -3, 9650, 12103, -1947378123, -109345868112896702250879906349988323457])==[-109345868112896702250879906349988323457, -1947378123, 12103, 9650, -3, 787, -10050, -74, 85] | true | 712c50ed-0c17-44f1-a863-183f2d9a5e14 | 2,016 |
24,175 | def quicksort(a, p, r):
if r <= p:
return
q = partition(a, p, r)
quicksort(a, p, q - 1)
quicksort(a, q + 1, r)
def maximum(a):
quicksort(a, 0, len(a) - 1)
return a[-1] | maximum | maximum | Return the maximum element in a list of numbers. | assert maximum([0])==0 and maximum([67, 1, 2, -2, 0])==67 and maximum([0, -2, 2, 1, 67])==67 and maximum([-10, -23, -45, -9, -45617])==-9 | false | 41c113b8-6f57-4003-bed3-3587b2376170 | 2,016 |
13,521 | def quicksort(a, p, r):
if r <= p:
return
q = partition(a, p, r)
quicksort(a, p, q - 1)
quicksort(a, q + 1, r)
def maximum(a):
quicksort(a, 0, len(a) - 1)
return a[-1] | maximum | maximum | Return the maximum element in a list of numbers. | assert maximum([0])==0 and maximum([67, 1, 2, -2, 0])==67 and maximum([0, -2, 2, 1, 67])==67 and maximum([-10, -23, -45, -9, -45617])==-9 | false | 41c113b8-6f57-4003-bed3-3587b2376170 | 2,016 |
32,110 | def count_letters(s):
if s == '':
return 0
return count_letters(s[:-1]) + 1 | count_letters | count_letters | Return the number of lettres in a string. | assert count_letters('')==0 and count_letters('0')==1 and count_letters('##')==2 and count_letters('t')==1 and count_letters('fqfseqfseqsse')==13 | true | 41c113b8-6f57-4003-bed3-3587b2376170 | 2,016 |
20,652 | def count_letters(s):
if s == '':
return 0
return count_letters(s[:-1]) + 1 | count_letters | count_letters | Return the number of lettres in a string. | assert count_letters('')==0 and count_letters('0')==1 and count_letters('##')==2 and count_letters('t')==1 and count_letters('fqfseqfseqsse')==13 | true | 41c113b8-6f57-4003-bed3-3587b2376170 | 2,016 |
33,592 | def fibonacci(value):
if value == 1 or value == 0:
return 1
return fibonacci(value - 1) + fibonacci(value - 2) | fibonacci_recur | fibonacci | Recursively compute the value of the fibonacci series at position n. | assert fibonacci(0)==0 and fibonacci(1)==1 and fibonacci(2)==1 and fibonacci(10)==55 and fibonacci(23)==28657 | false | 712c50ed-0c17-44f1-a863-183f2d9a5e14 | 2,016 |
30,612 | def fibonacci(value):
if value == 1 or value == 0:
return 1
return fibonacci(value - 1) + fibonacci(value - 2) | fibonacci_recur | fibonacci | Recursively compute the value of the fibonacci series at position n. | assert fibonacci(0)==0 and fibonacci(1)==1 and fibonacci(2)==1 and fibonacci(10)==55 and fibonacci(23)==28657 | false | 712c50ed-0c17-44f1-a863-183f2d9a5e14 | 2,016 |
4,928 | def sort(A, p, r):
q = j = p
while j < r:
if A[j] <= A[r]:
A[q], A[j] = A[j], A[q]
q += 1
j += 1
A[q], A[r] = A[r], A[q]
return q
def quicksort(A, p, r):
if r <= p:
return
q = sort(A, p, r)
quicksort(A, p, q - 1)
quicksort(A, q + 1, r) | quicksort | quicksort | Sort a list by recursively partitionioning list until sorted. | assert quicksort([],0,0)==None and quicksort([],0,0)==None and quicksort([5, 4, 3, 2, 1],0,4)==None and quicksort([5, 4, 3, 2, 1],0,4)==None and quicksort([5, 5, 5, 5],0,3)==None and quicksort([5, 5, 5, 5],0,3)==None and quicksort([5675, 564, 987, 154132, 8976, 0, -16221, 87526, 9826732986],0,8)==None and quicksort([5675, 564, 987, 154132, 8976, 0, -16221, 87526, 9826732986],0,8)==None | true | 712c50ed-0c17-44f1-a863-183f2d9a5e14 | 2,016 |
22,355 | def sort(A, p, r):
q = j = p
while j < r:
if A[j] <= A[r]:
A[q], A[j] = A[j], A[q]
q += 1
j += 1
A[q], A[r] = A[r], A[q]
return q
def quicksort(A, p, r):
if r <= p:
return
q = sort(A, p, r)
quicksort(A, p, q - 1)
quicksort(A, q + 1, r) | quicksort | quicksort | Sort a list by recursively partitionioning list until sorted. | assert quicksort([],0,0)==None and quicksort([],0,0)==None and quicksort([5, 4, 3, 2, 1],0,4)==None and quicksort([5, 4, 3, 2, 1],0,4)==None and quicksort([5, 5, 5, 5],0,3)==None and quicksort([5, 5, 5, 5],0,3)==None and quicksort([5675, 564, 987, 154132, 8976, 0, -16221, 87526, 9826732986],0,8)==None and quicksort([5675, 564, 987, 154132, 8976, 0, -16221, 87526, 9826732986],0,8)==None | true | 712c50ed-0c17-44f1-a863-183f2d9a5e14 | 2,016 |
4,118 | def sort(A, p, r):
q = j = p
while j < r:
if A[j] <= A[r]:
A[q], A[j] = A[j], A[q]
q += 1
j += 1
A[q], A[r] = A[r], A[q]
return q
def quicksort(A, p, r):
if r <= p:
return
q = sort(A, p, r)
quicksort(A, p, q - 1)
quicksort(A, q + 1, r) | quicksort | quicksort | Sort a list by recursively partitionioning list until sorted. | assert quicksort([],0,0)==None and quicksort([],0,0)==None and quicksort([5, 4, 3, 2, 1],0,4)==None and quicksort([5, 4, 3, 2, 1],0,4)==None and quicksort([5, 5, 5, 5],0,3)==None and quicksort([5, 5, 5, 5],0,3)==None and quicksort([5675, 564, 987, 154132, 8976, 0, -16221, 87526, 9826732986],0,8)==None and quicksort([5675, 564, 987, 154132, 8976, 0, -16221, 87526, 9826732986],0,8)==None | true | 712c50ed-0c17-44f1-a863-183f2d9a5e14 | 2,016 |
8,523 | def fibonacci(n):
if n == 0:
return 0
elif n == 1:
return 1
else:
return fibonacci(n - 2) + fibonacci(n - 1) | fibonacci_recur | fibonacci | Recursively compute the value of the fibonacci series at position n. | assert fibonacci(0)==0 and fibonacci(1)==1 and fibonacci(2)==1 and fibonacci(10)==55 and fibonacci(23)==28657 | true | 59b507a0-b0a2-42b7-a6af-736ab71c8fe1 | 2,016 |
21,477 | def fibonacci(n):
if n == 1:
return 1
else:
return fibonacci(n - 2) + fibonacci(n - 1) | fibonacci_recur | fibonacci | Recursively compute the value of the fibonacci series at position n. | assert fibonacci(0)==0 and fibonacci(1)==1 and fibonacci(2)==1 and fibonacci(10)==55 and fibonacci(23)==28657 | false | 59b507a0-b0a2-42b7-a6af-736ab71c8fe1 | 2,016 |
4,890 | def fibonacci(n):
if n == 1:
return 1
else:
return fibonacci(n - 2) + fibonacci(n - 1) | fibonacci_recur | fibonacci | Recursively compute the value of the fibonacci series at position n. | assert fibonacci(0)==0 and fibonacci(1)==1 and fibonacci(2)==1 and fibonacci(10)==55 and fibonacci(23)==28657 | false | 59b507a0-b0a2-42b7-a6af-736ab71c8fe1 | 2,016 |
36,221 | def count_letters(a):
return len(a) | count_letters | count_letters | Return the number of lettres in a string. | assert count_letters('')==0 and count_letters('0')==1 and count_letters('##')==2 and count_letters('t')==1 and count_letters('fqfseqfseqsse')==13 | true | a48376ed-7138-4481-a4da-74490838ea3e | 2,016 |
10,502 | def count_letters(a):
return len(a) | count_letters | count_letters | Return the number of lettres in a string. | assert count_letters('')==0 and count_letters('0')==1 and count_letters('##')==2 and count_letters('t')==1 and count_letters('fqfseqfseqsse')==13 | true | a48376ed-7138-4481-a4da-74490838ea3e | 2,016 |
26,238 | def reverse_list(a):
return a[::-1] | reverse_recur | reverse_list | Recursively reverse a list of elements. | assert reverse_list([])==[] and reverse_list([0])==[0] and reverse_list([9650, 12103, -1947378123, -109345868112896702250879906349988323457, 85, -74, -10050, 787, -3])==[-3, 787, -10050, -74, 85, -109345868112896702250879906349988323457, -1947378123, 12103, 9650] and reverse_list([9650, 12103, -1947378123, -109345868112896702250879906349988323457])==[-109345868112896702250879906349988323457, -1947378123, 12103, 9650] and reverse_list([0, 0])==[0, 0] and reverse_list([85, -74, -10050, 787, 9650, 12103, -1947378123, -109345868112896702250879906349988323457, -3])==[-3, -109345868112896702250879906349988323457, -1947378123, 12103, 9650, 787, -10050, -74, 85] and reverse_list([85, -74, -10050, 787, -3, 9650, 12103, -1947378123, -109345868112896702250879906349988323457])==[-109345868112896702250879906349988323457, -1947378123, 12103, 9650, -3, 787, -10050, -74, 85] | true | a48376ed-7138-4481-a4da-74490838ea3e | 2,016 |
25,696 | def reverse_list(a):
return a[::-1] | reverse_recur | reverse_list | Recursively reverse a list of elements. | assert reverse_list([])==[] and reverse_list([0])==[0] and reverse_list([9650, 12103, -1947378123, -109345868112896702250879906349988323457, 85, -74, -10050, 787, -3])==[-3, 787, -10050, -74, 85, -109345868112896702250879906349988323457, -1947378123, 12103, 9650] and reverse_list([9650, 12103, -1947378123, -109345868112896702250879906349988323457])==[-109345868112896702250879906349988323457, -1947378123, 12103, 9650] and reverse_list([0, 0])==[0, 0] and reverse_list([85, -74, -10050, 787, 9650, 12103, -1947378123, -109345868112896702250879906349988323457, -3])==[-3, -109345868112896702250879906349988323457, -1947378123, 12103, 9650, 787, -10050, -74, 85] and reverse_list([85, -74, -10050, 787, -3, 9650, 12103, -1947378123, -109345868112896702250879906349988323457])==[-109345868112896702250879906349988323457, -1947378123, 12103, 9650, -3, 787, -10050, -74, 85] | true | a48376ed-7138-4481-a4da-74490838ea3e | 2,016 |
7,671 | def fibonacci(a):
prev = 1
curr = 1
tmp = 0
i = 0
for i in range(0, a):
tmp = curr
curr = prev + curr
prev = tmp | fibonacci_recur | fibonacci | Recursively compute the value of the fibonacci series at position n. | assert fibonacci(0)==0 and fibonacci(1)==1 and fibonacci(2)==1 and fibonacci(10)==55 and fibonacci(23)==28657 | false | a48376ed-7138-4481-a4da-74490838ea3e | 2,016 |
33,882 | def fibonacci(a):
prev = 1
curr = 1
tmp = 0
i = 0
for i in range(0, a):
tmp = curr
curr = prev + curr
prev = tmp
return curr | fibonacci_recur | fibonacci | Recursively compute the value of the fibonacci series at position n. | assert fibonacci(0)==0 and fibonacci(1)==1 and fibonacci(2)==1 and fibonacci(10)==55 and fibonacci(23)==28657 | false | a48376ed-7138-4481-a4da-74490838ea3e | 2,016 |
7,655 | def fibonacci(a):
prev = 1
curr = 1
tmp = 0
i = 0
for i in range(0, a):
tmp = curr
curr = prev + curr
prev = tmp
return prev | fibonacci_recur | fibonacci | Recursively compute the value of the fibonacci series at position n. | assert fibonacci(0)==0 and fibonacci(1)==1 and fibonacci(2)==1 and fibonacci(10)==55 and fibonacci(23)==28657 | false | a48376ed-7138-4481-a4da-74490838ea3e | 2,016 |
25,437 | def fibonacci(a):
prev = 1
curr = 1
for i in range(0, a):
tmp = curr
curr = prev + curr
prev = tmp
return prev | fibonacci_recur | fibonacci | Recursively compute the value of the fibonacci series at position n. | assert fibonacci(0)==0 and fibonacci(1)==1 and fibonacci(2)==1 and fibonacci(10)==55 and fibonacci(23)==28657 | false | a48376ed-7138-4481-a4da-74490838ea3e | 2,016 |
35,852 | def fibonacci(a):
prev = 1
curr = 1
for i in range(0, a):
tmp = curr
curr = prev + curr
prev = tmp
return prev | fibonacci_recur | fibonacci | Recursively compute the value of the fibonacci series at position n. | assert fibonacci(0)==0 and fibonacci(1)==1 and fibonacci(2)==1 and fibonacci(10)==55 and fibonacci(23)==28657 | false | a48376ed-7138-4481-a4da-74490838ea3e | 2,016 |
10,408 | def partition(A, p, r):
q = j = p
while j < r:
if A[j] <= A[r]:
A[q], A[j] = A[j], A[q]
q += 1
j += 1
A[q], A[r] = A[r], A[q]
return q
def quicksort(A, p, r):
if r <= p:
return
q = partition(A, p, r)
quicksort(A, p, q - 1)
quicksort(A, q + 1, r) | quicksort | quicksort | Sort a list by recursively partitionioning list until sorted. | assert quicksort([],0,0)==None and quicksort([],0,0)==None and quicksort([5, 4, 3, 2, 1],0,4)==None and quicksort([5, 4, 3, 2, 1],0,4)==None and quicksort([5, 5, 5, 5],0,3)==None and quicksort([5, 5, 5, 5],0,3)==None and quicksort([5675, 564, 987, 154132, 8976, 0, -16221, 87526, 9826732986],0,8)==None and quicksort([5675, 564, 987, 154132, 8976, 0, -16221, 87526, 9826732986],0,8)==None | true | a48376ed-7138-4481-a4da-74490838ea3e | 2,016 |
35,093 | def partition(A, p, r):
q = j = p
while j < r:
if A[j] <= A[r]:
A[q], A[j] = A[j], A[q]
q += 1
j += 1
A[q], A[r] = A[r], A[q]
return q
def quicksort(A, p, r):
if r <= p:
return
q = partition(A, p, r)
quicksort(A, p, q - 1)
quicksort(A, q + 1, r) | quicksort | quicksort | Sort a list by recursively partitionioning list until sorted. | assert quicksort([],0,0)==None and quicksort([],0,0)==None and quicksort([5, 4, 3, 2, 1],0,4)==None and quicksort([5, 4, 3, 2, 1],0,4)==None and quicksort([5, 5, 5, 5],0,3)==None and quicksort([5, 5, 5, 5],0,3)==None and quicksort([5675, 564, 987, 154132, 8976, 0, -16221, 87526, 9826732986],0,8)==None and quicksort([5675, 564, 987, 154132, 8976, 0, -16221, 87526, 9826732986],0,8)==None | true | a48376ed-7138-4481-a4da-74490838ea3e | 2,016 |
12,331 | def selectionsort(a):
for i in range(0, len(a)):
p = i
j = i + 1
while j < len(a):
if a[j] < a[p]:
p = j
j = j + 1
tmp = a[p]
a[p] = a[i]
a[i] = tmp | selectionsort | selectionsort | Sort a list by repeatedly move minimimum of remaining sublist to front. | assert selectionsort([])==None and selectionsort([])==None and selectionsort([0])==None and selectionsort([0])==None | true | a48376ed-7138-4481-a4da-74490838ea3e | 2,016 |
24,706 | def selectionsort(a):
for i in range(0, len(a)):
p = i
j = i + 1
while j < len(a):
if a[j] < a[p]:
p = j
j = j + 1
tmp = a[p]
a[p] = a[i]
a[i] = tmp | selectionsort | selectionsort | Sort a list by repeatedly move minimimum of remaining sublist to front. | assert selectionsort([])==None and selectionsort([])==None and selectionsort([0])==None and selectionsort([0])==None | true | a48376ed-7138-4481-a4da-74490838ea3e | 2,016 |
40,518 | def count_letters(m):
if m == '':
return 0
else:
return 1 + count_letters(m[1:]) | count_letters | count_letters | Return the number of lettres in a string. | assert count_letters('')==0 and count_letters('0')==1 and count_letters('##')==2 and count_letters('t')==1 and count_letters('fqfseqfseqsse')==13 | true | 93426de2-87e4-4c00-9910-de51627bd576 | 2,016 |
3,415 | def count_letters(m):
if m == '':
return 0
else:
return 1 + count_letters(m[1:]) | count_letters | count_letters | Return the number of lettres in a string. | assert count_letters('')==0 and count_letters('0')==1 and count_letters('##')==2 and count_letters('t')==1 and count_letters('fqfseqfseqsse')==13 | true | 93426de2-87e4-4c00-9910-de51627bd576 | 2,016 |
38,531 | def reverse_list(m):
if len(m) == 0:
return []
else:
return [m[-1]] + reverse_list(m[:-1]) | reverse_recur | reverse_list | Recursively reverse a list of elements. | assert reverse_list([])==[] and reverse_list([0])==[0] and reverse_list([9650, 12103, -1947378123, -109345868112896702250879906349988323457, 85, -74, -10050, 787, -3])==[-3, 787, -10050, -74, 85, -109345868112896702250879906349988323457, -1947378123, 12103, 9650] and reverse_list([9650, 12103, -1947378123, -109345868112896702250879906349988323457])==[-109345868112896702250879906349988323457, -1947378123, 12103, 9650] and reverse_list([0, 0])==[0, 0] and reverse_list([85, -74, -10050, 787, 9650, 12103, -1947378123, -109345868112896702250879906349988323457, -3])==[-3, -109345868112896702250879906349988323457, -1947378123, 12103, 9650, 787, -10050, -74, 85] and reverse_list([85, -74, -10050, 787, -3, 9650, 12103, -1947378123, -109345868112896702250879906349988323457])==[-109345868112896702250879906349988323457, -1947378123, 12103, 9650, -3, 787, -10050, -74, 85] | true | 93426de2-87e4-4c00-9910-de51627bd576 | 2,016 |
3,178 | def reverse_list(m):
if len(m) == 0:
return []
else:
return [m[-1]] + reverse_list(m[:-1]) | reverse_recur | reverse_list | Recursively reverse a list of elements. | assert reverse_list([])==[] and reverse_list([0])==[0] and reverse_list([9650, 12103, -1947378123, -109345868112896702250879906349988323457, 85, -74, -10050, 787, -3])==[-3, 787, -10050, -74, 85, -109345868112896702250879906349988323457, -1947378123, 12103, 9650] and reverse_list([9650, 12103, -1947378123, -109345868112896702250879906349988323457])==[-109345868112896702250879906349988323457, -1947378123, 12103, 9650] and reverse_list([0, 0])==[0, 0] and reverse_list([85, -74, -10050, 787, 9650, 12103, -1947378123, -109345868112896702250879906349988323457, -3])==[-3, -109345868112896702250879906349988323457, -1947378123, 12103, 9650, 787, -10050, -74, 85] and reverse_list([85, -74, -10050, 787, -3, 9650, 12103, -1947378123, -109345868112896702250879906349988323457])==[-109345868112896702250879906349988323457, -1947378123, 12103, 9650, -3, 787, -10050, -74, 85] | true | 93426de2-87e4-4c00-9910-de51627bd576 | 2,016 |
242 | def fibonacci(n):
if n == 0 or n == 1:
return 1
else:
return fibonacci(n - 1) + fibonacci(n - 2) | fibonacci_recur | fibonacci | Recursively compute the value of the fibonacci series at position n. | assert fibonacci(0)==0 and fibonacci(1)==1 and fibonacci(2)==1 and fibonacci(10)==55 and fibonacci(23)==28657 | false | 93426de2-87e4-4c00-9910-de51627bd576 | 2,016 |
3,994 | def fibonacci(n):
if n == 0 or n == 1:
return 1
else:
return fibonacci(n - 1) + fibonacci(n - 2) | fibonacci_recur | fibonacci | Recursively compute the value of the fibonacci series at position n. | assert fibonacci(0)==0 and fibonacci(1)==1 and fibonacci(2)==1 and fibonacci(10)==55 and fibonacci(23)==28657 | false | 93426de2-87e4-4c00-9910-de51627bd576 | 2,016 |
39,865 | def power(n, c):
return n ** c | power | power | Raise m to the power of n. | assert power(0,0)==1 and power(62,4)==14776336 and power(-14012,0)==1 | true | 31fe4020-d4b7-4bf5-ac95-b28807a90ae8 | 2,016 |
38,023 | def power(n, c):
return n ** c | power | power | Raise m to the power of n. | assert power(0,0)==1 and power(62,4)==14776336 and power(-14012,0)==1 | true | 31fe4020-d4b7-4bf5-ac95-b28807a90ae8 | 2,016 |
41,522 | def minimum(n):
if n == 0:
return 0
i = 1
p = 0
while i < len(n):
if n[i] < n[p]:
n[p] = n[i]
i = i + 1
return n[p] | minimum | minimum | Return the minimum element in a list of numbers. | assert minimum([0])==0 and minimum([2, 10, 23, 9, 187])==2 and minimum([-2, -26, 7, -123, -1236521])==-1236521 and minimum([3896, 3673, 45, 16715, 23673])==45 | true | 31fe4020-d4b7-4bf5-ac95-b28807a90ae8 | 2,016 |
22,936 | def minimum(n):
if len(n) == 1:
return l[0]
else:
minr = minimum(n[1:])
return n[0] if n[0] < minr else minr | minimum | minimum | Return the minimum element in a list of numbers. | assert minimum([0])==0 and minimum([2, 10, 23, 9, 187])==2 and minimum([-2, -26, 7, -123, -1236521])==-1236521 and minimum([3896, 3673, 45, 16715, 23673])==45 | false | 31fe4020-d4b7-4bf5-ac95-b28807a90ae8 | 2,016 |
38,890 | def minimum(n):
if len(n) == 1:
return n[0]
else:
minr = minimum(n[1:])
return n[0] if n[0] < minr else minr | minimum | minimum | Return the minimum element in a list of numbers. | assert minimum([0])==0 and minimum([2, 10, 23, 9, 187])==2 and minimum([-2, -26, 7, -123, -1236521])==-1236521 and minimum([3896, 3673, 45, 16715, 23673])==45 | true | 31fe4020-d4b7-4bf5-ac95-b28807a90ae8 | 2,016 |
22,275 | def minimum(n):
if len(n) == 1:
return n[0]
else:
minr = minimum(n[1:])
return n[0] if n[0] < minr else minr | minimum | minimum | Return the minimum element in a list of numbers. | assert minimum([0])==0 and minimum([2, 10, 23, 9, 187])==2 and minimum([-2, -26, 7, -123, -1236521])==-1236521 and minimum([3896, 3673, 45, 16715, 23673])==45 | true | 31fe4020-d4b7-4bf5-ac95-b28807a90ae8 | 2,016 |
28,783 | def maximum(n):
if len(n) == 1:
return n[0]
maxr = maxi(n[1:])
return n[0] if n[0] > maxr else minr | maximum | maximum | Return the maximum element in a list of numbers. | assert maximum([0])==0 and maximum([67, 1, 2, -2, 0])==67 and maximum([0, -2, 2, 1, 67])==67 and maximum([-10, -23, -45, -9, -45617])==-9 | false | 31fe4020-d4b7-4bf5-ac95-b28807a90ae8 | 2,016 |
27,080 | def maximum(n):
if len(n) == 1:
return n[0]
maxr = maximum(n[1:])
return n[0] if n[0] > maxr else minr | maximum | maximum | Return the maximum element in a list of numbers. | assert maximum([0])==0 and maximum([67, 1, 2, -2, 0])==67 and maximum([0, -2, 2, 1, 67])==67 and maximum([-10, -23, -45, -9, -45617])==-9 | false | 31fe4020-d4b7-4bf5-ac95-b28807a90ae8 | 2,016 |
6,395 | def power(num, pwr):
return num ** pwr | power | power | Raise m to the power of n. | assert power(0,0)==1 and power(62,4)==14776336 and power(-14012,0)==1 | true | 88e97329-9c3f-4e1a-8643-1311f4e801a9 | 2,016 |
4,630 | def power(num, pwr):
return num ** pwr | power | power | Raise m to the power of n. | assert power(0,0)==1 and power(62,4)==14776336 and power(-14012,0)==1 | true | 88e97329-9c3f-4e1a-8643-1311f4e801a9 | 2,016 |
34,159 | def maximum(n):
if len(n) == 1:
return n[0]
maxr = maximum(n[1:])
return n[0] if n[0] > maxr else maxr | maximum | maximum | Return the maximum element in a list of numbers. | assert maximum([0])==0 and maximum([67, 1, 2, -2, 0])==67 and maximum([0, -2, 2, 1, 67])==67 and maximum([-10, -23, -45, -9, -45617])==-9 | true | 31fe4020-d4b7-4bf5-ac95-b28807a90ae8 | 2,016 |
8,682 | def maximum(n):
if len(n) == 1:
return n[0]
maxr = maximum(n[1:])
return n[0] if n[0] > maxr else maxr | maximum | maximum | Return the maximum element in a list of numbers. | assert maximum([0])==0 and maximum([67, 1, 2, -2, 0])==67 and maximum([0, -2, 2, 1, 67])==67 and maximum([-10, -23, -45, -9, -45617])==-9 | true | 31fe4020-d4b7-4bf5-ac95-b28807a90ae8 | 2,016 |
26,835 | def minimum(l):
l = sorted(l)
return l[0] | minimum | minimum | Return the minimum element in a list of numbers. | assert minimum([0])==0 and minimum([2, 10, 23, 9, 187])==2 and minimum([-2, -26, 7, -123, -1236521])==-1236521 and minimum([3896, 3673, 45, 16715, 23673])==45 | true | 88e97329-9c3f-4e1a-8643-1311f4e801a9 | 2,016 |
41,111 | def minimum(l):
l = sorted(l)
return l[0] | minimum | minimum | Return the minimum element in a list of numbers. | assert minimum([0])==0 and minimum([2, 10, 23, 9, 187])==2 and minimum([-2, -26, 7, -123, -1236521])==-1236521 and minimum([3896, 3673, 45, 16715, 23673])==45 | true | 88e97329-9c3f-4e1a-8643-1311f4e801a9 | 2,016 |
22,238 | def power(x, n):
if n == 0:
return 1
elif n == 1:
return x
else:
return x * power(x, n - 1) | power | power | Raise m to the power of n. | assert power(0,0)==1 and power(62,4)==14776336 and power(-14012,0)==1 | true | 2157ade0-6890-435b-8669-a884e3233bc7 | 2,016 |
21,930 | def power(x, n):
if n == 0:
return 1
elif n == 1:
return x
else:
return x * power(x, n - 1) | power | power | Raise m to the power of n. | assert power(0,0)==1 and power(62,4)==14776336 and power(-14012,0)==1 | true | 2157ade0-6890-435b-8669-a884e3233bc7 | 2,016 |
2,925 | def maximum(l):
l = sorted(l)
return l[-1] | maximum | maximum | Return the maximum element in a list of numbers. | assert maximum([0])==0 and maximum([67, 1, 2, -2, 0])==67 and maximum([0, -2, 2, 1, 67])==67 and maximum([-10, -23, -45, -9, -45617])==-9 | true | 88e97329-9c3f-4e1a-8643-1311f4e801a9 | 2,016 |
12,823 | def maximum(l):
l = sorted(l)
return l[-1] | maximum | maximum | Return the maximum element in a list of numbers. | assert maximum([0])==0 and maximum([67, 1, 2, -2, 0])==67 and maximum([0, -2, 2, 1, 67])==67 and maximum([-10, -23, -45, -9, -45617])==-9 | true | 88e97329-9c3f-4e1a-8643-1311f4e801a9 | 2,016 |
27,211 | def count_letters(string_):
len(string_) | count_letters | count_letters | Return the number of lettres in a string. | assert count_letters('')==0 and count_letters('0')==1 and count_letters('##')==2 and count_letters('t')==1 and count_letters('fqfseqfseqsse')==13 | false | 88e97329-9c3f-4e1a-8643-1311f4e801a9 | 2,016 |
29,011 | def power(x, y):
if y == 0:
return x
return power(x ** y, y - 1) | power | power | Raise m to the power of n. | assert power(0,0)==1 and power(62,4)==14776336 and power(-14012,0)==1 | false | bd03ecd6-cea3-4854-803a-b14d429489a7 | 2,016 |
37,580 | def count_letters(n):
if len(n) == 1:
return n[0]
length = len(n)
return length | count_letters | count_letters | Return the number of lettres in a string. | assert count_letters('')==0 and count_letters('0')==1 and count_letters('##')==2 and count_letters('t')==1 and count_letters('fqfseqfseqsse')==13 | false | 31fe4020-d4b7-4bf5-ac95-b28807a90ae8 | 2,016 |
2,907 | def count_letters(string_):
counter = 0
for i in string:
counter += 1
return counter | count_letters | count_letters | Return the number of lettres in a string. | assert count_letters('')==0 and count_letters('0')==1 and count_letters('##')==2 and count_letters('t')==1 and count_letters('fqfseqfseqsse')==13 | false | 88e97329-9c3f-4e1a-8643-1311f4e801a9 | 2,016 |
4,824 | def count_letters(string_):
counter = 0
for i in string_:
counter += 1
return counter | count_letters | count_letters | Return the number of lettres in a string. | assert count_letters('')==0 and count_letters('0')==1 and count_letters('##')==2 and count_letters('t')==1 and count_letters('fqfseqfseqsse')==13 | true | 88e97329-9c3f-4e1a-8643-1311f4e801a9 | 2,016 |
12,958 | def count_letters(string_):
counter = 0
for i in string_:
counter += 1
return counter | count_letters | count_letters | Return the number of lettres in a string. | assert count_letters('')==0 and count_letters('0')==1 and count_letters('##')==2 and count_letters('t')==1 and count_letters('fqfseqfseqsse')==13 | true | 88e97329-9c3f-4e1a-8643-1311f4e801a9 | 2,016 |
37,419 | def count_letters(n):
if len(n) == 1:
return n[0]
return 1 + count_letters(n[0:]) | count_letters | count_letters | Return the number of lettres in a string. | assert count_letters('')==0 and count_letters('0')==1 and count_letters('##')==2 and count_letters('t')==1 and count_letters('fqfseqfseqsse')==13 | false | 31fe4020-d4b7-4bf5-ac95-b28807a90ae8 | 2,016 |
34,972 | def power(x, y):
if y == 0:
return 1
return x * power(x, y - 1) | power | power | Raise m to the power of n. | assert power(0,0)==1 and power(62,4)==14776336 and power(-14012,0)==1 | true | bd03ecd6-cea3-4854-803a-b14d429489a7 | 2,016 |
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.