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
|
|---|---|---|---|---|---|---|---|---|
16,836 |
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 |
12,871 |
def index(str, letter, num):
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 |
11,393 |
def index(str, letter, num):
if letter in str:
pos = str.index(letter)
return pos
else:
return '-1'
index()
|
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 |
4,270 |
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()
|
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 |
17,060 |
def search(str, letter):
if letter in str:
return 'True'
else:
return 'False'
search()
|
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 |
10,737 |
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()
|
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 |
31,381 |
def index(str, letter, num):
if letter in str:
pos = str.index(letter)
return pos
else:
return '-1'
index()
|
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 |
4,567 |
def search(str, letter):
if letter in str:
return 'True'
else:
return 'False'
search()
|
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 |
12,034 |
def index(str, letter, num):
if letter in str:
pos = str.index(letter)
return pos
else:
return '-1'
index()
|
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 |
14,328 |
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()
|
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 |
19,209 |
def search(str, letter):
if letter in str:
return 'True'
else:
return 'False'
search()
|
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 |
10,257 |
def index(str, letter, num):
if letter in str:
pos = str.index(letter)
return pos
else:
return '-1'
index()
|
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 |
30,725 |
def search(str, letter):
if letter in str:
return 'True'
else:
return 'False'
search()
|
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 |
29,212 |
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()
|
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 |
22,324 |
def search(str, letter):
if letter in str:
return 'True'
else:
return 'False'
search()
|
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 |
19,748 |
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()
|
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 |
2,746 |
def search(str, letter):
if letter in str:
return 'True'
else:
return 'False'
search()
|
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 |
12,395 |
def index(str, letter, num):
if letter in str:
pos = str.index(letter)
return pos
else:
return '-1'
index()
|
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 |
18,206 |
def index(str, letter, num):
if letter in str:
pos = str.index(letter)
return pos
else:
return '-1'
index()
|
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 |
38,251 |
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()
|
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 |
41,302 |
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()
|
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 |
30,336 |
def search(str, letter):
if letter in str:
return 'True'
else:
return 'False'
search()
|
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 |
28,822 |
def index(str, letter, num):
if letter in str:
pos = str.index(letter)
return pos
else:
return '-1'
index()
|
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 |
4,393 |
def fibonacci(n):
if n == 0:
return 0
elif n == 1:
return 1
else:
a = 0
b = 1
i = 2
while i <= n:
sum1 = a + b
a = b
b = sum1
i += 1
return sum1
|
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
| true |
106d34e0-d03c-42ab-a67a-b88759ff6307
| 2,016 |
36,577 |
def index(string, letter):
i = 0
while i < len(string):
if letter == string[i]:
return 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
| true |
106d34e0-d03c-42ab-a67a-b88759ff6307
| 2,016 |
10,945 |
def search(string, letter):
i = 0
while i < len(string):
if letter == string[i]:
return 'True'
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 |
106d34e0-d03c-42ab-a67a-b88759ff6307
| 2,016 |
6,871 |
def index(string, letter):
i = 0
while i < len(string):
if letter == string[i]:
return 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
| true |
106d34e0-d03c-42ab-a67a-b88759ff6307
| 2,016 |
492 |
def search(string, letter):
i = 0
while i < len(string):
if letter == string[i]:
return 'True'
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 |
106d34e0-d03c-42ab-a67a-b88759ff6307
| 2,016 |
5,997 |
def fibonacci(n):
if n == 0:
return 0
elif n == 1:
return 1
else:
a = 0
b = 1
i = 2
while i <= n:
sum1 = a + b
a = b
b = sum1
i += 1
return sum1
|
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
| true |
106d34e0-d03c-42ab-a67a-b88759ff6307
| 2,016 |
16,352 |
def search(string, letter):
if len(string) == 0:
return 'False'
elif string[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 |
106d34e0-d03c-42ab-a67a-b88759ff6307
| 2,016 |
19,470 |
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 |
106d34e0-d03c-42ab-a67a-b88759ff6307
| 2,016 |
14,012 |
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 |
106d34e0-d03c-42ab-a67a-b88759ff6307
| 2,016 |
36,099 |
def search(string, letter):
if len(string) == 0:
return 'False'
elif string[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 |
106d34e0-d03c-42ab-a67a-b88759ff6307
| 2,016 |
19,196 |
def search(string, letter):
if len(string) == 0:
return 'False'
elif string[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 |
106d34e0-d03c-42ab-a67a-b88759ff6307
| 2,016 |
1,669 |
def index(string, letter, position):
if position == len(string):
return -1
elif string[position] == letter:
return position
else:
return index(string, letter, position + 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 |
106d34e0-d03c-42ab-a67a-b88759ff6307
| 2,016 |
30,563 |
def index(string, letter, position):
if position == len(string):
return -1
elif string[position] == letter:
return position
else:
return index(string, letter, position + 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 |
106d34e0-d03c-42ab-a67a-b88759ff6307
| 2,016 |
1,597 |
def index(string, letter, position):
if position == len(string):
return -1
elif string[position] == letter:
return position
else:
return index(string, letter, position + 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 |
106d34e0-d03c-42ab-a67a-b88759ff6307
| 2,016 |
25,893 |
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 |
106d34e0-d03c-42ab-a67a-b88759ff6307
| 2,016 |
491 |
def index(str, letter):
i = 0
while i < len(str):
if str[i] == letter:
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
| true |
7c96bda5-98ec-4cff-a3e4-0118a7fafe5d
| 2,016 |
6,518 |
def index(str, letter):
i = 0
while i < len(str):
if str[i] == letter:
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
| true |
7c96bda5-98ec-4cff-a3e4-0118a7fafe5d
| 2,016 |
35,481 |
def fibonacci(n):
i = 1
z = 0
x = 0
if n > 0:
while i < n:
x = i
i = i + z
z = x
return i
else:
return 0
|
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 |
7c96bda5-98ec-4cff-a3e4-0118a7fafe5d
| 2,016 |
17,069 |
def search(str, letter):
for item in str:
if item == letter:
return True
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
| true |
7c96bda5-98ec-4cff-a3e4-0118a7fafe5d
| 2,016 |
22,009 |
def search(str, letter):
for item in str:
if item == letter:
return True
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
| true |
7c96bda5-98ec-4cff-a3e4-0118a7fafe5d
| 2,016 |
12,509 |
def fibonacci(n):
i = 1
z = 0
x = 0
if n > 0:
while i < n:
x = i
i = i + z
z = x
return i
else:
return 0
|
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 |
7c96bda5-98ec-4cff-a3e4-0118a7fafe5d
| 2,016 |
20,531 |
def fibonacci(n):
i = 1
z = 0
x = 0
if n > 0:
while i < n:
x = i
i = i + z
z = x
return i
else:
return 0
|
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 |
7c96bda5-98ec-4cff-a3e4-0118a7fafe5d
| 2,016 |
7,107 |
def index(str, letter, x):
i = 0
while i < len(str):
if str[i] == letter:
return i
i = i + 1
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
| true |
7c96bda5-98ec-4cff-a3e4-0118a7fafe5d
| 2,016 |
12,749 |
def index(str, letter, x):
i = 0
while i < len(str):
if str[i] == letter:
return i
i = i + 1
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
| true |
7c96bda5-98ec-4cff-a3e4-0118a7fafe5d
| 2,016 |
10,816 |
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 |
7c96bda5-98ec-4cff-a3e4-0118a7fafe5d
| 2,016 |
36,707 |
def fibonacci(n):
i = 1
z = 0
x = 0
if n > 0:
while i < n:
x = i
i = i + z
z = x
return i
else:
return 0
|
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 |
7c96bda5-98ec-4cff-a3e4-0118a7fafe5d
| 2,016 |
26,688 |
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 |
7c96bda5-98ec-4cff-a3e4-0118a7fafe5d
| 2,016 |
31,795 |
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 |
7c96bda5-98ec-4cff-a3e4-0118a7fafe5d
| 2,016 |
29,363 |
def fibonacci(n):
i = 1
z = 0
x = 0
if n > 0:
while i < n:
x = i
i = i + z
z = x
return i
else:
return 0
|
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 |
7c96bda5-98ec-4cff-a3e4-0118a7fafe5d
| 2,016 |
27,103 |
def index(str, letter, x):
i = 0
while i < len(str):
if str[i] == letter:
return i
i = i + 1
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
| true |
7c96bda5-98ec-4cff-a3e4-0118a7fafe5d
| 2,016 |
32,022 |
def search(str, letter):
for item in str:
if item == letter:
return True
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
| true |
0b0c54f1-c900-465f-a33a-5c22b0497dc4
| 2,016 |
15,667 |
def search(str, letter):
for item in str:
if item == letter:
return True
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
| true |
0b0c54f1-c900-465f-a33a-5c22b0497dc4
| 2,016 |
16,648 |
def index(str, letter):
i = 0
while i < len(str):
if str[i] == letter:
return i
else:
i = i + 1
if i == len(str) and str[i] != letter:
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 |
0b0c54f1-c900-465f-a33a-5c22b0497dc4
| 2,016 |
5,197 |
def search(str, letter):
for item in str:
if item == letter:
return True
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
| true |
0b0c54f1-c900-465f-a33a-5c22b0497dc4
| 2,016 |
8,989 |
def search(str, letter):
for item in str:
if item == letter:
return True
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
| true |
0b0c54f1-c900-465f-a33a-5c22b0497dc4
| 2,016 |
34,886 |
def index(str, letter):
i = 0
while i < len(str):
if str[i] == letter:
return i
else:
i = i + 1
if i == len(str):
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
| true |
0b0c54f1-c900-465f-a33a-5c22b0497dc4
| 2,016 |
26,778 |
def search(str, letter):
for item in str:
if item == letter:
return True
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
| true |
0b0c54f1-c900-465f-a33a-5c22b0497dc4
| 2,016 |
34,279 |
def index(str, letter):
i = 0
while i < len(str):
if str[i] == letter:
return i
else:
i = i + 1
if i == len(str):
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
| true |
0b0c54f1-c900-465f-a33a-5c22b0497dc4
| 2,016 |
341 |
def search(str, letter):
for item in str:
if item == letter:
return True
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
| true |
0b0c54f1-c900-465f-a33a-5c22b0497dc4
| 2,016 |
10,062 |
def index(str, letter):
i = 0
while i < len(str):
if str[i] == letter:
return i
else:
i = i + 1
if i == len(str):
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
| true |
0b0c54f1-c900-465f-a33a-5c22b0497dc4
| 2,016 |
3,969 |
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 |
e61abe18-8ddf-4e11-ab3b-38a68f156ea0
| 2,016 |
32,962 |
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 |
e61abe18-8ddf-4e11-ab3b-38a68f156ea0
| 2,016 |
4,068 |
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 |
e61abe18-8ddf-4e11-ab3b-38a68f156ea0
| 2,016 |
14,424 |
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 |
e61abe18-8ddf-4e11-ab3b-38a68f156ea0
| 2,016 |
16,508 |
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 |
e61abe18-8ddf-4e11-ab3b-38a68f156ea0
| 2,016 |
17,522 |
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 |
e61abe18-8ddf-4e11-ab3b-38a68f156ea0
| 2,016 |
19,037 |
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 |
e61abe18-8ddf-4e11-ab3b-38a68f156ea0
| 2,016 |
12,966 |
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 |
e61abe18-8ddf-4e11-ab3b-38a68f156ea0
| 2,016 |
20,459 |
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 |
e61abe18-8ddf-4e11-ab3b-38a68f156ea0
| 2,016 |
40,063 |
def fibonacci(n):
l = []
if n <= 1:
return n
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 |
0cf3795f-3d4f-4c32-b52b-4a8e4a33e09a
| 2,016 |
18,578 |
def index(steve, letter):
return steve.find(letter)
|
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 |
0cf3795f-3d4f-4c32-b52b-4a8e4a33e09a
| 2,016 |
19,808 |
def search(steve, letter):
if letter in steve:
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
| true |
0cf3795f-3d4f-4c32-b52b-4a8e4a33e09a
| 2,016 |
40,004 |
def search(s, letter, pos):
if pos == len(s):
print('False')
elif s[pos] == letter:
print('True')
else:
return search(s, letter, pos + 1)
|
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 |
44c97823-e1ac-4434-b296-79fbeb51fa5a
| 2,016 |
35,774 |
def search(s, letter):
if len(s) == 0:
return 'False'
elif s[0] == letter:
return 'True'
else:
return search(s[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 |
44c97823-e1ac-4434-b296-79fbeb51fa5a
| 2,016 |
28,349 |
def index(steve, letter, n):
if letter != steve[n]:
index(steve, letter, n + 1)
else:
return n
|
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 |
0cf3795f-3d4f-4c32-b52b-4a8e4a33e09a
| 2,016 |
6,773 |
def index(steve, letter, n):
if letter != steve[n]:
index(steve, letter, n + 1)
else:
return n
|
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 |
0cf3795f-3d4f-4c32-b52b-4a8e4a33e09a
| 2,016 |
2,111 |
def fibonacci(n):
l = []
if n <= 1:
return n
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 |
0cf3795f-3d4f-4c32-b52b-4a8e4a33e09a
| 2,016 |
12,731 |
def fibonacci(n):
l = []
if n <= 1:
return n
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 |
0cf3795f-3d4f-4c32-b52b-4a8e4a33e09a
| 2,016 |
20,293 |
def search(steve, letter):
if letter in steve:
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
| true |
0cf3795f-3d4f-4c32-b52b-4a8e4a33e09a
| 2,016 |
33,236 |
def search(steve, letter):
if letter in steve:
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
| true |
0cf3795f-3d4f-4c32-b52b-4a8e4a33e09a
| 2,016 |
34,920 |
def index(steve, letter, n):
if letter != steve[n]:
index(steve, letter, n + 1)
else:
return n
|
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 |
0cf3795f-3d4f-4c32-b52b-4a8e4a33e09a
| 2,016 |
18,638 |
def fibonacci(n):
l = []
if n <= 1:
return n
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 |
0cf3795f-3d4f-4c32-b52b-4a8e4a33e09a
| 2,016 |
11,279 |
def search(steve, letter):
if letter in steve:
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
| true |
0cf3795f-3d4f-4c32-b52b-4a8e4a33e09a
| 2,016 |
34,000 |
def search(s, letter, pos):
if pos == len(s):
print('-1')
elif s[pos] == letter:
print(pos)
else:
return search(s, letter, pos + 1)
|
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 |
44c97823-e1ac-4434-b296-79fbeb51fa5a
| 2,016 |
6,569 |
def search(s, letter, pos):
if pos == len(s):
print('-1')
elif s[pos] == letter:
return pos
else:
return search(s, letter, pos + 1)
|
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 |
44c97823-e1ac-4434-b296-79fbeb51fa5a
| 2,016 |
17,227 |
def index(s, letter, pos):
if pos == len(s):
print('-1')
elif s[pos] == letter:
return pos
else:
return index(s, 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 |
44c97823-e1ac-4434-b296-79fbeb51fa5a
| 2,016 |
8,338 |
def search(s, letter):
if len(s) == 0:
return 'False'
elif s[0] == letter:
return 'True'
else:
return search(s[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 |
44c97823-e1ac-4434-b296-79fbeb51fa5a
| 2,016 |
24,403 |
def index(s, letter, pos):
if pos == len(s):
return '-1'
elif s[pos] == letter:
return pos
else:
return index(s, 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 |
44c97823-e1ac-4434-b296-79fbeb51fa5a
| 2,016 |
918 |
def search(s, letter):
if len(s) == 0:
return 'False'
elif s[0] == letter:
return 'True'
else:
return search(s[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 |
44c97823-e1ac-4434-b296-79fbeb51fa5a
| 2,016 |
2,473 |
def index(s, letter, pos):
if pos == len(s):
return '-1'
elif s[pos] == letter:
return pos
else:
return index(s, 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 |
44c97823-e1ac-4434-b296-79fbeb51fa5a
| 2,016 |
39,092 |
def search(s, letter):
if len(s) == 0:
return 'False'
elif s[0] == letter:
return 'True'
else:
return search(s[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 |
44c97823-e1ac-4434-b296-79fbeb51fa5a
| 2,016 |
1,273 |
def fibonacci(n):
if n == 0:
return 0
elif n == 1:
return 1
else:
return 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 |
44c97823-e1ac-4434-b296-79fbeb51fa5a
| 2,016 |
20,626 |
def fibonacci(n):
if n == 0:
return 0
elif n == 1:
return 1
else:
a = 0
b = 1
i = 2
while i <= n:
sum1 = a + b
a = b
b = sum1
i += 1
return sum1
|
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 |
44c97823-e1ac-4434-b296-79fbeb51fa5a
| 2,016 |
3,200 |
def index(s, letter, pos):
if pos == len(s):
return '-1'
elif s[pos] == letter:
return pos
else:
return index(s, 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 |
44c97823-e1ac-4434-b296-79fbeb51fa5a
| 2,016 |
8,569 |
def search(s, letter):
if len(s) == 0:
return 'False'
elif s[0] == letter:
return 'True'
else:
return search(s[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 |
44c97823-e1ac-4434-b296-79fbeb51fa5a
| 2,016 |
20,011 |
def index(s, letter, pos):
if pos == len(s):
return '-1'
elif s[pos] == letter:
return pos
else:
return index(s, 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 |
44c97823-e1ac-4434-b296-79fbeb51fa5a
| 2,016 |
20,873 |
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 |
44c97823-e1ac-4434-b296-79fbeb51fa5a
| 2,016 |
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.