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
|
|---|---|---|---|---|---|---|---|---|
39,083 | def search(str, letter):
for item in str:
if item == letter:
return False
else:
return True | 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 | 46396c6c-a25c-4fd6-ac1b-a1163f81f5f8 | 2,016 |
6,387 | def search(str, letter):
for item in str:
if item == letter:
return False
return True | 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 | 46396c6c-a25c-4fd6-ac1b-a1163f81f5f8 | 2,016 |
39,335 | 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 | false | 46396c6c-a25c-4fd6-ac1b-a1163f81f5f8 | 2,016 |
15,162 | 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 | 46396c6c-a25c-4fd6-ac1b-a1163f81f5f8 | 2,016 |
41,618 | def search(str, letter):
if letter in str:
print('True')
else:
print('False') | search_iter | search | Iteratively search for a letter in a string | assert search('','0')==False and search('0','0')==True and search('ERFE0Rfsef','0')==True and search('ERFERfsef0','0')==True and search('','a')==False and search('cbzeycuzbvyzuvb','a')==False and search('cbsducsvdbcyts','c')==True and search('dbzeducvbzy','y')==True and search('xqvsgxcutvy','u')==True | false | 52070898-b2dd-4882-a9a9-65bd9d55725a | 2,016 |
24,718 | def index(str, letter):
i = 0
if letter in str:
letter = letter[0] | 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 | 52070898-b2dd-4882-a9a9-65bd9d55725a | 2,016 |
30,079 | def search(string, letter):
if letter in string:
print('True')
else:
print('False') | search_iter | search | Iteratively search for a letter in a string | assert search('','0')==False and search('0','0')==True and search('ERFE0Rfsef','0')==True and search('ERFERfsef0','0')==True and search('','a')==False and search('cbzeycuzbvyzuvb','a')==False and search('cbsducsvdbcyts','c')==True and search('dbzeducvbzy','y')==True and search('xqvsgxcutvy','u')==True | false | b9e7e608-6036-4d44-8770-a7036176b53c | 2,016 |
35,693 | 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 | 8ed5ee6f-d6e7-4caf-8917-36bbe373ffac | 2,016 |
685 | def index(str, letter):
for item in str:
if item == letter:
return item
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 | 8ed5ee6f-d6e7-4caf-8917-36bbe373ffac | 2,016 |
31,190 | def countdown(num):
while num >= 1:
print(num)
num = num - 1
time.sleep(0.1)
def search(str, letter):
if letter in str:
print('True')
else:
print('False')
def index(str, letter):
i = 0
if letter in str:
letter = letter[0] | 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 | 52070898-b2dd-4882-a9a9-65bd9d55725a | 2,016 |
5,685 | def search(str, letter):
if letter in str:
print('True')
else:
print('False') | search_iter | search | Iteratively search for a letter in a string | assert search('','0')==False and search('0','0')==True and search('ERFE0Rfsef','0')==True and search('ERFERfsef0','0')==True and search('','a')==False and search('cbzeycuzbvyzuvb','a')==False and search('cbsducsvdbcyts','c')==True and search('dbzeducvbzy','y')==True and search('xqvsgxcutvy','u')==True | false | 52070898-b2dd-4882-a9a9-65bd9d55725a | 2,016 |
27,712 | def search(string, letter):
if letter in string:
print('True')
else:
print('False')
return string | 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,976 | def search(string, letter):
if letter in string:
print('True')
else:
print('False')
return 1 | 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 |
12,090 | def search(string, letter):
if letter in string:
print('True')
else:
print('False')
return letter | 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,685 | def index(str, letter):
i = 0
while i < len(str):
if str[i] == letter:
return i
i = i + 1
return False | 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 | 8ed5ee6f-d6e7-4caf-8917-36bbe373ffac | 2,016 |
29,855 | 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 | 8ed5ee6f-d6e7-4caf-8917-36bbe373ffac | 2,016 |
18,535 | def search(string, letter):
if letter in string:
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 | b9e7e608-6036-4d44-8770-a7036176b53c | 2,016 |
27,099 | 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 | 8ed5ee6f-d6e7-4caf-8917-36bbe373ffac | 2,016 |
29,489 | 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 | false | 8ed5ee6f-d6e7-4caf-8917-36bbe373ffac | 2,016 |
11,572 | def search(str, letter):
list(map(split, str))
if letter in str:
return True
else:
return False | search_iter | search | Iteratively search for a letter in a string | assert search('','0')==False and search('0','0')==True and search('ERFE0Rfsef','0')==True and search('ERFERfsef0','0')==True and search('','a')==False and search('cbzeycuzbvyzuvb','a')==False and search('cbsducsvdbcyts','c')==True and search('dbzeducvbzy','y')==True and search('xqvsgxcutvy','u')==True | false | 9b929794-1500-4125-bf6c-79d74c111918 | 2,016 |
24,356 | def search(str, letter):
if letter in str:
return True
else:
return False | search_iter | search | Iteratively search for a letter in a string | assert search('','0')==False and search('0','0')==True and search('ERFE0Rfsef','0')==True and search('ERFERfsef0','0')==True and search('','a')==False and search('cbzeycuzbvyzuvb','a')==False and search('cbsducsvdbcyts','c')==True and search('dbzeducvbzy','y')==True and search('xqvsgxcutvy','u')==True | true | 9b929794-1500-4125-bf6c-79d74c111918 | 2,016 |
38,091 | 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 | false | 8ed5ee6f-d6e7-4caf-8917-36bbe373ffac | 2,016 |
18,149 | 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 | 8ed5ee6f-d6e7-4caf-8917-36bbe373ffac | 2,016 |
9,315 | 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 | false | 8ed5ee6f-d6e7-4caf-8917-36bbe373ffac | 2,016 |
20,212 | def fibonacci(n):
a = [0, 1, 1, 2, 3, 5, 8, 13, 21, 34]
return a[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 | 8ed5ee6f-d6e7-4caf-8917-36bbe373ffac | 2,016 |
32,214 | def fibonacci(n):
a = [0, 1, 1, 2, 3, 5, 8, 13, 21, 34]
return a[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 | 8ed5ee6f-d6e7-4caf-8917-36bbe373ffac | 2,016 |
33,544 | 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 | false | 8ed5ee6f-d6e7-4caf-8917-36bbe373ffac | 2,016 |
4,077 | 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 | 8ed5ee6f-d6e7-4caf-8917-36bbe373ffac | 2,016 |
31,783 | def fibonacci(n):
a = [0, 1, 1, 2, 3, 5, 8, 13, 21, 34]
return a[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 | 8ed5ee6f-d6e7-4caf-8917-36bbe373ffac | 2,016 |
1,971 | 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 | 8ed5ee6f-d6e7-4caf-8917-36bbe373ffac | 2,016 |
8,528 | def index(string, letter):
i = 0
test = -1
while i < len(string):
if letter == string[i]:
test = i
i = i + 1
return test | 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 | e787ded7-43af-4b69-82c1-c646ab388711 | 2,016 |
22,121 | def fibonacci(n):
i = 0
num = 1
num1 = 1
num2 = 1
while i < n:
if n == 0:
return 0
elif n == 1:
return 1
num = num3 + num2
num2 = num3
num3 = num
i = i + 1
if n != 0 and n != 1:
return num | fibonacci_iter | fibonacci | Iteratively compute the value of the fibonacci series at position n. | assert fibonacci(1)==1 and fibonacci(41)==165580141 and fibonacci(3)==2 and fibonacci(91)==4660046610375530309 | false | e787ded7-43af-4b69-82c1-c646ab388711 | 2,016 |
10,071 | def search(string, letter):
i = 0
test = 1
while i < len(string):
if letter == string[i]:
return True
test = 2
i = i + 1
if test == 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 | e787ded7-43af-4b69-82c1-c646ab388711 | 2,016 |
16,505 | def index(string, letter):
i = 0
test = -1
while i < len(string):
if letter == string[i]:
test = i
i = i + 1
return test | 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 | e787ded7-43af-4b69-82c1-c646ab388711 | 2,016 |
7,630 | def search(string, letter):
i = 0
test = 1
while i < len(string):
if letter == string[i]:
return True
test = 2
i = i + 1
if test == 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 | e787ded7-43af-4b69-82c1-c646ab388711 | 2,016 |
14,749 | def fibonacci(n):
i = 0
num = 1
num1 = 1
num2 = 1
while i < n:
if n == 0:
return 0
elif n == 1:
return 1
num = num2 + num1
num1 = num2
num2 = num
i = i + 1
if n != 0 and n != 1:
return num | fibonacci_iter | fibonacci | Iteratively compute the value of the fibonacci series at position n. | assert fibonacci(1)==1 and fibonacci(41)==165580141 and fibonacci(3)==2 and fibonacci(91)==4660046610375530309 | false | e787ded7-43af-4b69-82c1-c646ab388711 | 2,016 |
39,652 | def fibonacci(n):
i = 0
num = 1
num1 = 1
num2 = 1
if n == 0:
return 0
elif n == 1:
return 1
while i < n:
num = num2 + num1
num1 = num2
num2 = num
i = i + 1
if n != 0 and n != 1:
return num | fibonacci_iter | fibonacci | Iteratively compute the value of the fibonacci series at position n. | assert fibonacci(1)==1 and fibonacci(41)==165580141 and fibonacci(3)==2 and fibonacci(91)==4660046610375530309 | false | e787ded7-43af-4b69-82c1-c646ab388711 | 2,016 |
10,990 | def search(string, letter):
i = 0
test = 1
while i < len(string):
if letter == string[i]:
return True
test = 2
i = i + 1
if test == 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 | e787ded7-43af-4b69-82c1-c646ab388711 | 2,016 |
36,868 | def index(string, letter):
i = 0
test = -1
while i < len(string):
if letter == string[i]:
test = i
i = i + 1
return test | 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 | e787ded7-43af-4b69-82c1-c646ab388711 | 2,016 |
21,563 | def index(str, letter):
i = 0
while i < len(str) and str[i] != letter:
i += 1
if letter in str:
return i
else:
return '-1' | index_iter | index | Iteratively search for the position of letter in str, return -1 if it is not there. | assert index('','0')==-1 and index('0','0')==0 and index('11','1')==0 | false | ead2ade9-6c50-44a4-98f3-1d781d45a0f5 | 2,016 |
37,364 | def fibonacci(n):
if n == 0:
return '0'
elif n == 1:
return '1'
else:
n1 = 1
n2 = 0
i = 2
while i < n:
sum1 = n1 + n2
n2 = n1
n1 = 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 | false | ead2ade9-6c50-44a4-98f3-1d781d45a0f5 | 2,016 |
28,488 | def search(str, letter):
if letter in str:
return True
else:
return False | search_iter | search | Iteratively search for a letter in a string | assert search('','0')==False and search('0','0')==True and search('ERFE0Rfsef','0')==True and search('ERFERfsef0','0')==True and search('','a')==False and search('cbzeycuzbvyzuvb','a')==False and search('cbsducsvdbcyts','c')==True and search('dbzeducvbzy','y')==True and search('xqvsgxcutvy','u')==True | true | ead2ade9-6c50-44a4-98f3-1d781d45a0f5 | 2,016 |
29,485 | 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 | 46396c6c-a25c-4fd6-ac1b-a1163f81f5f8 | 2,016 |
16,084 | def index(str, letter):
i = 0
while i < len(str) and str[i] != letter:
i += 1
if letter in str:
return i
else:
return '-1' | index_iter | index | Iteratively search for the position of letter in str, return -1 if it is not there. | assert index('','0')==-1 and index('0','0')==0 and index('11','1')==0 | false | ead2ade9-6c50-44a4-98f3-1d781d45a0f5 | 2,016 |
7,161 | def index(str, letter):
i = 0
while i < len(str) and str[i] != letter:
i += 1
if letter in str:
return i
else:
return '-1' | index_iter | index | Iteratively search for the position of letter in str, return -1 if it is not there. | assert index('','0')==-1 and index('0','0')==0 and index('11','1')==0 | false | ead2ade9-6c50-44a4-98f3-1d781d45a0f5 | 2,016 |
33,651 | def search(str, letter):
if letter in str:
return True
else:
return False | search_iter | search | Iteratively search for a letter in a string | assert search('','0')==False and search('0','0')==True and search('ERFE0Rfsef','0')==True and search('ERFERfsef0','0')==True and search('','a')==False and search('cbzeycuzbvyzuvb','a')==False and search('cbsducsvdbcyts','c')==True and search('dbzeducvbzy','y')==True and search('xqvsgxcutvy','u')==True | true | ead2ade9-6c50-44a4-98f3-1d781d45a0f5 | 2,016 |
3,951 | def fibonacci(n):
if n == 0:
return '0'
elif n == 1:
return '1'
else:
n1 = 1
n2 = 0
i = 2
while i <= n:
sum1 = n1 + n2
n2 = n1
n1 = 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 | false | ead2ade9-6c50-44a4-98f3-1d781d45a0f5 | 2,016 |
30,731 | def fibonacci(n):
if n == 0:
return '0'
elif n == 1:
return '1'
else:
n1 = 1
n2 = 0
i = 2
while i <= n:
sum1 = n1 + n2
n2 = n1
n1 = 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 | false | ead2ade9-6c50-44a4-98f3-1d781d45a0f5 | 2,016 |
30,926 | def search(str, letter):
if letter in str:
return True
else:
return False | search_iter | search | Iteratively search for a letter in a string | assert search('','0')==False and search('0','0')==True and search('ERFE0Rfsef','0')==True and search('ERFERfsef0','0')==True and search('','a')==False and search('cbzeycuzbvyzuvb','a')==False and search('cbsducsvdbcyts','c')==True and search('dbzeducvbzy','y')==True and search('xqvsgxcutvy','u')==True | true | ead2ade9-6c50-44a4-98f3-1d781d45a0f5 | 2,016 |
15,561 | def search(string, letter):
i = 0
test = 1
while i < len(string):
if letter == string[i]:
return True
test = 2
i = i + 1
if test == 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 | e787ded7-43af-4b69-82c1-c646ab388711 | 2,016 |
10,873 | def fibonacci(n):
i = 0
num = 1
num1 = 1
num2 = 1
if n == 0:
return 0
elif n == 1:
return 1
while i < n:
num = num2 + num1
num1 = num2
num2 = num
print(num)
i = i + 1
if n != 0 and n != 1:
return num | fibonacci_iter | fibonacci | Iteratively compute the value of the fibonacci series at position n. | assert fibonacci(1)==1 and fibonacci(41)==165580141 and fibonacci(3)==2 and fibonacci(91)==4660046610375530309 | false | e787ded7-43af-4b69-82c1-c646ab388711 | 2,016 |
32,731 | def index(string, letter):
i = 0
test = -1
while i < len(string):
if letter == string[i]:
test = i
i = i + 1
return test | 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 | e787ded7-43af-4b69-82c1-c646ab388711 | 2,016 |
30,552 | 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 | 46396c6c-a25c-4fd6-ac1b-a1163f81f5f8 | 2,016 |
7,654 | 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 | 46396c6c-a25c-4fd6-ac1b-a1163f81f5f8 | 2,016 |
10,529 | 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 | 46396c6c-a25c-4fd6-ac1b-a1163f81f5f8 | 2,016 |
24,250 | def fibonacci(n):
i = 2
num = 1
num1 = 1
num2 = 1
if n == 0:
return 0
elif n == 1:
return 1
while i < n:
num = num2 + num1
num1 = num2
num2 = num
print(num)
i = i + 1
if n != 0 and n != 1:
return num | fibonacci_iter | fibonacci | Iteratively compute the value of the fibonacci series at position n. | assert fibonacci(1)==1 and fibonacci(41)==165580141 and fibonacci(3)==2 and fibonacci(91)==4660046610375530309 | true | e787ded7-43af-4b69-82c1-c646ab388711 | 2,016 |
23,919 | def search(string, letter):
i = 0
test = 1
while i < len(string):
if letter == string[i]:
return True
test = 2
i = i + 1
if test == 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 | e787ded7-43af-4b69-82c1-c646ab388711 | 2,016 |
17,026 | def index(string, letter):
i = 0
test = -1
while i < len(string):
if letter == string[i]:
test = i
i = i + 1
return test | 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 | e787ded7-43af-4b69-82c1-c646ab388711 | 2,016 |
34,800 | def fibonacci(n):
i = 2
num = 1
num1 = 1
num2 = 1
if n == 0:
return 0
elif n == 1:
return 1
while i < n:
num = num2 + num1
num1 = num2
num2 = num
i = i + 1
if n != 0 and n != 1:
return num | fibonacci_iter | fibonacci | Iteratively compute the value of the fibonacci series at position n. | assert fibonacci(1)==1 and fibonacci(41)==165580141 and fibonacci(3)==2 and fibonacci(91)==4660046610375530309 | true | e787ded7-43af-4b69-82c1-c646ab388711 | 2,016 |
41,791 | def search(string, letter):
i = 0
test = 1
while i < len(string):
if letter == string[i]:
return True
test = 2
i = i + 1
if test == 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 | e787ded7-43af-4b69-82c1-c646ab388711 | 2,016 |
15,928 | def fibonacci(n):
i = 2
num = 1
num1 = 1
num2 = 1
if n == 0:
return 0
elif n == 1:
return 1
while i < n:
num = num2 + num1
num1 = num2
num2 = num
i = i + 1
if n != 0 and n != 1:
return num | fibonacci_iter | fibonacci | Iteratively compute the value of the fibonacci series at position n. | assert fibonacci(1)==1 and fibonacci(41)==165580141 and fibonacci(3)==2 and fibonacci(91)==4660046610375530309 | true | e787ded7-43af-4b69-82c1-c646ab388711 | 2,016 |
30,410 | def index(string, letter):
i = 0
test = -1
while i < len(string):
if letter == string[i]:
test = i
i = i + 1
return test | 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 | e787ded7-43af-4b69-82c1-c646ab388711 | 2,016 |
34,344 | def index(string, letter):
i = 0
test = -1
while i < len(string):
if letter == string[i]:
test = i
i = i + 1
return test | 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 | e787ded7-43af-4b69-82c1-c646ab388711 | 2,016 |
3,963 | def search(string, letter):
i = 0
test = 1
while i < len(string):
if letter == string[i]:
return True
test = 2
i = i + 1
if test == 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 | e787ded7-43af-4b69-82c1-c646ab388711 | 2,016 |
5,362 | def search(string, letter):
i = 0
while i < len(string):
if letter == string[i]:
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 | false | b9e7e608-6036-4d44-8770-a7036176b53c | 2,016 |
11,839 | 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 | 9b929794-1500-4125-bf6c-79d74c111918 | 2,016 |
33,396 | 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 | 1bdd9f47-4a26-4f0c-ae56-413531e3f59b | 2,016 |
20,870 | 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 | 1bdd9f47-4a26-4f0c-ae56-413531e3f59b | 2,016 |
41,424 | def search(string, letter):
i = 0
while i < len(string):
if letter == string[i]:
return 'True'
elif letter != string[-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 |
28,087 | def search(string, letter):
i = 0
while i < len(string):
if letter == string[i]:
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 | b9e7e608-6036-4d44-8770-a7036176b53c | 2,016 |
36,515 | def search(ls, val):
for item in ls:
if item == val:
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 | 3db8d602-4800-4b13-9482-3fb9643a4588 | 2,016 |
1,397 | def search(ls, val):
for item in ls:
if item == val:
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 | df44f889-e513-4dcf-9230-82eca3e43f36 | 2,016 |
28,595 | 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 | true | ead2ade9-6c50-44a4-98f3-1d781d45a0f5 | 2,016 |
20,827 | def index(str, letter):
i = 0
while i < len(str) and str[i] != letter:
i += 1
if letter in str:
return i
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 | ead2ade9-6c50-44a4-98f3-1d781d45a0f5 | 2,016 |
1,922 | def fibonacci(n):
if n == 0:
return '0'
elif n == 1:
return '1'
else:
n1 = 1
n2 = 0
i = 2
while i <= n:
sum1 = n1 + n2
n2 = n1
n1 = 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 | false | ead2ade9-6c50-44a4-98f3-1d781d45a0f5 | 2,016 |
34,058 | def index(str, letter):
i = 0
if letter in str:
c = letter[0]
for ch in str:
if ch == c:
if str[i:i + len(letter)] == 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 | 52070898-b2dd-4882-a9a9-65bd9d55725a | 2,016 |
28,593 | 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 | 52070898-b2dd-4882-a9a9-65bd9d55725a | 2,016 |
34,419 | def search(str, letter, pos):
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 | ead2ade9-6c50-44a4-98f3-1d781d45a0f5 | 2,016 |
2,857 | def fibonacci(n):
if n == 0:
return '0'
elif n == 1:
return '1'
else:
n1 = 1
n2 = 0
i = 2
while i <= n:
sum1 = n1 + n2
n2 = n1
n1 = 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 | false | ead2ade9-6c50-44a4-98f3-1d781d45a0f5 | 2,016 |
12,889 | def index(str, letter):
i = 0
while i < len(str) and str[i] != letter:
i += 1
if letter in str:
return i
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 | ead2ade9-6c50-44a4-98f3-1d781d45a0f5 | 2,016 |
32,283 | 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 | true | ead2ade9-6c50-44a4-98f3-1d781d45a0f5 | 2,016 |
25,477 | def index(str, letter):
i = 0
while i < len(str) and str[i] != letter:
i += 1
if letter in str:
return i
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 | ead2ade9-6c50-44a4-98f3-1d781d45a0f5 | 2,016 |
12,029 | def index(str, letter):
i = 0
while i < len(str) and str[i] != letter:
i += 1
if letter in str:
return i
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 | ead2ade9-6c50-44a4-98f3-1d781d45a0f5 | 2,016 |
15,732 | def index(str, letter):
i = 0
while i < len(str) and str[i] != letter:
i += 1
if letter in str:
return i
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 | ead2ade9-6c50-44a4-98f3-1d781d45a0f5 | 2,016 |
36,883 | 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 | true | ead2ade9-6c50-44a4-98f3-1d781d45a0f5 | 2,016 |
38,370 | def fibonacci(n):
if n == 0:
return '0'
elif n == 1:
return '1'
else:
n1 = 1
n2 = 0
i = 2
while i <= n:
sum1 = n1 + n2
n2 = n1
n1 = 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 | false | ead2ade9-6c50-44a4-98f3-1d781d45a0f5 | 2,016 |
40,464 | def fibonacci(n):
if n == 0:
return '0'
elif n == 1:
return '1'
else:
n1 = 1
n2 = 0
i = 2
while i <= n:
sum1 = n1 + n2
n2 = n1
n1 = 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 | false | ead2ade9-6c50-44a4-98f3-1d781d45a0f5 | 2,016 |
376 | def fibonacci(n):
if n == 0:
return '0'
elif n == 1:
return '1'
else:
n1 = 1
n2 = 0
i = 2
while i <= n:
sum1 = n1 + n2
n2 = n1
n1 = 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 | false | ead2ade9-6c50-44a4-98f3-1d781d45a0f5 | 2,016 |
7,180 | 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 | true | ead2ade9-6c50-44a4-98f3-1d781d45a0f5 | 2,016 |
18,826 | 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 | 52070898-b2dd-4882-a9a9-65bd9d55725a | 2,016 |
24,527 | def index(str, letter):
i = 0
if letter in str:
c = letter[0]
for ch in str:
if ch == c:
if str[i:i + len(letter)] == 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 | 52070898-b2dd-4882-a9a9-65bd9d55725a | 2,016 |
21,291 | 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 | 52070898-b2dd-4882-a9a9-65bd9d55725a | 2,016 |
22,902 | def index(str, letter):
i = 0
if letter in str:
c = letter[0]
for ch in str:
if ch == c:
if str[i:i + len(letter)] == 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 | 52070898-b2dd-4882-a9a9-65bd9d55725a | 2,016 |
16,328 | def search(string, letter):
i = 0
if string[i] == letter:
return True
elif i < len(string):
search(string[i + 1], letter)
else:
return False
i = i + 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 |
3,552 | def index(str, letter):
i = 0
while i < len(str):
if str[i] == letter:
return len[:i]
i += 1
return -1 | index_iter | index | Iteratively search for the position of letter in str, return -1 if it is not there. | assert index('','0')==-1 and index('0','0')==0 and index('11','1')==0 | false | 9b929794-1500-4125-bf6c-79d74c111918 | 2,016 |
21,321 | 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 | 9b929794-1500-4125-bf6c-79d74c111918 | 2,016 |
10,022 | def search(string, letter):
i = 0
if string[i] == letter:
return True
elif i < len(string):
i = i + 1
search(string[i + 1], letter)
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 | e787ded7-43af-4b69-82c1-c646ab388711 | 2,016 |
29,213 | def search(ls, val):
for item in ls:
if item == val:
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 | 3db8d602-4800-4b13-9482-3fb9643a4588 | 2,016 |
13,295 | def index(str, letter):
for item in ls:
return str - 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 | 3db8d602-4800-4b13-9482-3fb9643a4588 | 2,016 |
7,498 | 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 |
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.