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
|
|---|---|---|---|---|---|---|---|---|
32,925 | def selectionsort(a):
i = 0
while i < len(a):
j = i + 1
p = i
while j < len(a):
if a[j] < a[p]:
p = j
j += 1
a[p], a[i] = a[i], a[p]
i += 1
return a | 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 | false | caddc359-e5b0-41d8-94ab-df712d5ea9ce | 2,016 |
3,728 | def minimum(l):
return l.sort()[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 | 59b507a0-b0a2-42b7-a6af-736ab71c8fe1 | 2,016 |
2,171 | def power(n):
if n == 0:
return 0
else:
return n ** power(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 | false | 1c2a27a6-b2a2-47c9-b19f-39d39288a873 | 2,016 |
26,047 | def power(m, n):
if n == 0:
return 0
else:
return m ** power(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 | false | 1c2a27a6-b2a2-47c9-b19f-39d39288a873 | 2,016 |
29,316 | def selectionsort(a):
i = 0
while i < len(a):
j = i + 1
p = i
while j < len(a):
if a[j] < a[p]:
p = j
j += 1
a[p], a[i] = a[i], a[p]
i += 1
return a | 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 | false | caddc359-e5b0-41d8-94ab-df712d5ea9ce | 2,016 |
13,887 | def power(m, n):
if n == 0:
return 0
else:
return n ** power(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 | false | 1c2a27a6-b2a2-47c9-b19f-39d39288a873 | 2,016 |
10,087 | def power(m, n):
if n == 0:
return 1
return m * power(m, 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 | 98d44d17-92f8-4274-915e-b88bdd9dca26 | 2,016 |
30,492 | def power(m, n):
if n == 0:
return 1
return m * power(m, 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 | 98d44d17-92f8-4274-915e-b88bdd9dca26 | 2,016 |
39,371 | def minimum(l):
return l.sort()[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 | 59b507a0-b0a2-42b7-a6af-736ab71c8fe1 | 2,016 |
3,812 | def power(m, n):
return m ** n | 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 | 1c2a27a6-b2a2-47c9-b19f-39d39288a873 | 2,016 |
27,678 | def power(m, n):
return m ** n | 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 | 1c2a27a6-b2a2-47c9-b19f-39d39288a873 | 2,016 |
33,872 | def power(a, b):
return a ** b | 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 | a48376ed-7138-4481-a4da-74490838ea3e | 2,016 |
13,863 | def minimum(l):
l = l.sort()
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 | false | 59b507a0-b0a2-42b7-a6af-736ab71c8fe1 | 2,016 |
38,602 | def power(m, n):
if n == 0:
return 1
if n == 1:
return m
if m == 0:
return 0
if m == 1:
return 1
return m * power(m, 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 | b13f3dba-a06b-4528-a4d8-c2ee1a5bb34d | 2,016 |
40,678 | def power(m, n):
if n == 0:
return 1
if n == 1:
return m
if m == 0:
return 0
if m == 1:
return 1
return m * power(m, 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 | b13f3dba-a06b-4528-a4d8-c2ee1a5bb34d | 2,016 |
26,437 | def minimum(l):
l.sort()
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 | 59b507a0-b0a2-42b7-a6af-736ab71c8fe1 | 2,016 |
193 | def minimum(l):
l.sort()
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 | 59b507a0-b0a2-42b7-a6af-736ab71c8fe1 | 2,016 |
2,964 | def power(m, n):
return m ** n | 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 | fe81d9d2-29fa-4a6b-abc0-109c9697b557 | 2,016 |
35,874 | def power(m, n):
return m ** n | 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 | fe81d9d2-29fa-4a6b-abc0-109c9697b557 | 2,016 |
26,768 | def minimum(l):
A = 'null'
lowest = A
for c in l:
if lowest == A:
lowest = c
elif c < lowest:
lowest = c
return lowest | 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 | 1c2a27a6-b2a2-47c9-b19f-39d39288a873 | 2,016 |
13,731 | def minimum(l):
A = 'null'
lowest = A
for c in l:
if lowest == A:
lowest = c
elif c < lowest:
lowest = c
return lowest | 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 | 1c2a27a6-b2a2-47c9-b19f-39d39288a873 | 2,016 |
1,736 | def power(m, n):
if n == 0:
return 1
if n == 1:
return m
if m == 0:
return 0
if m == 1:
return 1
return m ** n | 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 | 9550e418-a019-49c2-a2e9-8322a300fb6f | 2,016 |
21,446 | def maximum(l):
return l.sort()
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 | false | 59b507a0-b0a2-42b7-a6af-736ab71c8fe1 | 2,016 |
21,689 | def maximum(l):
l.sort()
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 | 59b507a0-b0a2-42b7-a6af-736ab71c8fe1 | 2,016 |
41,261 | def maximum(l):
l.sort()
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 | 59b507a0-b0a2-42b7-a6af-736ab71c8fe1 | 2,016 |
15,763 | def maximum(l):
A = 'null'
highest = A
for c in l:
if maximum == A:
maximum = c
elif c > maximum:
maximum = c
return maximum | 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 | 1c2a27a6-b2a2-47c9-b19f-39d39288a873 | 2,016 |
7,094 | def power(m, n):
if m == 0:
return 0
elif m == 1:
return 1
elif n == 0:
return 1
elif n == 1:
return m
else:
m * power(m, 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 | false | 0473ca8a-3862-4046-a34c-16eb754fdfff | 2,016 |
38,717 | def maximum(l):
A = 'null'
highest = A
for c in l:
if highest == A:
highest = c
elif c > highest:
highest = c
return highest | 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 | 1c2a27a6-b2a2-47c9-b19f-39d39288a873 | 2,016 |
37,701 | def maximum(l):
A = 'null'
highest = A
for c in l:
if highest == A:
highest = c
elif c > highest:
highest = c
return highest | 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 | 1c2a27a6-b2a2-47c9-b19f-39d39288a873 | 2,016 |
23,807 | def power(m, n):
if m == 0:
return 0
elif m == 1:
return 1
elif n == 0:
return 1
elif n == 1:
return m
else:
return m * power(m, 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 | false | 0473ca8a-3862-4046-a34c-16eb754fdfff | 2,016 |
1,709 | def power(m, n):
if m == 0:
return 0
elif m == 1:
return 1
elif n == 0:
return 1
elif n == 1:
return m
else:
return m * power(m, 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 | false | 0473ca8a-3862-4046-a34c-16eb754fdfff | 2,016 |
15,053 | def count_letters(s):
str_len = 0
for c in s:
str_len += 1
return str_len | 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 | 1c2a27a6-b2a2-47c9-b19f-39d39288a873 | 2,016 |
36,106 | def count_letters(s):
str_len = 0
for c in s:
str_len += 1
return str_len | 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 | 1c2a27a6-b2a2-47c9-b19f-39d39288a873 | 2,016 |
7,813 | def power(a, b):
return a ** b | 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 | a48376ed-7138-4481-a4da-74490838ea3e | 2,016 |
24,980 | def power(a, b):
return a ** b | 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 | a48376ed-7138-4481-a4da-74490838ea3e | 2,016 |
42,205 | def minimum(l):
if len(l) == 1:
return l[0]
else:
mini = minimum(l[1:])
if l[0] < mini:
return l[0]
else:
return mini | 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 | 98d44d17-92f8-4274-915e-b88bdd9dca26 | 2,016 |
5,923 | def minimum(l):
if len(l) == 1:
return l[0]
else:
mini = minimum(l[1:])
if l[0] < mini:
return l[0]
else:
return mini | 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 | 98d44d17-92f8-4274-915e-b88bdd9dca26 | 2,016 |
19,138 | def power(m, n):
if n == 0:
return 1
return m * power(m, 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 | 932dfe81-cd49-4d41-8b87-456f3246e781 | 2,016 |
21,615 | def power(m, n):
if n == 0:
return 1
return m * power(m, 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 | 932dfe81-cd49-4d41-8b87-456f3246e781 | 2,016 |
38,208 | def minimum(a):
tmp = a[0]
for i in a:
if i < tmp:
tmp = i
return tmp | 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 | a48376ed-7138-4481-a4da-74490838ea3e | 2,016 |
10,228 | def minimum(a):
tmp = a[0]
for i in a:
if i < tmp:
tmp = i
return tmp | 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 | a48376ed-7138-4481-a4da-74490838ea3e | 2,016 |
13,560 | def reverse_list(l):
if l == []:
return []
temp = reverse_list(l[1:])
temp.append(l[0])
return temp | 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 | 9550e418-a019-49c2-a2e9-8322a300fb6f | 2,016 |
19,392 | def reverse_list(l):
if l == []:
return []
temp = reverse_list(l[1:])
temp.append(l[0])
return temp | 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 | 9550e418-a019-49c2-a2e9-8322a300fb6f | 2,016 |
23,947 | def maximum(a):
tmp = a[0]
for i in a:
if i > tmp:
tmp = i
return tmp | 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 | a48376ed-7138-4481-a4da-74490838ea3e | 2,016 |
6,678 | def maximum(a):
tmp = a[0]
for i in a:
if i > tmp:
tmp = i
return tmp | 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 | a48376ed-7138-4481-a4da-74490838ea3e | 2,016 |
11,318 | def maximum(a):
tmp = a[0]
for i in a:
if i > tmp:
tmp = i
return tmp | 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 | a48376ed-7138-4481-a4da-74490838ea3e | 2,016 |
2,931 | def reverse_list(l):
new_list = []
for c in l:
new_list.append(l.pop)
return new_list | 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 | 1c2a27a6-b2a2-47c9-b19f-39d39288a873 | 2,016 |
13,958 | def maximum(l):
if len(l) == 1:
return l[0]
else:
maxi = maximum(l[1:])
if l[0] > maxi:
return l[0]
else:
return maxi | 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 | 98d44d17-92f8-4274-915e-b88bdd9dca26 | 2,016 |
11,433 | def maximum(l):
if len(l) == 1:
return l[0]
else:
maxi = maximum(l[1:])
if l[0] > maxi:
return l[0]
else:
return maxi | 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 | 98d44d17-92f8-4274-915e-b88bdd9dca26 | 2,016 |
41,399 | def minimum(l):
if not l or len(l) == 1:
return l
tail_min = minimum(l[1:])
return l[0] if l[0] < tail_min else tail_min | 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 | 932dfe81-cd49-4d41-8b87-456f3246e781 | 2,016 |
23,890 | def reverse_list(l):
new_list = []
for c in l:
new_list.append(l.pop())
return new_list | 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 | 1c2a27a6-b2a2-47c9-b19f-39d39288a873 | 2,016 |
35,608 | def minimum(l):
if not l:
return l
if len(l) == 1:
return l[0]
tail_min = minimum(l[1:])
if tail_min == []:
return l[0]
return l[0] if l[0] < tail_min else tail_min | 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 | 932dfe81-cd49-4d41-8b87-456f3246e781 | 2,016 |
13,750 | def minimum(l):
if not l:
return l
if len(l) == 1:
return l[0]
tail_min = minimum(l[1:])
if tail_min == []:
return l[0]
return l[0] if l[0] < tail_min else tail_min | 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 | 932dfe81-cd49-4d41-8b87-456f3246e781 | 2,016 |
840 | def minimum(l):
if len(l) == 1:
return l[0]
mini = minimum(l[1:])
if l[0] < mini:
return l[0]
else:
return mini | 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 | fe81d9d2-29fa-4a6b-abc0-109c9697b557 | 2,016 |
15,784 | def minimum(l):
if len(l) == 1:
return l[0]
mini = minimum(l[1:])
if l[0] < mini:
return l[0]
else:
return mini | 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 | fe81d9d2-29fa-4a6b-abc0-109c9697b557 | 2,016 |
2,379 | def maximum(l):
if not l:
return l
if len(l) == 1:
return l[0]
tail_max = maximum(l[1:])
if tail_max == []:
return l[0]
return l[0] if l[0] > tail_max else tail_max | 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 | 932dfe81-cd49-4d41-8b87-456f3246e781 | 2,016 |
26,962 | def maximum(l):
if not l:
return l
if len(l) == 1:
return l[0]
tail_max = maximum(l[1:])
if tail_max == []:
return l[0]
return l[0] if l[0] > tail_max else tail_max | 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 | 932dfe81-cd49-4d41-8b87-456f3246e781 | 2,016 |
9,856 | def maximum(l):
if len(l) == 1:
return l[0]
maxi = maximum(l[1:])
if l[0] > maxi:
return l[0]
else:
return maxi | 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 | fe81d9d2-29fa-4a6b-abc0-109c9697b557 | 2,016 |
31,180 | def maximum(l):
if len(l) == 1:
return l[0]
maxi = maximum(l[1:])
if l[0] > maxi:
return l[0]
else:
return maxi | 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 | fe81d9d2-29fa-4a6b-abc0-109c9697b557 | 2,016 |
29,495 | def power(m, n):
if n == 0:
return 1
if n == 1:
return m
if m == 0:
return 0
if m == 1:
return 1
return m * power(m, 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 | 9550e418-a019-49c2-a2e9-8322a300fb6f | 2,016 |
35,300 | def power(m, n):
if n == 0:
return 1
if n == 1:
return m
if m == 0:
return 0
if m == 1:
return 1
return m * power(m, 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 | 9550e418-a019-49c2-a2e9-8322a300fb6f | 2,016 |
3,403 | def count_letters(string):
if not string:
return 0
return count_letters(string[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 | false | 932dfe81-cd49-4d41-8b87-456f3246e781 | 2,016 |
6,021 | def reverse_list(l):
new_list = []
for c in l:
new_list.append(l.pop())
new_list.append(l.pop())
return new_list | 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 | 1c2a27a6-b2a2-47c9-b19f-39d39288a873 | 2,016 |
2,611 | def minimum(l):
if len(l) == 1:
return l[0]
elif minimum(l[0:len(l)]) < minimum(l[len(l) + 1:]):
return minimum(l[0:len(l)])
else:
return minimum(l[len(l) + 1:]) | 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 | 0473ca8a-3862-4046-a34c-16eb754fdfff | 2,016 |
7,281 | def power(m, n):
while n != 0:
m *= m
n -= 1
return m | 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 | 59b507a0-b0a2-42b7-a6af-736ab71c8fe1 | 2,016 |
36,100 | def reverse_list(l):
new_list = []
i = 0
while len(l) > i:
new_list.append(l.pop())
i += 1
return new_list | 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 | 1c2a27a6-b2a2-47c9-b19f-39d39288a873 | 2,016 |
2,067 | def minimum(l):
if len(l) == 1:
return l[0]
else:
mini = minimum(l[1:])
if l[0] < mini:
return l[0]
else:
return mini | 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 | 0473ca8a-3862-4046-a34c-16eb754fdfff | 2,016 |
12,224 | def minimum(l):
if len(l) == 1:
return l[0]
else:
mini = minimum(l[1:])
if l[0] < mini:
return l[0]
else:
return mini | 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 | 0473ca8a-3862-4046-a34c-16eb754fdfff | 2,016 |
288 | def power(m, n):
while n != 0:
m = m * m
n = n - 1
return m | 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 | 59b507a0-b0a2-42b7-a6af-736ab71c8fe1 | 2,016 |
8,131 | def minimum(l):
if len(l) == 1:
return l[0]
smallest = minimum(l[1:])
if l[0] < smallest:
return l[0]
else:
return smallest | 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 | b13f3dba-a06b-4528-a4d8-c2ee1a5bb34d | 2,016 |
6,123 | def minimum(l):
if len(l) == 1:
return l[0]
smallest = minimum(l[1:])
if l[0] < smallest:
return l[0]
else:
return smallest | 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 | b13f3dba-a06b-4528-a4d8-c2ee1a5bb34d | 2,016 |
36,447 | def power(m, n):
while n > 0:
m = m * m
n = n - 1
return m | 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 | 59b507a0-b0a2-42b7-a6af-736ab71c8fe1 | 2,016 |
30,977 | def count_letters(string):
if not string:
return 0
return count_letters(string[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 | 932dfe81-cd49-4d41-8b87-456f3246e781 | 2,016 |
10,403 | def count_letters(string):
if not string:
return 0
return count_letters(string[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 | 932dfe81-cd49-4d41-8b87-456f3246e781 | 2,016 |
26,010 | def power(m, n):
if n == 0:
return 1
return m * power(m, 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 | a493c80e-3567-462a-bcbe-7bd974d52d8a | 2,016 |
11,662 | def power(m, n):
if n == 0:
return 1
return m * power(m, 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 | a493c80e-3567-462a-bcbe-7bd974d52d8a | 2,016 |
18,456 | def power(m, n, flag=True, m1=None):
if not n:
return 1
if flag:
m1 = m
if n == 1:
return m
return power(m * m1, n - 1, False, m1) | 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 | ba8a7560-aac9-45ef-b6fd-730b60e73e8c | 2,016 |
29,722 | def power(m, n, flag=True, m1=None):
if not n:
return 1
if flag:
m1 = m
if n == 1:
return m
return power(m * m1, n - 1, False, m1) | 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 | ba8a7560-aac9-45ef-b6fd-730b60e73e8c | 2,016 |
28,347 | def power(m, n, flag=True, m1=None):
if not n:
return 1
if flag:
m1 = m
if n == 1:
return m
return power(m * m1, n - 1, False, m1) | 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 | ba8a7560-aac9-45ef-b6fd-730b60e73e8c | 2,016 |
21,490 | def maximum(l):
if len(l) == 1:
return l[0]
else:
m = maximum(l[1:])
if l[0] > m:
return l[0]
else:
return 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 | 0473ca8a-3862-4046-a34c-16eb754fdfff | 2,016 |
8,495 | def maximum(l):
if len(l) == 1:
return l[0]
else:
m = maximum(l[1:])
if l[0] > m:
return l[0]
else:
return 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 | 0473ca8a-3862-4046-a34c-16eb754fdfff | 2,016 |
12,001 | def count_letters(s):
if s == '':
return 0
else:
return 1 + 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 | fe81d9d2-29fa-4a6b-abc0-109c9697b557 | 2,016 |
2,777 | def count_letters(s):
if s == '':
return 0
else:
return 1 + 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 | fe81d9d2-29fa-4a6b-abc0-109c9697b557 | 2,016 |
27,745 | def power(m, n):
while n > 0:
m = m * m
n = n - 1
print(n)
return m | 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 | 59b507a0-b0a2-42b7-a6af-736ab71c8fe1 | 2,016 |
25,328 | def minimum(l):
if len(l) == 1:
return l[0]
smaller = minimum(l[1:])
if l[0] < smaller:
return l[0]
return smaller | 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 | 9550e418-a019-49c2-a2e9-8322a300fb6f | 2,016 |
1,386 | def minimum(l):
if len(l) == 1:
return l[0]
smaller = minimum(l[1:])
if l[0] < smaller:
return l[0]
return smaller | 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 | 9550e418-a019-49c2-a2e9-8322a300fb6f | 2,016 |
16,236 | def count_letters(s):
if len(s) == 1:
return 1
else:
return 1 + 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 | false | 0473ca8a-3862-4046-a34c-16eb754fdfff | 2,016 |
25,922 | def count_letters(s):
if len(s) == 0:
return 0
elif len(s) == 1:
return 1
else:
return 1 + 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 | 0473ca8a-3862-4046-a34c-16eb754fdfff | 2,016 |
37,003 | def count_letters(s):
if len(s) == 0:
return 0
elif len(s) == 1:
return 1
else:
return 1 + 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 | 0473ca8a-3862-4046-a34c-16eb754fdfff | 2,016 |
29,059 | def reverse_list(l):
return l[-1] + reverse_list(l[:-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] | false | 932dfe81-cd49-4d41-8b87-456f3246e781 | 2,016 |
21,049 | def reverse_list(l):
if len(l) == 1:
return l
return l[-1] + reverse_list(l[:-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] | false | 932dfe81-cd49-4d41-8b87-456f3246e781 | 2,016 |
26,414 | def maximum(l):
if len(l) == 1:
return l[0]
smaller = maximum(l[1:])
if l[0] > smaller:
return l[0]
return smaller | 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 | 9550e418-a019-49c2-a2e9-8322a300fb6f | 2,016 |
4,921 | def reverse_list(l):
if len(l) == 1:
return l
return l[-1].extend(reverse_list(l[:-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] | false | 932dfe81-cd49-4d41-8b87-456f3246e781 | 2,016 |
18,538 | def reverse_list(l):
if len(l) == 0:
return l
return reverse_list(l[1:]) + [l[0]] | 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 | 98d44d17-92f8-4274-915e-b88bdd9dca26 | 2,016 |
17,553 | def reverse_list(l):
if len(l) == 0:
return l
return reverse_list(l[1:]) + [l[0]] | 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 | 98d44d17-92f8-4274-915e-b88bdd9dca26 | 2,016 |
28,964 | def power(m, n):
m = m ** n
return power(m, n) | 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 | a72d6534-1b96-4a41-95a5-f71f23e2bd99 | 2,016 |
40,886 | def reverse_list(l):
if len(l) == 1:
return l
return [l[-1]].extend(reverse_list(l[:-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] | false | 932dfe81-cd49-4d41-8b87-456f3246e781 | 2,016 |
6,934 | def maximum(l):
if len(l) == 1:
return l[0]
biggest = maximum(l[1:])
if l[0] > biggest:
return l[0]
else:
return biggest | 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 | b13f3dba-a06b-4528-a4d8-c2ee1a5bb34d | 2,016 |
11,998 | def maximum(l):
if len(l) == 1:
return l[0]
biggest = maximum(l[1:])
if l[0] > biggest:
return l[0]
else:
return biggest | 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 | b13f3dba-a06b-4528-a4d8-c2ee1a5bb34d | 2,016 |
33,095 | def maximum(l):
if len(l) == 1:
return l[0]
bigger = maximum(l[1:])
if l[0] > bigger:
return l[0]
return bigger | 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 | 9550e418-a019-49c2-a2e9-8322a300fb6f | 2,016 |
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.