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
|
|---|---|---|---|---|---|---|---|---|
22,356 |
def fibonacci(n):
if n == 0:
return 0
elif 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
| true |
ead2ade9-6c50-44a4-98f3-1d781d45a0f5
| 2,016 |
34,329 |
def index(str, letter, pos):
if pos == len(str):
return -1
elif str[pos] == letter:
return pos
else:
return index(str, letter, pos + 1)
|
index_recur
|
index
|
Recursively search for the position of letter in str, return -1 if it is not there.
|
assert index('','0',0)==-1 and index('0','0',0)==0 and index('a','8',0)==-1 and index('tV2','2',0)==2
| true |
ead2ade9-6c50-44a4-98f3-1d781d45a0f5
| 2,016 |
28,666 |
def search(str, letter):
if len(str) == 0:
return 'False'
elif str[0] == letter:
return 'True'
else:
return search(string[1:], letter)
|
search_recur
|
search
|
Recursively search for a letter in a string
|
assert search('','0')==False and search('0','0')==True and search('ERFE0Rfsef','0')==True and search('ERFERfsef0','0')==True and search('','a')==False and search('cbzeycuzbvyzuvb','a')==False and search('cbsducsvdbcyts','c')==True and search('dbzeducvbzy','y')==True and search('xqvsgxcutvy','u')==True
| false |
ead2ade9-6c50-44a4-98f3-1d781d45a0f5
| 2,016 |
2,583 |
def search(str, letter):
if len(str) == 0:
return 'False'
elif str[0] == letter:
return 'True'
else:
return search(str[1:], letter)
|
search_recur
|
search
|
Recursively search for a letter in a string
|
assert search('','0')==False and search('0','0')==True and search('ERFE0Rfsef','0')==True and search('ERFERfsef0','0')==True and search('','a')==False and search('cbzeycuzbvyzuvb','a')==False and search('cbsducsvdbcyts','c')==True and search('dbzeducvbzy','y')==True and search('xqvsgxcutvy','u')==True
| false |
ead2ade9-6c50-44a4-98f3-1d781d45a0f5
| 2,016 |
26,638 |
def search(str, letter):
if len(str) == 0:
return 'False'
elif str[0] == letter:
return 'True'
else:
return search(str[1:], letter)
|
search_recur
|
search
|
Recursively search for a letter in a string
|
assert search('','0')==False and search('0','0')==True and search('ERFE0Rfsef','0')==True and search('ERFERfsef0','0')==True and search('','a')==False and search('cbzeycuzbvyzuvb','a')==False and search('cbsducsvdbcyts','c')==True and search('dbzeducvbzy','y')==True and search('xqvsgxcutvy','u')==True
| false |
ead2ade9-6c50-44a4-98f3-1d781d45a0f5
| 2,016 |
23,747 |
def index(str, letter, pos):
if pos == len(str):
return -1
elif str[pos] == letter:
return pos
else:
return index(str, letter, pos + 1)
|
index_recur
|
index
|
Recursively search for the position of letter in str, return -1 if it is not there.
|
assert index('','0',0)==-1 and index('0','0',0)==0 and index('a','8',0)==-1 and index('tV2','2',0)==2
| true |
ead2ade9-6c50-44a4-98f3-1d781d45a0f5
| 2,016 |
20,248 |
def index(str, letter, pos):
if pos == len(str):
return -1
elif str[pos] == letter:
return pos
else:
return index(str, letter, pos + 1)
|
index_recur
|
index
|
Recursively search for the position of letter in str, return -1 if it is not there.
|
assert index('','0',0)==-1 and index('0','0',0)==0 and index('a','8',0)==-1 and index('tV2','2',0)==2
| true |
ead2ade9-6c50-44a4-98f3-1d781d45a0f5
| 2,016 |
18,828 |
def fibonacci(n):
if n == 0:
return 0
elif 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
| true |
ead2ade9-6c50-44a4-98f3-1d781d45a0f5
| 2,016 |
25,395 |
def fibonacci(n):
if n == 0:
return 0
elif 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
| true |
ead2ade9-6c50-44a4-98f3-1d781d45a0f5
| 2,016 |
21,120 |
def index(str, letter, pos):
if pos == len(str):
return -1
elif str[pos] == letter:
return pos
else:
return index(str, letter, pos + 1)
|
index_recur
|
index
|
Recursively search for the position of letter in str, return -1 if it is not there.
|
assert index('','0',0)==-1 and index('0','0',0)==0 and index('a','8',0)==-1 and index('tV2','2',0)==2
| true |
ead2ade9-6c50-44a4-98f3-1d781d45a0f5
| 2,016 |
3,244 |
def search(str, letter):
if len(str) == 0:
return 'False'
elif str[0] == letter:
return 'True'
else:
return search(str[1:], letter)
|
search_recur
|
search
|
Recursively search for a letter in a string
|
assert search('','0')==False and search('0','0')==True and search('ERFE0Rfsef','0')==True and search('ERFERfsef0','0')==True and search('','a')==False and search('cbzeycuzbvyzuvb','a')==False and search('cbsducsvdbcyts','c')==True and search('dbzeducvbzy','y')==True and search('xqvsgxcutvy','u')==True
| false |
ead2ade9-6c50-44a4-98f3-1d781d45a0f5
| 2,016 |
23,275 |
def fibonacci(n):
if n == 0:
return 0
elif 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
| true |
ead2ade9-6c50-44a4-98f3-1d781d45a0f5
| 2,016 |
21,213 |
def fibonacci(n):
a = [0, 1, 1, 2, 3, 5, 8, 13, 21, 34]
return a[n]
|
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 |
08b41ad4-ecde-43b9-b629-6ff77ac435fc
| 2,016 |
22,091 |
def search(str, letter):
for item in str:
return True
return False
|
search_recur
|
search
|
Recursively search for a letter in a string
|
assert search('','0')==False and search('0','0')==True and search('ERFE0Rfsef','0')==True and search('ERFERfsef0','0')==True and search('','a')==False and search('cbzeycuzbvyzuvb','a')==False and search('cbsducsvdbcyts','c')==True and search('dbzeducvbzy','y')==True and search('xqvsgxcutvy','u')==True
| false |
08b41ad4-ecde-43b9-b629-6ff77ac435fc
| 2,016 |
25,375 |
def index(str, letter, pos):
if pos == len(str):
return -1
elif str[pos] == letter:
return pos
else:
return index(str, letter, pos + 1)
|
index_recur
|
index
|
Recursively search for the position of letter in str, return -1 if it is not there.
|
assert index('','0',0)==-1 and index('0','0',0)==0 and index('a','8',0)==-1 and index('tV2','2',0)==2
| true |
08b41ad4-ecde-43b9-b629-6ff77ac435fc
| 2,016 |
39,358 |
def fibonacci(n):
a = [0, 1, 1, 2, 3, 5, 8, 13, 21, 34]
return a[n]
|
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 |
08b41ad4-ecde-43b9-b629-6ff77ac435fc
| 2,016 |
34,667 |
def search(str, letter):
for item in str:
return True
return False
|
search_recur
|
search
|
Recursively search for a letter in a string
|
assert search('','0')==False and search('0','0')==True and search('ERFE0Rfsef','0')==True and search('ERFERfsef0','0')==True and search('','a')==False and search('cbzeycuzbvyzuvb','a')==False and search('cbsducsvdbcyts','c')==True and search('dbzeducvbzy','y')==True and search('xqvsgxcutvy','u')==True
| false |
08b41ad4-ecde-43b9-b629-6ff77ac435fc
| 2,016 |
1,196 |
def index(str, letter, pos):
if pos == len(str):
return -1
elif str[pos] == letter:
return pos
else:
return index(str, letter, pos + 1)
|
index_recur
|
index
|
Recursively search for the position of letter in str, return -1 if it is not there.
|
assert index('','0',0)==-1 and index('0','0',0)==0 and index('a','8',0)==-1 and index('tV2','2',0)==2
| true |
08b41ad4-ecde-43b9-b629-6ff77ac435fc
| 2,016 |
13,808 |
def index(str, letter, pos):
if pos == len(str):
return -1
elif str[pos] == letter:
return pos
else:
return index(str, letter, pos + 1)
|
index_recur
|
index
|
Recursively search for the position of letter in str, return -1 if it is not there.
|
assert index('','0',0)==-1 and index('0','0',0)==0 and index('a','8',0)==-1 and index('tV2','2',0)==2
| true |
08b41ad4-ecde-43b9-b629-6ff77ac435fc
| 2,016 |
36,914 |
def fibonacci(n):
a = [0, 1, 1, 2, 3, 5, 8, 13, 21, 34]
return a[n]
|
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 |
08b41ad4-ecde-43b9-b629-6ff77ac435fc
| 2,016 |
33,317 |
def search(str, letter):
for item in str:
return True
return False
|
search_recur
|
search
|
Recursively search for a letter in a string
|
assert search('','0')==False and search('0','0')==True and search('ERFE0Rfsef','0')==True and search('ERFERfsef0','0')==True and search('','a')==False and search('cbzeycuzbvyzuvb','a')==False and search('cbsducsvdbcyts','c')==True and search('dbzeducvbzy','y')==True and search('xqvsgxcutvy','u')==True
| false |
08b41ad4-ecde-43b9-b629-6ff77ac435fc
| 2,016 |
40,119 |
def index(str, letter, pos):
if pos == len(str):
return -1
elif str[pos] == letter:
return pos
else:
return index(str, letter, pos + 1)
|
index_recur
|
index
|
Recursively search for the position of letter in str, return -1 if it is not there.
|
assert index('','0',0)==-1 and index('0','0',0)==0 and index('a','8',0)==-1 and index('tV2','2',0)==2
| true |
08b41ad4-ecde-43b9-b629-6ff77ac435fc
| 2,016 |
14,918 |
def index(str, letter, pos):
if pos == len(str):
return -1
elif str[pos] == letter:
return pos
else:
return index(str, letter, pos + 1)
|
index_recur
|
index
|
Recursively search for the position of letter in str, return -1 if it is not there.
|
assert index('','0',0)==-1 and index('0','0',0)==0 and index('a','8',0)==-1 and index('tV2','2',0)==2
| true |
08b41ad4-ecde-43b9-b629-6ff77ac435fc
| 2,016 |
26,488 |
def fibonacci(n):
a = [0, 1, 1, 2, 3, 5, 8, 13, 21, 34]
return a[n]
|
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 |
08b41ad4-ecde-43b9-b629-6ff77ac435fc
| 2,016 |
3,492 |
def fibonacci(n):
a = [0, 1, 1, 2, 3, 5, 8, 13, 21, 34]
return a[n]
|
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 |
08b41ad4-ecde-43b9-b629-6ff77ac435fc
| 2,016 |
33,724 |
def index(str, letter, pos):
if pos == len(str):
return -1
elif str[pos] == letter:
return pos
else:
return index(str, letter, pos + 1)
|
index_recur
|
index
|
Recursively search for the position of letter in str, return -1 if it is not there.
|
assert index('','0',0)==-1 and index('0','0',0)==0 and index('a','8',0)==-1 and index('tV2','2',0)==2
| true |
08b41ad4-ecde-43b9-b629-6ff77ac435fc
| 2,016 |
38,029 |
def search(str, letter):
for item in str:
if item == letter:
return True
return False
|
search_recur
|
search
|
Recursively search for a letter in a string
|
assert search('','0')==False and search('0','0')==True and search('ERFE0Rfsef','0')==True and search('ERFERfsef0','0')==True and search('','a')==False and search('cbzeycuzbvyzuvb','a')==False and search('cbsducsvdbcyts','c')==True and search('dbzeducvbzy','y')==True and search('xqvsgxcutvy','u')==True
| true |
08b41ad4-ecde-43b9-b629-6ff77ac435fc
| 2,016 |
24,860 |
def search(str, letter):
for item in str:
if item == letter:
return True
return False
|
search_recur
|
search
|
Recursively search for a letter in a string
|
assert search('','0')==False and search('0','0')==True and search('ERFE0Rfsef','0')==True and search('ERFERfsef0','0')==True and search('','a')==False and search('cbzeycuzbvyzuvb','a')==False and search('cbsducsvdbcyts','c')==True and search('dbzeducvbzy','y')==True and search('xqvsgxcutvy','u')==True
| true |
08b41ad4-ecde-43b9-b629-6ff77ac435fc
| 2,016 |
12,618 |
def search(str, letter):
for item in str:
if item == letter:
return True
return False
|
search_recur
|
search
|
Recursively search for a letter in a string
|
assert search('','0')==False and search('0','0')==True and search('ERFE0Rfsef','0')==True and search('ERFERfsef0','0')==True and search('','a')==False and search('cbzeycuzbvyzuvb','a')==False and search('cbsducsvdbcyts','c')==True and search('dbzeducvbzy','y')==True and search('xqvsgxcutvy','u')==True
| true |
08b41ad4-ecde-43b9-b629-6ff77ac435fc
| 2,016 |
39,272 |
def fibonacci(n):
a = [0, 1, 1, 2, 3, 5, 8, 13, 21, 34]
return a[n]
|
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 |
08b41ad4-ecde-43b9-b629-6ff77ac435fc
| 2,016 |
30,851 |
def search(str, letter):
if letter in str:
print('True')
else:
print('False')
|
search_iter
|
search
|
Iteratively search for a letter in a string
|
assert search('','0')==False and search('0','0')==True and search('ERFE0Rfsef','0')==True and search('ERFERfsef0','0')==True and search('','a')==False and search('cbzeycuzbvyzuvb','a')==False and search('cbsducsvdbcyts','c')==True and search('dbzeducvbzy','y')==True and search('xqvsgxcutvy','u')==True
| false |
2b978ca4-e1a6-4660-9bf9-39da09a92282
| 2,016 |
12,299 |
def search(str, letter):
if letter in str:
return 'True'
else:
return 'False'
|
search_iter
|
search
|
Iteratively search for a letter in a string
|
assert search('','0')==False and search('0','0')==True and search('ERFE0Rfsef','0')==True and search('ERFERfsef0','0')==True and search('','a')==False and search('cbzeycuzbvyzuvb','a')==False and search('cbsducsvdbcyts','c')==True and search('dbzeducvbzy','y')==True and search('xqvsgxcutvy','u')==True
| false |
2b978ca4-e1a6-4660-9bf9-39da09a92282
| 2,016 |
20,562 |
def fibonacci(n):
a = [0, 1, 1, 2, 3, 5, 8, 13, 21, 34]
return a[n]
|
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 |
2bcea2a1-925b-4db5-8403-2d8af9d0bb46
| 2,016 |
6,826 |
def index(str, letter):
i = 0
while i < len(str):
if str[i] == letter:
return i
i += 1
return index(str, letter, i - 1)
|
index_recur
|
index
|
Recursively search for the position of letter in str, return -1 if it is not there.
|
assert index('','0',0)==-1 and index('0','0',0)==0 and index('a','8',0)==-1 and index('tV2','2',0)==2
| false |
2bcea2a1-925b-4db5-8403-2d8af9d0bb46
| 2,016 |
25,300 |
def search(str, letter):
for n in str:
if n == letter:
return True
return False
|
search_recur
|
search
|
Recursively search for a letter in a string
|
assert search('','0')==False and search('0','0')==True and search('ERFE0Rfsef','0')==True and search('ERFERfsef0','0')==True and search('','a')==False and search('cbzeycuzbvyzuvb','a')==False and search('cbsducsvdbcyts','c')==True and search('dbzeducvbzy','y')==True and search('xqvsgxcutvy','u')==True
| true |
2bcea2a1-925b-4db5-8403-2d8af9d0bb46
| 2,016 |
16,209 |
def search(str, letter):
for n in str:
if n == letter:
return True
return False
|
search_recur
|
search
|
Recursively search for a letter in a string
|
assert search('','0')==False and search('0','0')==True and search('ERFE0Rfsef','0')==True and search('ERFERfsef0','0')==True and search('','a')==False and search('cbzeycuzbvyzuvb','a')==False and search('cbsducsvdbcyts','c')==True and search('dbzeducvbzy','y')==True and search('xqvsgxcutvy','u')==True
| true |
2bcea2a1-925b-4db5-8403-2d8af9d0bb46
| 2,016 |
8,669 |
def index(str, letter):
i = 0
while i < len(str):
if str[i] == letter:
return i
i += 1
return index(str, letter, -1)
|
index_recur
|
index
|
Recursively search for the position of letter in str, return -1 if it is not there.
|
assert index('','0',0)==-1 and index('0','0',0)==0 and index('a','8',0)==-1 and index('tV2','2',0)==2
| false |
2bcea2a1-925b-4db5-8403-2d8af9d0bb46
| 2,016 |
22,079 |
def fibonacci(n):
a = [0, 1, 1, 2, 3, 5, 8, 13, 21, 34]
return a[n]
|
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 |
2bcea2a1-925b-4db5-8403-2d8af9d0bb46
| 2,016 |
21,654 |
def search(str, letter):
for n in str:
if n == letter:
return True
return False
|
search_recur
|
search
|
Recursively search for a letter in a string
|
assert search('','0')==False and search('0','0')==True and search('ERFE0Rfsef','0')==True and search('ERFERfsef0','0')==True and search('','a')==False and search('cbzeycuzbvyzuvb','a')==False and search('cbsducsvdbcyts','c')==True and search('dbzeducvbzy','y')==True and search('xqvsgxcutvy','u')==True
| true |
2bcea2a1-925b-4db5-8403-2d8af9d0bb46
| 2,016 |
29,723 |
def index(str, letter):
i = 0
while i < len(str):
if str[i] == letter:
return i
i += 1
return index(str, letter, i - 1)
|
index_recur
|
index
|
Recursively search for the position of letter in str, return -1 if it is not there.
|
assert index('','0',0)==-1 and index('0','0',0)==0 and index('a','8',0)==-1 and index('tV2','2',0)==2
| false |
2bcea2a1-925b-4db5-8403-2d8af9d0bb46
| 2,016 |
37,711 |
def fibonacci(n):
a = [0, 1, 1, 2, 3, 5, 8, 13, 21, 34]
return a[n]
|
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 |
2bcea2a1-925b-4db5-8403-2d8af9d0bb46
| 2,016 |
15,064 |
def search(str, letter):
for n in str:
if n == letter:
return True
return False
|
search_recur
|
search
|
Recursively search for a letter in a string
|
assert search('','0')==False and search('0','0')==True and search('ERFE0Rfsef','0')==True and search('ERFERfsef0','0')==True and search('','a')==False and search('cbzeycuzbvyzuvb','a')==False and search('cbsducsvdbcyts','c')==True and search('dbzeducvbzy','y')==True and search('xqvsgxcutvy','u')==True
| true |
2bcea2a1-925b-4db5-8403-2d8af9d0bb46
| 2,016 |
23,787 |
def index(str, letter):
i = 0
while i < len(str):
if str[i] == letter:
return i
i += 1
return index(str, letter, -1)
|
index_recur
|
index
|
Recursively search for the position of letter in str, return -1 if it is not there.
|
assert index('','0',0)==-1 and index('0','0',0)==0 and index('a','8',0)==-1 and index('tV2','2',0)==2
| false |
2bcea2a1-925b-4db5-8403-2d8af9d0bb46
| 2,016 |
776 |
def fibonacci(n):
a = [0, 1, 1, 2, 3, 5, 8, 13, 21, 34]
return a[n]
|
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 |
2bcea2a1-925b-4db5-8403-2d8af9d0bb46
| 2,016 |
6,867 |
def search(str, letter):
for n in str:
if n == letter:
return True
return False
|
search_recur
|
search
|
Recursively search for a letter in a string
|
assert search('','0')==False and search('0','0')==True and search('ERFE0Rfsef','0')==True and search('ERFERfsef0','0')==True and search('','a')==False and search('cbzeycuzbvyzuvb','a')==False and search('cbsducsvdbcyts','c')==True and search('dbzeducvbzy','y')==True and search('xqvsgxcutvy','u')==True
| true |
2bcea2a1-925b-4db5-8403-2d8af9d0bb46
| 2,016 |
4,939 |
def index(str, letter):
i = 0
while i < len(str):
if str[i] == letter:
return i
i += 1
return index(str, letter, -1)
|
index_recur
|
index
|
Recursively search for the position of letter in str, return -1 if it is not there.
|
assert index('','0',0)==-1 and index('0','0',0)==0 and index('a','8',0)==-1 and index('tV2','2',0)==2
| false |
2bcea2a1-925b-4db5-8403-2d8af9d0bb46
| 2,016 |
13,335 |
def index(str, letter):
i = 0
while i < len(str):
if str[i] == letter:
return i
i += 1
return index(str, letter, -1)
|
index_recur
|
index
|
Recursively search for the position of letter in str, return -1 if it is not there.
|
assert index('','0',0)==-1 and index('0','0',0)==0 and index('a','8',0)==-1 and index('tV2','2',0)==2
| false |
2bcea2a1-925b-4db5-8403-2d8af9d0bb46
| 2,016 |
10,856 |
def fibonacci(n):
a = [0, 1, 1, 2, 3, 5, 8, 13, 21, 34]
return a[n]
|
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 |
2bcea2a1-925b-4db5-8403-2d8af9d0bb46
| 2,016 |
12,864 |
def search(str, letter):
for n in str:
if n == letter:
return True
return False
|
search_recur
|
search
|
Recursively search for a letter in a string
|
assert search('','0')==False and search('0','0')==True and search('ERFE0Rfsef','0')==True and search('ERFERfsef0','0')==True and search('','a')==False and search('cbzeycuzbvyzuvb','a')==False and search('cbsducsvdbcyts','c')==True and search('dbzeducvbzy','y')==True and search('xqvsgxcutvy','u')==True
| true |
2bcea2a1-925b-4db5-8403-2d8af9d0bb46
| 2,016 |
7,474 |
def index(str, letter):
if letter in str:
pos = str.index(letter)
return pos
else:
return '-1'
|
index_iter
|
index
|
Iteratively search for the position of letter in str, return -1 if it is not there.
|
assert index('','0')==-1 and index('0','0')==0 and index('11','1')==0
| false |
2b978ca4-e1a6-4660-9bf9-39da09a92282
| 2,016 |
22,277 |
def search(str, letter):
if letter in str:
return 'True'
else:
return 'False'
|
search_iter
|
search
|
Iteratively search for a letter in a string
|
assert search('','0')==False and search('0','0')==True and search('ERFE0Rfsef','0')==True and search('ERFERfsef0','0')==True and search('','a')==False and search('cbzeycuzbvyzuvb','a')==False and search('cbsducsvdbcyts','c')==True and search('dbzeducvbzy','y')==True and search('xqvsgxcutvy','u')==True
| false |
2b978ca4-e1a6-4660-9bf9-39da09a92282
| 2,016 |
28,210 |
def fibonacci(n):
a = [0, 1, 1, 2, 3, 5, 8, 13, 21, 34]
return a[n]
|
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 |
2bcea2a1-925b-4db5-8403-2d8af9d0bb46
| 2,016 |
23,116 |
def index(str, letter, pos):
if pos == len(str):
return -1
i += 1
elif str[pos] == letter:
return pos
else:
return inddex(str, letter, pos + 1)
|
index_recur
|
index
|
Recursively search for the position of letter in str, return -1 if it is not there.
|
assert index('','0',0)==-1 and index('0','0',0)==0 and index('a','8',0)==-1 and index('tV2','2',0)==2
| false |
2bcea2a1-925b-4db5-8403-2d8af9d0bb46
| 2,016 |
10,451 |
def search(str, letter):
for n in str:
if n == letter:
return True
return False
|
search_recur
|
search
|
Recursively search for a letter in a string
|
assert search('','0')==False and search('0','0')==True and search('ERFE0Rfsef','0')==True and search('ERFERfsef0','0')==True and search('','a')==False and search('cbzeycuzbvyzuvb','a')==False and search('cbsducsvdbcyts','c')==True and search('dbzeducvbzy','y')==True and search('xqvsgxcutvy','u')==True
| true |
2bcea2a1-925b-4db5-8403-2d8af9d0bb46
| 2,016 |
30,118 |
def fibonacci(n):
a = [0, 1, 1, 2, 3, 5, 8, 13, 21, 34]
return a[n]
|
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 |
2bcea2a1-925b-4db5-8403-2d8af9d0bb46
| 2,016 |
14,154 |
def search(str, letter):
for n in str:
if n == letter:
return True
return False
|
search_recur
|
search
|
Recursively search for a letter in a string
|
assert search('','0')==False and search('0','0')==True and search('ERFE0Rfsef','0')==True and search('ERFERfsef0','0')==True and search('','a')==False and search('cbzeycuzbvyzuvb','a')==False and search('cbsducsvdbcyts','c')==True and search('dbzeducvbzy','y')==True and search('xqvsgxcutvy','u')==True
| true |
2bcea2a1-925b-4db5-8403-2d8af9d0bb46
| 2,016 |
20,720 |
def index(str, letter, pos):
if pos == len(str):
return -1
i += 1
elif str[pos] == letter:
return pos
else:
return index(str, letter, pos + 1)
|
index_recur
|
index
|
Recursively search for the position of letter in str, return -1 if it is not there.
|
assert index('','0',0)==-1 and index('0','0',0)==0 and index('a','8',0)==-1 and index('tV2','2',0)==2
| true |
2bcea2a1-925b-4db5-8403-2d8af9d0bb46
| 2,016 |
26,882 |
def fibonacci(n):
a = [0, 1, 1, 2, 3, 5, 8, 13, 21, 34]
return a[n]
|
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 |
2bcea2a1-925b-4db5-8403-2d8af9d0bb46
| 2,016 |
31,177 |
def fibonacci(n):
a = [0, 1, 1, 2, 3, 5, 8, 13, 21, 34]
return a[n]
|
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 |
2bcea2a1-925b-4db5-8403-2d8af9d0bb46
| 2,016 |
4,137 |
def search(str, letter):
for n in str:
if n == letter:
return True
return False
|
search_recur
|
search
|
Recursively search for a letter in a string
|
assert search('','0')==False and search('0','0')==True and search('ERFE0Rfsef','0')==True and search('ERFERfsef0','0')==True and search('','a')==False and search('cbzeycuzbvyzuvb','a')==False and search('cbsducsvdbcyts','c')==True and search('dbzeducvbzy','y')==True and search('xqvsgxcutvy','u')==True
| true |
2bcea2a1-925b-4db5-8403-2d8af9d0bb46
| 2,016 |
6,205 |
def index(str, letter, pos):
if pos == len(str):
return -1
i += 1
elif str[pos] == letter:
return pos
else:
return index(str, letter, pos + 1)
|
index_recur
|
index
|
Recursively search for the position of letter in str, return -1 if it is not there.
|
assert index('','0',0)==-1 and index('0','0',0)==0 and index('a','8',0)==-1 and index('tV2','2',0)==2
| true |
2bcea2a1-925b-4db5-8403-2d8af9d0bb46
| 2,016 |
42,169 |
def index(str, letter, pos):
if pos == len(str):
return -1
i += 1
elif str[pos] == letter:
return pos
else:
return index(str, letter, pos + 1)
|
index_recur
|
index
|
Recursively search for the position of letter in str, return -1 if it is not there.
|
assert index('','0',0)==-1 and index('0','0',0)==0 and index('a','8',0)==-1 and index('tV2','2',0)==2
| true |
2bcea2a1-925b-4db5-8403-2d8af9d0bb46
| 2,016 |
33,406 |
def search(str, letter):
for n in str:
if n == letter:
return True
return False
|
search_recur
|
search
|
Recursively search for a letter in a string
|
assert search('','0')==False and search('0','0')==True and search('ERFE0Rfsef','0')==True and search('ERFERfsef0','0')==True and search('','a')==False and search('cbzeycuzbvyzuvb','a')==False and search('cbsducsvdbcyts','c')==True and search('dbzeducvbzy','y')==True and search('xqvsgxcutvy','u')==True
| true |
2bcea2a1-925b-4db5-8403-2d8af9d0bb46
| 2,016 |
29,834 |
def search(string, letter):
i = 0
while i < len(string):
if letter == string[i]:
print('True')
i = i + 1
print('False')
|
search_iter
|
search
|
Iteratively search for a letter in a string
|
assert search('','0')==False and search('0','0')==True and search('ERFE0Rfsef','0')==True and search('ERFERfsef0','0')==True and search('','a')==False and search('cbzeycuzbvyzuvb','a')==False and search('cbsducsvdbcyts','c')==True and search('dbzeducvbzy','y')==True and search('xqvsgxcutvy','u')==True
| false |
8b835803-8982-477e-b017-9d6fc24a47d0
| 2,016 |
4,589 |
def search(string, letter):
i = 0
while i < len(string):
if letter == string[i]:
return 'True'
i = i + 1
return 'False'
|
search_iter
|
search
|
Iteratively search for a letter in a string
|
assert search('','0')==False and search('0','0')==True and search('ERFE0Rfsef','0')==True and search('ERFERfsef0','0')==True and search('','a')==False and search('cbzeycuzbvyzuvb','a')==False and search('cbsducsvdbcyts','c')==True and search('dbzeducvbzy','y')==True and search('xqvsgxcutvy','u')==True
| false |
8b835803-8982-477e-b017-9d6fc24a47d0
| 2,016 |
42,435 |
def index(string, letter):
i = 0
while i < len(string):
if letter == string[i]:
return i
i = i + 1
|
index_iter
|
index
|
Iteratively search for the position of letter in str, return -1 if it is not there.
|
assert index('','0')==-1 and index('0','0')==0 and index('11','1')==0
| false |
8b835803-8982-477e-b017-9d6fc24a47d0
| 2,016 |
38,595 |
def search(string, letter):
i = 0
while i < len(string):
if letter == string[i]:
return 'True'
i = i + 1
return 'False'
|
search_iter
|
search
|
Iteratively search for a letter in a string
|
assert search('','0')==False and search('0','0')==True and search('ERFE0Rfsef','0')==True and search('ERFERfsef0','0')==True and search('','a')==False and search('cbzeycuzbvyzuvb','a')==False and search('cbsducsvdbcyts','c')==True and search('dbzeducvbzy','y')==True and search('xqvsgxcutvy','u')==True
| false |
8b835803-8982-477e-b017-9d6fc24a47d0
| 2,016 |
1,727 |
def index(string, letter):
i = 0
while i < len(string):
if letter == string[i]:
return i
i = i + 1
return '-1'
|
index_iter
|
index
|
Iteratively search for the position of letter in str, return -1 if it is not there.
|
assert index('','0')==-1 and index('0','0')==0 and index('11','1')==0
| false |
8b835803-8982-477e-b017-9d6fc24a47d0
| 2,016 |
24,323 |
def search(string, letter):
i = 0
while i < len(string):
if letter == string[i]:
return 'True'
i = i + 1
return 'False'
|
search_iter
|
search
|
Iteratively search for a letter in a string
|
assert search('','0')==False and search('0','0')==True and search('ERFE0Rfsef','0')==True and search('ERFERfsef0','0')==True and search('','a')==False and search('cbzeycuzbvyzuvb','a')==False and search('cbsducsvdbcyts','c')==True and search('dbzeducvbzy','y')==True and search('xqvsgxcutvy','u')==True
| false |
8b835803-8982-477e-b017-9d6fc24a47d0
| 2,016 |
32,762 |
def index(string, letter):
i = 0
while i < len(string):
if letter == string[i]:
return i
i = i + 1
return '-1'
|
index_iter
|
index
|
Iteratively search for the position of letter in str, return -1 if it is not there.
|
assert index('','0')==-1 and index('0','0')==0 and index('11','1')==0
| false |
8b835803-8982-477e-b017-9d6fc24a47d0
| 2,016 |
36,738 |
def index(string, letter):
i = 0
while i < len(string):
if letter == string[i]:
return i
i = i + 1
return '-1'
|
index_iter
|
index
|
Iteratively search for the position of letter in str, return -1 if it is not there.
|
assert index('','0')==-1 and index('0','0')==0 and index('11','1')==0
| false |
8b835803-8982-477e-b017-9d6fc24a47d0
| 2,016 |
23,914 |
def search(string, letter):
i = 0
while i < len(string):
if letter == string[i]:
return 'True'
i = i + 1
return 'False'
|
search_iter
|
search
|
Iteratively search for a letter in a string
|
assert search('','0')==False and search('0','0')==True and search('ERFE0Rfsef','0')==True and search('ERFERfsef0','0')==True and search('','a')==False and search('cbzeycuzbvyzuvb','a')==False and search('cbsducsvdbcyts','c')==True and search('dbzeducvbzy','y')==True and search('xqvsgxcutvy','u')==True
| false |
8b835803-8982-477e-b017-9d6fc24a47d0
| 2,016 |
2,186 |
def index(string, letter):
i = 0
while i < len(string):
if letter == string[i]:
return i
i = i + 1
return '-1'
|
index_iter
|
index
|
Iteratively search for the position of letter in str, return -1 if it is not there.
|
assert index('','0')==-1 and index('0','0')==0 and index('11','1')==0
| false |
8b835803-8982-477e-b017-9d6fc24a47d0
| 2,016 |
11,618 |
def search(string, letter):
i = 0
while i < len(string):
if letter == string[i]:
return 'True'
i = i + 1
return 'False'
|
search_iter
|
search
|
Iteratively search for a letter in a string
|
assert search('','0')==False and search('0','0')==True and search('ERFE0Rfsef','0')==True and search('ERFERfsef0','0')==True and search('','a')==False and search('cbzeycuzbvyzuvb','a')==False and search('cbsducsvdbcyts','c')==True and search('dbzeducvbzy','y')==True and search('xqvsgxcutvy','u')==True
| false |
8b835803-8982-477e-b017-9d6fc24a47d0
| 2,016 |
42,139 |
def search(string, letter):
i = 0
while i < len(string):
if letter == string[i]:
return 'True'
i = i + 1
return 'False'
|
search_iter
|
search
|
Iteratively search for a letter in a string
|
assert search('','0')==False and search('0','0')==True and search('ERFE0Rfsef','0')==True and search('ERFERfsef0','0')==True and search('','a')==False and search('cbzeycuzbvyzuvb','a')==False and search('cbsducsvdbcyts','c')==True and search('dbzeducvbzy','y')==True and search('xqvsgxcutvy','u')==True
| false |
8b835803-8982-477e-b017-9d6fc24a47d0
| 2,016 |
32,064 |
def index(str, letter):
if letter in str:
pos = str.index(letter)
return pos
else:
return '-1'
|
index_iter
|
index
|
Iteratively search for the position of letter in str, return -1 if it is not there.
|
assert index('','0')==-1 and index('0','0')==0 and index('11','1')==0
| false |
2b978ca4-e1a6-4660-9bf9-39da09a92282
| 2,016 |
3,335 |
def fibonacci(n):
fib = [0, 1, 1, 2, 3, 5, 8, 13, 21, 34]
while fib[n]:
num = fib[n - 1] + fib[n - 2]
return num
|
fibonacci_iter
|
fibonacci
|
Iteratively compute the value of the fibonacci series at position n.
|
assert fibonacci(1)==1 and fibonacci(41)==165580141 and fibonacci(3)==2 and fibonacci(91)==4660046610375530309
| false |
2b978ca4-e1a6-4660-9bf9-39da09a92282
| 2,016 |
5,277 |
def search(str, letter):
if letter in str:
return 'True'
else:
return 'False'
|
search_iter
|
search
|
Iteratively search for a letter in a string
|
assert search('','0')==False and search('0','0')==True and search('ERFE0Rfsef','0')==True and search('ERFERfsef0','0')==True and search('','a')==False and search('cbzeycuzbvyzuvb','a')==False and search('cbsducsvdbcyts','c')==True and search('dbzeducvbzy','y')==True and search('xqvsgxcutvy','u')==True
| false |
2b978ca4-e1a6-4660-9bf9-39da09a92282
| 2,016 |
36,300 |
def index(str, letter):
if letter in str:
pos = str.index(letter)
return pos
else:
return '-1'
|
index_iter
|
index
|
Iteratively search for the position of letter in str, return -1 if it is not there.
|
assert index('','0')==-1 and index('0','0')==0 and index('11','1')==0
| false |
2b978ca4-e1a6-4660-9bf9-39da09a92282
| 2,016 |
40,308 |
def fibonacci(n):
fib = [0, 1, 1, 2, 3, 5, 8, 13, 21, 34]
while fib[n]:
if n == 0:
num = fib[0]
elif n == 1:
num = fib[1]
else:
num = fib[n - 1] + fib[n - 2]
return num
|
fibonacci_iter
|
fibonacci
|
Iteratively compute the value of the fibonacci series at position n.
|
assert fibonacci(1)==1 and fibonacci(41)==165580141 and fibonacci(3)==2 and fibonacci(91)==4660046610375530309
| false |
2b978ca4-e1a6-4660-9bf9-39da09a92282
| 2,016 |
8,106 |
def search(str, letter):
if letter in str:
return 'True'
else:
return 'False'
|
search_iter
|
search
|
Iteratively search for a letter in a string
|
assert search('','0')==False and search('0','0')==True and search('ERFE0Rfsef','0')==True and search('ERFERfsef0','0')==True and search('','a')==False and search('cbzeycuzbvyzuvb','a')==False and search('cbsducsvdbcyts','c')==True and search('dbzeducvbzy','y')==True and search('xqvsgxcutvy','u')==True
| false |
2b978ca4-e1a6-4660-9bf9-39da09a92282
| 2,016 |
15,884 |
def search(str, letter):
if letter in str:
return 'True'
else:
return 'False'
|
search_iter
|
search
|
Iteratively search for a letter in a string
|
assert search('','0')==False and search('0','0')==True and search('ERFE0Rfsef','0')==True and search('ERFERfsef0','0')==True and search('','a')==False and search('cbzeycuzbvyzuvb','a')==False and search('cbsducsvdbcyts','c')==True and search('dbzeducvbzy','y')==True and search('xqvsgxcutvy','u')==True
| false |
2b978ca4-e1a6-4660-9bf9-39da09a92282
| 2,016 |
32,951 |
def fibonacci(n):
fib = [0, 1, 1, 2, 3, 5, 8, 13, 21, 34]
if n == 0:
num = 0
elif n == 1:
num = fib[1]
else:
num = fib[n - 1] + fib[n - 2]
return num
|
fibonacci_iter
|
fibonacci
|
Iteratively compute the value of the fibonacci series at position n.
|
assert fibonacci(1)==1 and fibonacci(41)==165580141 and fibonacci(3)==2 and fibonacci(91)==4660046610375530309
| false |
2b978ca4-e1a6-4660-9bf9-39da09a92282
| 2,016 |
1,569 |
def index(str, letter):
if letter in str:
pos = str.index(letter)
return pos
else:
return '-1'
|
index_iter
|
index
|
Iteratively search for the position of letter in str, return -1 if it is not there.
|
assert index('','0')==-1 and index('0','0')==0 and index('11','1')==0
| false |
2b978ca4-e1a6-4660-9bf9-39da09a92282
| 2,016 |
33,707 |
def fibonacci(n):
fib = [0, 1, 1, 2, 3, 5, 8, 13, 21, 34]
if n == 0:
num = fib[0]
elif n == 1:
num = fib[1]
else:
num = fib[n - 1] + fib[n - 2]
return num
|
fibonacci_iter
|
fibonacci
|
Iteratively compute the value of the fibonacci series at position n.
|
assert fibonacci(1)==1 and fibonacci(41)==165580141 and fibonacci(3)==2 and fibonacci(91)==4660046610375530309
| false |
2b978ca4-e1a6-4660-9bf9-39da09a92282
| 2,016 |
5,903 |
def fibonacci(n):
fib = [0, 1, 1, 2, 3, 5, 8, 13, 21, 34]
if n == 0:
num = fib[0]
elif n == 1:
num = fib[1]
else:
num = fib[n - 1] + fib[n - 2]
return num
|
fibonacci_iter
|
fibonacci
|
Iteratively compute the value of the fibonacci series at position n.
|
assert fibonacci(1)==1 and fibonacci(41)==165580141 and fibonacci(3)==2 and fibonacci(91)==4660046610375530309
| false |
2b978ca4-e1a6-4660-9bf9-39da09a92282
| 2,016 |
10,147 |
def index(str, letter):
if letter in str:
pos = str.index(letter)
return pos
else:
return '-1'
|
index_iter
|
index
|
Iteratively search for the position of letter in str, return -1 if it is not there.
|
assert index('','0')==-1 and index('0','0')==0 and index('11','1')==0
| false |
2b978ca4-e1a6-4660-9bf9-39da09a92282
| 2,016 |
22,793 |
def search(str, letter):
if letter in str:
return 'True'
else:
return 'False'
|
search_iter
|
search
|
Iteratively search for a letter in a string
|
assert search('','0')==False and search('0','0')==True and search('ERFE0Rfsef','0')==True and search('ERFERfsef0','0')==True and search('','a')==False and search('cbzeycuzbvyzuvb','a')==False and search('cbsducsvdbcyts','c')==True and search('dbzeducvbzy','y')==True and search('xqvsgxcutvy','u')==True
| false |
2b978ca4-e1a6-4660-9bf9-39da09a92282
| 2,016 |
7,019 |
def index(str, letter):
if letter in str:
pos = str.index(letter)
return pos
else:
return '-1'
|
index_iter
|
index
|
Iteratively search for the position of letter in str, return -1 if it is not there.
|
assert index('','0')==-1 and index('0','0')==0 and index('11','1')==0
| false |
2b978ca4-e1a6-4660-9bf9-39da09a92282
| 2,016 |
4,330 |
def search(str, letter):
if letter in str:
return 'True'
else:
return 'False'
|
search_iter
|
search
|
Iteratively search for a letter in a string
|
assert search('','0')==False and search('0','0')==True and search('ERFE0Rfsef','0')==True and search('ERFERfsef0','0')==True and search('','a')==False and search('cbzeycuzbvyzuvb','a')==False and search('cbsducsvdbcyts','c')==True and search('dbzeducvbzy','y')==True and search('xqvsgxcutvy','u')==True
| false |
2b978ca4-e1a6-4660-9bf9-39da09a92282
| 2,016 |
32,605 |
def index(str, letter):
if letter in str:
pos = str.index(letter)
return pos
else:
return '-1'
|
index_recur
|
index
|
Recursively search for the position of letter in str, return -1 if it is not there.
|
assert index('','0',0)==-1 and index('0','0',0)==0 and index('a','8',0)==-1 and index('tV2','2',0)==2
| false |
2b978ca4-e1a6-4660-9bf9-39da09a92282
| 2,016 |
27,946 |
def index(str, letter):
if letter in str:
pos = str.index(letter)
return pos
else:
return '-1'
|
index_recur
|
index
|
Recursively search for the position of letter in str, return -1 if it is not there.
|
assert index('','0',0)==-1 and index('0','0',0)==0 and index('a','8',0)==-1 and index('tV2','2',0)==2
| false |
2b978ca4-e1a6-4660-9bf9-39da09a92282
| 2,016 |
39,806 |
def fibonacci(n):
fib = [0, 1, 1, 2, 3, 5, 8, 13, 21, 34]
if n == 0:
num = fib[0]
elif n == 1:
num = fib[1]
else:
num = fib[n - 1] + fib[n - 2]
return num
|
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 |
2b978ca4-e1a6-4660-9bf9-39da09a92282
| 2,016 |
20,235 |
def search(str, letter):
if letter in str:
return 'True'
else:
return 'False'
|
search_recur
|
search
|
Recursively search for a letter in a string
|
assert search('','0')==False and search('0','0')==True and search('ERFE0Rfsef','0')==True and search('ERFERfsef0','0')==True and search('','a')==False and search('cbzeycuzbvyzuvb','a')==False and search('cbsducsvdbcyts','c')==True and search('dbzeducvbzy','y')==True and search('xqvsgxcutvy','u')==True
| false |
2b978ca4-e1a6-4660-9bf9-39da09a92282
| 2,016 |
8,088 |
def fibonacci(n):
fib = [0, 1, 1, 2, 3, 5, 8, 13, 21, 34]
if n == 0:
num = fib[0]
elif n == 1:
num = fib[1]
else:
num = fib[n - 1] + fib[n - 2]
return num
|
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 |
2b978ca4-e1a6-4660-9bf9-39da09a92282
| 2,016 |
27,357 |
def fibonacci(n):
fib = [0, 1, 1, 2, 3, 5, 8, 13, 21, 34]
if n == 0:
num = fib[0]
elif n == 1:
num = fib[1]
else:
num = fib[n - 1] + fib[n - 2]
return num
|
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 |
2b978ca4-e1a6-4660-9bf9-39da09a92282
| 2,016 |
39,036 |
def search(str, letter):
if letter in str:
return 'True'
else:
return 'False'
|
search_recur
|
search
|
Recursively search for a letter in a string
|
assert search('','0')==False and search('0','0')==True and search('ERFE0Rfsef','0')==True and search('ERFERfsef0','0')==True and search('','a')==False and search('cbzeycuzbvyzuvb','a')==False and search('cbsducsvdbcyts','c')==True and search('dbzeducvbzy','y')==True and search('xqvsgxcutvy','u')==True
| false |
2b978ca4-e1a6-4660-9bf9-39da09a92282
| 2,016 |
8,458 |
def index(str, letter):
if letter in str:
pos = str.index(letter)
return pos
else:
return '-1'
|
index_recur
|
index
|
Recursively search for the position of letter in str, return -1 if it is not there.
|
assert index('','0',0)==-1 and index('0','0',0)==0 and index('a','8',0)==-1 and index('tV2','2',0)==2
| false |
2b978ca4-e1a6-4660-9bf9-39da09a92282
| 2,016 |
27,063 |
def search(str, letter):
if letter in str:
return 'True'
else:
return 'False'
|
search_recur
|
search
|
Recursively search for a letter in a string
|
assert search('','0')==False and search('0','0')==True and search('ERFE0Rfsef','0')==True and search('ERFERfsef0','0')==True and search('','a')==False and search('cbzeycuzbvyzuvb','a')==False and search('cbsducsvdbcyts','c')==True and search('dbzeducvbzy','y')==True and search('xqvsgxcutvy','u')==True
| false |
2b978ca4-e1a6-4660-9bf9-39da09a92282
| 2,016 |
37,490 |
def fibonacci(n):
fib = [0, 1, 1, 2, 3, 5, 8, 13, 21, 34]
if n == 0:
num = fib[0]
elif n == 1:
num = fib[1]
else:
num = fib[n - 1] + fib[n - 2]
return num
|
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 |
2b978ca4-e1a6-4660-9bf9-39da09a92282
| 2,016 |
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.