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
40,921
def search(str, letter): i = 0 while i < len(str): if str[i] == letter: 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
true
3db8d602-4800-4b13-9482-3fb9643a4588
2,016
29,617
def index(str, letter): i = 0 while i < len(str): if str[i] == letter: 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
3db8d602-4800-4b13-9482-3fb9643a4588
2,016
4,448
def fibonacci(n): a = 0 b = 1 for i in range(1, n + 1): c = a + b print(n)
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
3db8d602-4800-4b13-9482-3fb9643a4588
2,016
7,432
def search(str, letter): i = 0 while i < len(str): if str[i] == letter: 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
true
3db8d602-4800-4b13-9482-3fb9643a4588
2,016
23,038
def index(str, letter): i = 0 while i < len(str): if str[i] == letter: 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
3db8d602-4800-4b13-9482-3fb9643a4588
2,016
7,696
def fibonacci(n): a = 0 b = 1 for i in range(1, n + 1): c = a + b print(c)
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
3db8d602-4800-4b13-9482-3fb9643a4588
2,016
12,275
def search(string, letter): test = 0 if string[0] == letter: test = 1 else: search(string[1:], letter) if test == 0: return False else: return True
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
e787ded7-43af-4b69-82c1-c646ab388711
2,016
36,632
def search(str, letter): i = 0 while i < len(str): if str[i] == letter: 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
true
3db8d602-4800-4b13-9482-3fb9643a4588
2,016
7,773
def index(str, letter): i = 0 while i < len(str): if str[i] == letter: 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
3db8d602-4800-4b13-9482-3fb9643a4588
2,016
36,073
def fibonacci(n): a = 0 b = 1 for i in range(1, n + 1): c = a + b return c a = b b = c
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
3db8d602-4800-4b13-9482-3fb9643a4588
2,016
14,378
def index(str, letter): i = 0 while i < len(str): if str[i] == letter: 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
3db8d602-4800-4b13-9482-3fb9643a4588
2,016
33,953
def search(str, letter): i = 0 while i < len(str): if str[i] == letter: 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
true
3db8d602-4800-4b13-9482-3fb9643a4588
2,016
18,160
def fibonacci(n): a = 0 b = 1 for i in range(1, n + 1): c = a + b return n a = b b = c
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
3db8d602-4800-4b13-9482-3fb9643a4588
2,016
42,112
def index(str, letter): i = 0 while i < len(str): if str[i] == letter: 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
3db8d602-4800-4b13-9482-3fb9643a4588
2,016
41,026
def fibonacci(n): a = 0 b = 1 for i in range(1, n + 1): c = a + b return a a = b b = c
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
3db8d602-4800-4b13-9482-3fb9643a4588
2,016
12,113
def search(str, letter): i = 0 while i < len(str): if str[i] == letter: 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
true
3db8d602-4800-4b13-9482-3fb9643a4588
2,016
7,135
def search(str, letter): i = 0 while i < len(str): if str[i] == letter: 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
true
3db8d602-4800-4b13-9482-3fb9643a4588
2,016
12,243
def fibonacci(n): a = 0 b = 1 for i in range(0, n + 1): c = a + b return n[i] a = b b = c
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
3db8d602-4800-4b13-9482-3fb9643a4588
2,016
9,734
def index(str, letter): i = 0 while i < len(str): if str[i] == letter: 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
3db8d602-4800-4b13-9482-3fb9643a4588
2,016
17,568
def search(str, letter): i = 0 while i < len(str): if str[i] == letter: 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
true
3db8d602-4800-4b13-9482-3fb9643a4588
2,016
4,018
def fibonacci(n): a = 0 b = 1 for i in range(0, n + 1): c = a + b return n a = b b = c
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
3db8d602-4800-4b13-9482-3fb9643a4588
2,016
31,530
def index(str, letter): i = 0 while i < len(str): if str[i] == letter: 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
3db8d602-4800-4b13-9482-3fb9643a4588
2,016
1,109
def fibonacci(n): a = 0 b = 1 for i in range(0, n + 1): c = a + b return len(n) a = b b = c
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
3db8d602-4800-4b13-9482-3fb9643a4588
2,016
9,301
def index(str, letter): i = 0 while i < len(str): if str[i] == letter: 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
3db8d602-4800-4b13-9482-3fb9643a4588
2,016
31,730
def search(str, letter): i = 0 while i < len(str): if str[i] == letter: 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
true
3db8d602-4800-4b13-9482-3fb9643a4588
2,016
33,576
def index(str, letter): i = 0 while i < len(str): if str[i] == letter: 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
3db8d602-4800-4b13-9482-3fb9643a4588
2,016
42,248
def search(str, letter): i = 0 while i < len(str): if str[i] == letter: 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
true
3db8d602-4800-4b13-9482-3fb9643a4588
2,016
33,062
def fibonacci(n): a = 0 b = 1 for i in range(0, n + 1): c = a + b return n a = b b = c
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
3db8d602-4800-4b13-9482-3fb9643a4588
2,016
1,726
def search(string, letter): if string == []: return False elif string[0] == letter: return True else: 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
e787ded7-43af-4b69-82c1-c646ab388711
2,016
22,294
def index(str, letter): i = 0 while i < len(str): if str[i] == letter: 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
3db8d602-4800-4b13-9482-3fb9643a4588
2,016
8,025
def fibonacci(n): a = 0 b = 1 for i in range(0, n + 1): c = a + b return b a = b b = c
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
3db8d602-4800-4b13-9482-3fb9643a4588
2,016
23,251
def search(str, letter): i = 0 while i < len(str): if str[i] == letter: 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
true
3db8d602-4800-4b13-9482-3fb9643a4588
2,016
3,153
def fibonacci(n): a = 0 b = 1 for i in range(0, n + 1): c = a + b return n a = b b = c
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
3db8d602-4800-4b13-9482-3fb9643a4588
2,016
6,631
def index(str, letter): i = 0 while i < len(str): if str[i] == letter: 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
3db8d602-4800-4b13-9482-3fb9643a4588
2,016
23,441
def search(str, letter): i = 0 while i < len(str): if str[i] == letter: 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
true
3db8d602-4800-4b13-9482-3fb9643a4588
2,016
3,698
def search(string, letter): if string == '': return False elif string[0] == letter: return True else: 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
e787ded7-43af-4b69-82c1-c646ab388711
2,016
31,663
def search(str, letter): i = 0 while i < len(str): if str[i] == letter: 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
true
3db8d602-4800-4b13-9482-3fb9643a4588
2,016
1,311
def index(str, letter): i = 0 while i < len(str): if str[i] == letter: 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
3db8d602-4800-4b13-9482-3fb9643a4588
2,016
7,168
def fibonacci(n): count = 0 a = 0 b = 1 for i in range(0, n + 1): c = a + b return count a = b b = c count += 1
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
3db8d602-4800-4b13-9482-3fb9643a4588
2,016
33,617
def search(string, letter, pos): if pos == len(string): return False elif string[pos] == letter: return True else: search(string, 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
e787ded7-43af-4b69-82c1-c646ab388711
2,016
21,814
def index(str, letter): i = 0 while i < len(str): if str[i] == letter: 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
3db8d602-4800-4b13-9482-3fb9643a4588
2,016
17,319
def search(str, letter): i = 0 while i < len(str): if str[i] == letter: 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
true
3db8d602-4800-4b13-9482-3fb9643a4588
2,016
24,079
def fibonacci(n): a = 0 b = 1 for i in range(0, n + 1): c = a + b return n a = b b = c
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
3db8d602-4800-4b13-9482-3fb9643a4588
2,016
11,890
def search(str, letter): i = 0 while i < len(str): if str[i] == letter: 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
true
3db8d602-4800-4b13-9482-3fb9643a4588
2,016
22,422
def fibonacci(n): a = 0 b = 1 for i in range(0, n + 1): c = a + b return n + 2 a = b b = c
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
3db8d602-4800-4b13-9482-3fb9643a4588
2,016
32,035
def index(str, letter): i = 0 while i < len(str): if str[i] == letter: 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
3db8d602-4800-4b13-9482-3fb9643a4588
2,016
20,215
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
b9e7e608-6036-4d44-8770-a7036176b53c
2,016
6,060
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
b9e7e608-6036-4d44-8770-a7036176b53c
2,016
39,997
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
b9e7e608-6036-4d44-8770-a7036176b53c
2,016
534
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
b9e7e608-6036-4d44-8770-a7036176b53c
2,016
18,674
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
b9e7e608-6036-4d44-8770-a7036176b53c
2,016
36,595
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
b9e7e608-6036-4d44-8770-a7036176b53c
2,016
25,896
def search(string, letter): if string == '': return False elif string[0] == letter: return True else: 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
e787ded7-43af-4b69-82c1-c646ab388711
2,016
6,458
def fibonacci(n): a = 0 b = 1 for i in range(0, n + 1): c = a + b return n a = b b = c
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
3db8d602-4800-4b13-9482-3fb9643a4588
2,016
19,413
def fibonacci(n): a = 0 b = 1 for i in range(0, n + 1): c = a + b return n a = b b = c
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
3db8d602-4800-4b13-9482-3fb9643a4588
2,016
30,808
def search(str, letter): i = 0 while i < len(str): if str[i] == letter: 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
true
3db8d602-4800-4b13-9482-3fb9643a4588
2,016
35,747
def fibonacci(n): a = 0 b = 1 for i in range(0, n + 1): c = a + b return n a = b b = c
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
3db8d602-4800-4b13-9482-3fb9643a4588
2,016
39,709
def index(str, letter): i = 0 while i < len(str): if str[i] == letter: 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
3db8d602-4800-4b13-9482-3fb9643a4588
2,016
42,100
def search(str, letter): i = 0 while i < len(str): if str[i] == letter: 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
true
3db8d602-4800-4b13-9482-3fb9643a4588
2,016
23,014
def index(str, letter): i = 0 while i < len(str): if str[i] == letter: 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
3db8d602-4800-4b13-9482-3fb9643a4588
2,016
22,004
def index(str, letter): i = 0 while i < len(str): if str[i] == letter: 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
3db8d602-4800-4b13-9482-3fb9643a4588
2,016
16,957
def search(str, letter): i = 0 while i < len(str): if str[i] == letter: 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
true
3db8d602-4800-4b13-9482-3fb9643a4588
2,016
3,214
def search(string, letter): if string == '': return False elif string[0] == letter: return True else: 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
e787ded7-43af-4b69-82c1-c646ab388711
2,016
21,587
def fibonacci(n): if n == 0: return 0 elif n == 1: return 1 else: ans = fibonacci(n - 1) + fibonacci(n - 2)
fibonacci_recur
fibonacci
Recursively compute the value of the fibonacci series at position n.
assert fibonacci(0)==0 and fibonacci(1)==1 and fibonacci(2)==1 and fibonacci(10)==55 and fibonacci(23)==28657
false
e787ded7-43af-4b69-82c1-c646ab388711
2,016
7,874
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
e787ded7-43af-4b69-82c1-c646ab388711
2,016
42,094
def search(string, letter): if string == '': return False elif string[0] == letter: return True else: 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
e787ded7-43af-4b69-82c1-c646ab388711
2,016
11,976
def index(str, letter): start = len(str) - 1 end = -1 while start > end: if letter == str[start]: return start else: start -= 1 return end
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
89186303-b7a8-4f4c-9627-06ba24e03bbb
2,016
31,929
def search(str, letter): for char in str: if char == letter: 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
89186303-b7a8-4f4c-9627-06ba24e03bbb
2,016
2,145
def fibonacci(n): old = 1 cur = 1 i = 1 while i < n: cur, old, i = cur + old, cur, i + 1 return cur
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
89186303-b7a8-4f4c-9627-06ba24e03bbb
2,016
37,546
def search(str, letter): for char in str: if char == letter: 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
89186303-b7a8-4f4c-9627-06ba24e03bbb
2,016
18,856
def index(str, letter): start = len(str) - 1 end = -1 while start > end: if letter == str[start]: return start else: start -= 1 return end
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
89186303-b7a8-4f4c-9627-06ba24e03bbb
2,016
31,809
def fibonacci(n): old = 1 cur = 1 i = 1 while i < n: cur, old, i = cur + old, cur, i + 1 return cur
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
89186303-b7a8-4f4c-9627-06ba24e03bbb
2,016
8,468
def index(string, letter, pos): if pos == len(string): return -1 elif string[pos] == letter: return pos else: return index(string, letter, pos)
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
e787ded7-43af-4b69-82c1-c646ab388711
2,016
13,997
def search(string, letter): if string == '': return False elif string[0] == letter: return True else: 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
e787ded7-43af-4b69-82c1-c646ab388711
2,016
2,114
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
e787ded7-43af-4b69-82c1-c646ab388711
2,016
23,394
def index(string, letter, pos): if pos == len(string): return -1 elif string[pos] == letter: return pos else: index(string, letter, pos)
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
e787ded7-43af-4b69-82c1-c646ab388711
2,016
37,384
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
e787ded7-43af-4b69-82c1-c646ab388711
2,016
25,341
def search(string, letter): if string == '': return False elif string[0] == letter: return True else: 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
e787ded7-43af-4b69-82c1-c646ab388711
2,016
4,695
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
e787ded7-43af-4b69-82c1-c646ab388711
2,016
2,807
def index(string, letter, pos): if pos == len(string): return -1 elif string[pos] == letter: return pos else: index(string, 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
e787ded7-43af-4b69-82c1-c646ab388711
2,016
8,808
def search(string, letter): if string == '': return False elif string[0] == letter: return True else: 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
e787ded7-43af-4b69-82c1-c646ab388711
2,016
26,679
def search(string, letter): if string == '': return False elif string[0] == letter: return True else: 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
e787ded7-43af-4b69-82c1-c646ab388711
2,016
12,477
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
e787ded7-43af-4b69-82c1-c646ab388711
2,016
11,560
def index(string, letter, count): if count == len(string) - 1: return -1 elif string[count] == letter: return count else: index(string, letter, count + 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
e787ded7-43af-4b69-82c1-c646ab388711
2,016
7,422
def search(str, letter): for n in str: if n == 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
2bcea2a1-925b-4db5-8403-2d8af9d0bb46
2,016
15,371
def index(string, letter, count): print(count) if count == len(string) - 1: return -1 elif string[count] == letter: return count else: index(string, letter, count + 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
e787ded7-43af-4b69-82c1-c646ab388711
2,016
13,725
def search(string, letter): if string == '': return False elif string[0] == letter: return True else: 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
e787ded7-43af-4b69-82c1-c646ab388711
2,016
19,816
def fibonacci(n): if n == 0: return 0 elif n == 1: return 1 else: return fibonacci(n - 2) + fibonacci(n - 1)
fibonacci_recur
fibonacci
Recursively compute the value of the fibonacci series at position n.
assert fibonacci(0)==0 and fibonacci(1)==1 and fibonacci(2)==1 and fibonacci(10)==55 and fibonacci(23)==28657
true
e787ded7-43af-4b69-82c1-c646ab388711
2,016
23,380
def search(str, letter): for n in str: if n == 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
2bcea2a1-925b-4db5-8403-2d8af9d0bb46
2,016
10,855
def index(str, letter): i = 0 while i < len(str): if str[i] == letter: return i i += 1 return
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
2bcea2a1-925b-4db5-8403-2d8af9d0bb46
2,016
19,180
def index(string, letter, count): print(count) k = len(string) if count == k: return -1 elif string[count] == letter: return count else: index(string, letter, count + 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
e787ded7-43af-4b69-82c1-c646ab388711
2,016
11,186
def fibonacci(n): if n == 0: return 0 elif n == 1: return 1 else: return fibonacci(n - 2) + fibonacci(n - 1)
fibonacci_recur
fibonacci
Recursively compute the value of the fibonacci series at position n.
assert fibonacci(0)==0 and fibonacci(1)==1 and fibonacci(2)==1 and fibonacci(10)==55 and fibonacci(23)==28657
true
e787ded7-43af-4b69-82c1-c646ab388711
2,016
30,716
def search(string, letter): if string == '': return False elif string[0] == letter: return True else: 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
e787ded7-43af-4b69-82c1-c646ab388711
2,016
31,332
def search(str, letter): for n in str: if n == 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
2bcea2a1-925b-4db5-8403-2d8af9d0bb46
2,016
19,577
def index(str, letter): i = 0 while i < len(str): if str[i] == letter: 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
2bcea2a1-925b-4db5-8403-2d8af9d0bb46
2,016
36,072
def index(string, letter, count): print(count) k = len(string) if count == k: print(-1) elif string[count] == letter: print(count) else: index(string, letter, count + 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
e787ded7-43af-4b69-82c1-c646ab388711
2,016
33,875
def search(string, letter): if string == '': return False elif string[0] == letter: return True else: 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
e787ded7-43af-4b69-82c1-c646ab388711
2,016
17,084
def fibonacci(n): if n == 0: return 0 elif n == 1: return 1 else: return fibonacci(n - 2) + fibonacci(n - 1)
fibonacci_recur
fibonacci
Recursively compute the value of the fibonacci series at position n.
assert fibonacci(0)==0 and fibonacci(1)==1 and fibonacci(2)==1 and fibonacci(10)==55 and fibonacci(23)==28657
true
e787ded7-43af-4b69-82c1-c646ab388711
2,016
1,394
def index(string, letter, count): k = len(string) if count == k: print(-1) elif string[count] == letter: print(count) else: index(string, letter, count + 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
e787ded7-43af-4b69-82c1-c646ab388711
2,016
2,942
def fibonacci(n): if n == 0: return 0 elif n == 1: return 1 else: return fibonacci(n - 2) + fibonacci(n - 1)
fibonacci_recur
fibonacci
Recursively compute the value of the fibonacci series at position n.
assert fibonacci(0)==0 and fibonacci(1)==1 and fibonacci(2)==1 and fibonacci(10)==55 and fibonacci(23)==28657
true
e787ded7-43af-4b69-82c1-c646ab388711
2,016