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
|
|---|---|---|---|---|---|---|---|---|
2,314 |
def fibonacci(n):
if n == 0:
return 0
a, b = 1, 1
for i in range(n - 1):
a, b = b, a + b
return a
|
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 |
aaa0b462-c89e-49f8-8886-ec2961496a19
| 2,016 |
20,550 |
def index(s, letter, num):
if num == len(s):
return -1
if s[num] == letter:
return num
n = index(s, letter, num + 1)
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
| true |
aaa0b462-c89e-49f8-8886-ec2961496a19
| 2,016 |
36,629 |
def search(s, letter):
return letter in s
|
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 |
aaa0b462-c89e-49f8-8886-ec2961496a19
| 2,016 |
20,945 |
def search(s, letter):
return letter in s
|
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 |
aaa0b462-c89e-49f8-8886-ec2961496a19
| 2,016 |
15,027 |
def index(s, letter, num):
if num == len(s):
return -1
if s[num] == letter:
return num
n = index(s, letter, num + 1)
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
| true |
aaa0b462-c89e-49f8-8886-ec2961496a19
| 2,016 |
10,380 |
def fibonacci(n):
if n == 0:
return 0
a, b = 1, 1
for i in range(n - 1):
a, b = b, a + b
return a
|
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 |
aaa0b462-c89e-49f8-8886-ec2961496a19
| 2,016 |
21,181 |
def fibonacci(n):
fib = [0, 1, 1]
for f in range(2, n):
fib.append(fib[-1] + fib[-2])
return fib[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
| true |
3db8d602-4800-4b13-9482-3fb9643a4588
| 2,016 |
37,888 |
def search(str, letter):
i = 0
while i < len(str):
if str[i] == letter:
return True
i += 1
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 |
3db8d602-4800-4b13-9482-3fb9643a4588
| 2,016 |
25,166 |
def index(str, letter):
i = 0
while i < len(str):
if str[i] == letter:
return 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
| false |
3db8d602-4800-4b13-9482-3fb9643a4588
| 2,016 |
11,696 |
def search(str, letter):
i = 0
while i < len(str):
if str[i] == letter:
return True
i += 1
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 |
3db8d602-4800-4b13-9482-3fb9643a4588
| 2,016 |
6,283 |
def fibonacci(n):
fib = [0, 1, 1]
for f in range(2, n):
fib.append(fib[-1] + fib[-2])
return fib[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
| true |
3db8d602-4800-4b13-9482-3fb9643a4588
| 2,016 |
19,072 |
def index(str, letter):
i = 0
while i < len(str):
if str[i] == letter:
return 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
| false |
3db8d602-4800-4b13-9482-3fb9643a4588
| 2,016 |
38,143 |
def index(str, letter):
i = 0
while i < len(str):
if str[i] == letter:
return 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
| false |
3db8d602-4800-4b13-9482-3fb9643a4588
| 2,016 |
1,149 |
def search(str, letter):
i = 0
while i < len(str):
if str[i] == letter:
return True
i += 1
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 |
3db8d602-4800-4b13-9482-3fb9643a4588
| 2,016 |
18,636 |
def fibonacci(n):
fib = [0, 1, 1]
for f in range(2, n):
fib.append(fib[-1] + fib[-2])
return fib[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
| true |
3db8d602-4800-4b13-9482-3fb9643a4588
| 2,016 |
13,441 |
def index(str, letter):
i = 0
while i < len(str):
if str[i] == letter:
return 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
| false |
3db8d602-4800-4b13-9482-3fb9643a4588
| 2,016 |
24,257 |
def search(str, letter):
i = 0
while i < len(str):
if str[i] == letter:
return True
i += 1
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 |
3db8d602-4800-4b13-9482-3fb9643a4588
| 2,016 |
20,630 |
def fibonacci(n):
fib = [0, 1, 1]
for f in range(2, n):
fib.append(fib[-1] + fib[-2])
return fib[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
| true |
3db8d602-4800-4b13-9482-3fb9643a4588
| 2,016 |
24,210 |
def search(str, letter):
i = 0
while i < len(str):
if str[i] == letter:
return True
i += 1
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 |
3db8d602-4800-4b13-9482-3fb9643a4588
| 2,016 |
5,698 |
def index(str, letter):
i = 0
while i < len(str):
if str[i] == letter:
return 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
| false |
3db8d602-4800-4b13-9482-3fb9643a4588
| 2,016 |
22,783 |
def index(str, letter):
i = 0
while i < len(str):
if str[i] == letter:
return 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
| false |
3db8d602-4800-4b13-9482-3fb9643a4588
| 2,016 |
36,804 |
def fibonacci(n):
fib = [0, 1, 1]
for f in range(2, n):
fib.append(fib[-1] + fib[-2])
return fib[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
| true |
3db8d602-4800-4b13-9482-3fb9643a4588
| 2,016 |
26,703 |
def search(str, letter):
i = 0
while i < len(str):
if str[i] == letter:
return True
i += 1
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 |
3db8d602-4800-4b13-9482-3fb9643a4588
| 2,016 |
10,004 |
def index(str, letter):
i = 0
while i < len(str):
if str[i] == letter:
return 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
| false |
3db8d602-4800-4b13-9482-3fb9643a4588
| 2,016 |
28,067 |
def search(str, letter):
i = 0
while i < len(str):
if str[i] == letter:
return True
i += 1
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 |
3db8d602-4800-4b13-9482-3fb9643a4588
| 2,016 |
4,741 |
def fibonacci(n):
fib = [0, 1, 1]
for f in range(2, n):
fib.append(fib[-1] + fib[-2])
return fib[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
| true |
3db8d602-4800-4b13-9482-3fb9643a4588
| 2,016 |
3,554 |
def fibonacci(n):
fib = [0, 1, 1]
for f in range(2, n):
fib.append(fib[-1] + fib[-2])
return fib[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
| true |
3db8d602-4800-4b13-9482-3fb9643a4588
| 2,016 |
7,576 |
def search(str, letter):
i = 0
while i < len(str):
if str[i] == letter:
return True
i += 1
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 |
3db8d602-4800-4b13-9482-3fb9643a4588
| 2,016 |
30,673 |
def index(str, letter):
i = 0
while i < len(str):
if str[i] == letter:
return 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
| false |
3db8d602-4800-4b13-9482-3fb9643a4588
| 2,016 |
27,595 |
def search(str, letter):
i = 0
while i < len(str):
if str[i] == letter:
return True
i += 1
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 |
3db8d602-4800-4b13-9482-3fb9643a4588
| 2,016 |
11,416 |
def fibonacci(n):
fib = [0, 1, 1]
for f in range(2, n):
fib.append(fib[-1] + fib[-2])
return fib[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
| true |
3db8d602-4800-4b13-9482-3fb9643a4588
| 2,016 |
38,922 |
def index(str, letter):
i = 0
while i < len(str):
if str[i] == letter:
return 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
| false |
3db8d602-4800-4b13-9482-3fb9643a4588
| 2,016 |
35,740 |
def index(str, letter):
i = 0
while i < len(str):
if str[i] == letter:
return 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
| false |
3db8d602-4800-4b13-9482-3fb9643a4588
| 2,016 |
18,109 |
def fibonacci(n):
fib = [0, 1, 1]
for f in range(2, n):
fib.append(fib[-1] + fib[-2])
return fib[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
| true |
3db8d602-4800-4b13-9482-3fb9643a4588
| 2,016 |
22,124 |
def search(str, letter):
i = 0
while i < len(str):
if str[i] == letter:
return True
i += 1
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 |
3db8d602-4800-4b13-9482-3fb9643a4588
| 2,016 |
37,997 |
def index(str, letter):
i = 0
while i < len(str):
if str[i] == letter:
return 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
| false |
3db8d602-4800-4b13-9482-3fb9643a4588
| 2,016 |
338 |
def fibonacci(n):
fib = [0, 1, 1]
for f in range(2, n):
fib.append(fib[-1] + fib[-2])
return fib[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
| true |
3db8d602-4800-4b13-9482-3fb9643a4588
| 2,016 |
33,976 |
def search(str, letter):
i = 0
while i < len(str):
if str[i] == letter:
return True
i += 1
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 |
3db8d602-4800-4b13-9482-3fb9643a4588
| 2,016 |
8,691 |
def fibonacci(n):
fib = [0, 1, 1]
for f in range(2, n):
fib.append(fib[-1] + fib[-2])
return fib[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
| true |
3db8d602-4800-4b13-9482-3fb9643a4588
| 2,016 |
2,384 |
def search(str, letter):
i = 0
while i < len(str):
if str[i] == letter:
return True
i += 1
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 |
3db8d602-4800-4b13-9482-3fb9643a4588
| 2,016 |
33,030 |
def index(str, letter):
i = 0
while i < len(str):
if str[i] == letter:
return 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
| false |
3db8d602-4800-4b13-9482-3fb9643a4588
| 2,016 |
12,058 |
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 |
9,469 |
def fibonacci(n):
fib = [0, 1, 1]
for f in range(2, n):
fib.append(fib[-1] + fib[-2])
return fib[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
| true |
3db8d602-4800-4b13-9482-3fb9643a4588
| 2,016 |
38,670 |
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,381 |
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 |
5,402 |
def fibonacci(n):
fib = [0, 1, 1]
for f in range(2, n):
fib.append(fib[-1] + fib[-2])
return fib[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
| true |
3db8d602-4800-4b13-9482-3fb9643a4588
| 2,016 |
31,805 |
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 |
36,411 |
def fibonacci(n):
fib = [0, 1, 1]
for f in range(2, n):
fib.append(fib[-1] + fib[-2])
return fib[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
| true |
3db8d602-4800-4b13-9482-3fb9643a4588
| 2,016 |
5,519 |
def index(str, letter):
i = 0
while i < len(str):
if str[i] == letter:
return 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
| false |
3db8d602-4800-4b13-9482-3fb9643a4588
| 2,016 |
35,742 |
def search(str, letter):
i = 0
while i < len(str):
if str[i] == letter:
return True
i += 1
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 |
3db8d602-4800-4b13-9482-3fb9643a4588
| 2,016 |
30,074 |
def fibonacci(n):
fib = [0, 1, 1]
for f in range(2, n):
fib.append(fib[-1] + fib[-2])
return fib[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
| true |
3db8d602-4800-4b13-9482-3fb9643a4588
| 2,016 |
3,402 |
def fibonacci(n):
fib = [0, 1, 1]
for f in range(2, n):
fib.append(fib[-1] + fib[-2])
return fib[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
| true |
3db8d602-4800-4b13-9482-3fb9643a4588
| 2,016 |
10,327 |
def search(str, letter):
i = 0
while i < len(str):
if str[i] == letter:
return True
i += 1
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 |
3db8d602-4800-4b13-9482-3fb9643a4588
| 2,016 |
16,444 |
def index(str, letter, num):
i = 0
while i < len(str):
if str[i] == letter:
return 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 |
3db8d602-4800-4b13-9482-3fb9643a4588
| 2,016 |
35,609 |
def index(str, letter, num):
i = 0
while i < len(str):
if str[i] == letter:
return 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 |
3db8d602-4800-4b13-9482-3fb9643a4588
| 2,016 |
31,321 |
def index(str, letter, num):
i = 0
while i < len(str):
if str[i] == letter:
return 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 |
3db8d602-4800-4b13-9482-3fb9643a4588
| 2,016 |
26,391 |
def search(str, letter):
i = 0
while i < len(str):
if str[i] == letter:
return True
i += 1
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 |
3db8d602-4800-4b13-9482-3fb9643a4588
| 2,016 |
21,454 |
def search(str, letter):
i = 0
while i < len(str):
if str[i] == letter:
return True
i += 1
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 |
3db8d602-4800-4b13-9482-3fb9643a4588
| 2,016 |
38,626 |
def fibonacci(n):
fib = [0, 1, 1]
for f in range(2, n):
fib.append(fib[-1] + fib[-2])
return fib[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
| true |
3db8d602-4800-4b13-9482-3fb9643a4588
| 2,016 |
22,183 |
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 |
329aa290-1bfb-4cf3-82e0-ca13ee54db0f
| 2,016 |
13,963 |
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 |
329aa290-1bfb-4cf3-82e0-ca13ee54db0f
| 2,016 |
6,455 |
def fibonacci(n):
i = 1
z = 0
x = 0
while i < n - i:
x = i
i = i + z
z = x
print(i)
|
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 |
329aa290-1bfb-4cf3-82e0-ca13ee54db0f
| 2,016 |
8,036 |
def fibonacci(n):
i = 1
z = 0
x = 0
while i < n - i:
x = i
i = i + z
z = x
print(i)
|
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 |
329aa290-1bfb-4cf3-82e0-ca13ee54db0f
| 2,016 |
28,448 |
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 |
329aa290-1bfb-4cf3-82e0-ca13ee54db0f
| 2,016 |
420 |
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 |
329aa290-1bfb-4cf3-82e0-ca13ee54db0f
| 2,016 |
2,357 |
def fibonacci(n):
i = 1
j = 0
k = 0
while i < n - i:
k = i
i = j + i
j = k
print(i)
|
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 |
329aa290-1bfb-4cf3-82e0-ca13ee54db0f
| 2,016 |
13,486 |
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 |
329aa290-1bfb-4cf3-82e0-ca13ee54db0f
| 2,016 |
18,346 |
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 |
329aa290-1bfb-4cf3-82e0-ca13ee54db0f
| 2,016 |
16,251 |
def fibonacci(n):
i = 1
z = 0
x = 0
print(i)
print(z)
print(x)
while i < n - i:
x = i
i = i + z
z = x
print(i)
|
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 |
329aa290-1bfb-4cf3-82e0-ca13ee54db0f
| 2,016 |
22,417 |
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 |
329aa290-1bfb-4cf3-82e0-ca13ee54db0f
| 2,016 |
2,244 |
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 |
329aa290-1bfb-4cf3-82e0-ca13ee54db0f
| 2,016 |
17,699 |
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 |
329aa290-1bfb-4cf3-82e0-ca13ee54db0f
| 2,016 |
36,511 |
def fibonacci(n):
i = 1
z = 0
x = 0
while i < n - i:
x = i
i = i + z
z = x
print(i)
print(z)
print(x)
print(i)
|
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 |
329aa290-1bfb-4cf3-82e0-ca13ee54db0f
| 2,016 |
3,317 |
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 |
329aa290-1bfb-4cf3-82e0-ca13ee54db0f
| 2,016 |
15,521 |
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 |
329aa290-1bfb-4cf3-82e0-ca13ee54db0f
| 2,016 |
34,964 |
def fibonacci(n):
i = 1
z = 0
x = 0
while i < n - i:
x = i
i = i + z
z = x
print(str(i))
|
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 |
329aa290-1bfb-4cf3-82e0-ca13ee54db0f
| 2,016 |
37,397 |
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 |
329aa290-1bfb-4cf3-82e0-ca13ee54db0f
| 2,016 |
1,658 |
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 |
329aa290-1bfb-4cf3-82e0-ca13ee54db0f
| 2,016 |
1,067 |
def fibonacci(n):
i = 1
z = 0
x = 0
while i < n:
x = i
i = i + z
z = x
print(i)
print(z)
print(x)
print(str(i))
|
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 |
329aa290-1bfb-4cf3-82e0-ca13ee54db0f
| 2,016 |
32,184 |
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 |
329aa290-1bfb-4cf3-82e0-ca13ee54db0f
| 2,016 |
33,031 |
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 |
329aa290-1bfb-4cf3-82e0-ca13ee54db0f
| 2,016 |
12,367 |
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 |
329aa290-1bfb-4cf3-82e0-ca13ee54db0f
| 2,016 |
5,845 |
def fibonacci(n):
i = 1
z = 0
x = 0
while i < n:
x = i
i = i + z
z = x
return i
|
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 |
329aa290-1bfb-4cf3-82e0-ca13ee54db0f
| 2,016 |
34,548 |
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 |
329aa290-1bfb-4cf3-82e0-ca13ee54db0f
| 2,016 |
2,135 |
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 |
329aa290-1bfb-4cf3-82e0-ca13ee54db0f
| 2,016 |
18,310 |
def fibonacci(n):
i = 1
z = 0
x = 0
while i < n:
x = i
i = i + z
z = x
return x
|
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 |
329aa290-1bfb-4cf3-82e0-ca13ee54db0f
| 2,016 |
19,599 |
def fibonacci(n):
i = 1
z = 0
x = 0
while i < n:
x = i
i = i + z
z = x
return z
|
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 |
329aa290-1bfb-4cf3-82e0-ca13ee54db0f
| 2,016 |
37,965 |
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 |
329aa290-1bfb-4cf3-82e0-ca13ee54db0f
| 2,016 |
17,678 |
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 |
329aa290-1bfb-4cf3-82e0-ca13ee54db0f
| 2,016 |
28,736 |
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 |
329aa290-1bfb-4cf3-82e0-ca13ee54db0f
| 2,016 |
5,697 |
def fibonacci(n):
i = 1
z = 0
x = 0
if n > 0:
while i < n:
x = i
i = i + z
z = x
return z
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 |
329aa290-1bfb-4cf3-82e0-ca13ee54db0f
| 2,016 |
6,649 |
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 |
329aa290-1bfb-4cf3-82e0-ca13ee54db0f
| 2,016 |
42,192 |
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 |
329aa290-1bfb-4cf3-82e0-ca13ee54db0f
| 2,016 |
33,823 |
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 |
329aa290-1bfb-4cf3-82e0-ca13ee54db0f
| 2,016 |
19,270 |
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 |
329aa290-1bfb-4cf3-82e0-ca13ee54db0f
| 2,016 |
18,716 |
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 |
329aa290-1bfb-4cf3-82e0-ca13ee54db0f
| 2,016 |
27,229 |
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 |
329aa290-1bfb-4cf3-82e0-ca13ee54db0f
| 2,016 |
42,277 |
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 |
329aa290-1bfb-4cf3-82e0-ca13ee54db0f
| 2,016 |
3,872 |
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 |
329aa290-1bfb-4cf3-82e0-ca13ee54db0f
| 2,016 |
23,669 |
def index(str, letter):
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
| false |
329aa290-1bfb-4cf3-82e0-ca13ee54db0f
| 2,016 |
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.