id
stringlengths 35
39
| content
stringlengths 44
3.85k
| max_stars_repo_path
stringlengths 52
57
|
|---|---|---|
refactory_data_question_4_wrong_4_276
|
def sort_age(lst):
sort=[]
while lst:
largest=lst[0][1]
for i in lst:
if i[1]>largest:
largest=i[1]
lst.remove(i)
sort.append(i)
return sort
|
./refactory/data/question_4/code/wrong/wrong_4_276.py
|
refactory_data_question_4_wrong_4_077
|
def sort_age(lst):
lst.sort(key=lambda x:x[1],reverse=True)
return lst
|
./refactory/data/question_4/code/wrong/wrong_4_077.py
|
refactory_data_question_4_wrong_4_136
|
def sort_age(lst):
a = lst
sort = []
smallest = a[0][1]
while a: # a is not []
for element in a:
if element[1] > smallest:
smallest = element
a.remove(smallest)
sort.append(smallest)
pass
|
./refactory/data/question_4/code/wrong/wrong_4_136.py
|
refactory_data_question_4_wrong_4_272
|
def sort_age(lst):
if len(lst) < 2:
return lst
midpoint = len(lst) // 2
left = sort_age(lst[:midpoint])
right = sort_age(lst[midpoint:])
new_list = []
while left and right:
if left[0][1] > right[0][1]:
new_list.append(left.pop(0))
else:
new_list.append(right.pop(0))
new_list.extend(left)
new_list.extend(right)
new_list.reverse
return new_list
|
./refactory/data/question_4/code/wrong/wrong_4_272.py
|
refactory_data_question_4_wrong_4_176
|
def sort_age(lst):
newlst = []
ages = []
for i in lst:
ages.append(i[1])
ages.sort()
for x in ages[::-1]:
for i in lst:
if i[1] == x:
newlst.append(i)
return newlst
|
./refactory/data/question_4/code/wrong/wrong_4_176.py
|
refactory_data_question_4_wrong_4_296
|
def sort_age(lst):
ages = []
output = []
for item in lst:
ages.append(item[1])
for item in lst:
if min(ages) == item[1]:
output.append(item)
ages.remove(age)
return output
|
./refactory/data/question_4/code/wrong/wrong_4_296.py
|
refactory_data_question_4_wrong_4_064
|
def sort_age(lst):
lst.sort(key=lambda x:x[1],reverse=True)
return lst
|
./refactory/data/question_4/code/wrong/wrong_4_064.py
|
refactory_data_question_4_wrong_4_157
|
def sort_age(lst):
new = []
while lst:
curr = lst[0]
for i in lst:
if i[1]<curr[1]:
curr = i
lst.remove(i)
new.append(i)
return new
|
./refactory/data/question_4/code/wrong/wrong_4_157.py
|
refactory_data_question_4_wrong_4_083
|
def sort_age(lst):
new_lst = []
while lst:
oldest = lst [0]
for i in range(len(lst)):
if lst[i][1] > oldest[1]:
oldest = lst[i]
lst.remove(oldest)
new_lst.append(oldest)
print(new_lst)
|
./refactory/data/question_4/code/wrong/wrong_4_083.py
|
refactory_data_question_4_wrong_4_226
|
def sort_age(lst):
a=[]
for i in lst:
if i[1]>lst[0][1]:
a.append(i)
return a
|
./refactory/data/question_4/code/wrong/wrong_4_226.py
|
refactory_data_question_4_wrong_4_096
|
def sort_age(lst):
lst.sort(key = lambda x: x[1])
return lst
|
./refactory/data/question_4/code/wrong/wrong_4_096.py
|
refactory_data_question_4_wrong_4_196
|
def sort_age(lst):
new = []
while lst:
largest = lst[0][1]
for i in lst:
if i[1] > largest:
largest = i[1]
lst.remove(i)
new.append(i)
return new
|
./refactory/data/question_4/code/wrong/wrong_4_196.py
|
refactory_data_question_4_wrong_4_100
|
def sort_age(lst):
for i in range(len(lst)-1):
while lst[i][1] > lst[i+1][1]:
temp = lst[i]
del lst[i]
lst += [temp]
return lst.reverse()
|
./refactory/data/question_4/code/wrong/wrong_4_100.py
|
refactory_data_question_4_wrong_4_178
|
def sort_age(lst):
lst.sort(key=lambda x:x[1],reverse=True)
return lst
|
./refactory/data/question_4/code/wrong/wrong_4_178.py
|
refactory_data_question_4_wrong_4_326
|
def sort_age(lst):
newnew = [lst[0]]
for i in lst:
for j in range(len(newnew)):
if i[1]>newnew[j][1]:
newnew.insert(j,i)
elif i[1]<newnew[j][1]:
newnew.insert(j+1,i)
return newnew
return newnew
|
./refactory/data/question_4/code/wrong/wrong_4_326.py
|
refactory_data_question_4_wrong_4_325
|
def sort_age(lst):
newnew = []
for i in lst:
for j in range(len(newnew)):
if i[1]>newnew[j][1]:
newnew.insert(j+1,i)
elif i[1]<newnew[j][1]:
newnew.insert(j,i)
else:
newnew.append(i)
return newnew
return newnew
|
./refactory/data/question_4/code/wrong/wrong_4_325.py
|
refactory_data_question_4_wrong_4_074
|
def sort_age(lst):
lst.sort(key=lambda x:x[1],reverse=True)
return lst
|
./refactory/data/question_4/code/wrong/wrong_4_074.py
|
refactory_data_question_4_wrong_4_310
|
def sort_age(lst):
for i in range(len(lst-1)):
for j in range(len(lst)-1-i):
if lst[j][1] < lst[j+1][1]:
lst[j][1],lst[j+1][1] = lst[j+1][1],lst[j][1]
else:
continue
return lst
pass
|
./refactory/data/question_4/code/wrong/wrong_4_310.py
|
refactory_data_question_4_wrong_4_352
|
def sort_age(lst):
# lst.sort(key = lambda x: x[1], reverse= True)
# return lst
while True:
changed = False
for i in range (len(lst)-1):
if lst[i][1] < lst[i+1][1]:
lst[i], lst[i+1] = lst[i+1], lst[i]
changed = True
if not changed:
break
return lst
|
./refactory/data/question_4/code/wrong/wrong_4_352.py
|
refactory_data_question_4_wrong_4_213
|
def sort_age(lst):
lst.sort(key=lambda x: x[1], reverse=True)
return lst
|
./refactory/data/question_4/code/wrong/wrong_4_213.py
|
refactory_data_question_4_wrong_4_198
|
def sort_age(lst):
new_lst = [()]
for i in range(len(lst)):
if lst[i][1]< lst[i+1][1]:
new_lst.append(lst[i])
lst.reverse()
return lst
pass
|
./refactory/data/question_4/code/wrong/wrong_4_198.py
|
refactory_data_question_4_wrong_4_177
|
def sort_age(lst):
lst.sort(key = lambda x: x[1], reverse = True)
return lst
|
./refactory/data/question_4/code/wrong/wrong_4_177.py
|
refactory_data_question_4_wrong_4_057
|
def sort_age(lst):
arranged = []
while lst:
oldest = lst[0]
for person in lst:
if person > oldest:
oldest = person
lst.remove(oldest)
arranged.append(oldest)
return arranged
pass
|
./refactory/data/question_4/code/wrong/wrong_4_057.py
|
refactory_data_question_4_wrong_4_290
|
def sort_age(lst):
new_list=[]
largest=0
while lst:
for i in lst:
if i[1]>largest:
largest = i[1]
count=i
new_list=new_list.append(count)
lst.remove(count)
largest=0
return new_list
|
./refactory/data/question_4/code/wrong/wrong_4_290.py
|
refactory_data_question_4_wrong_4_122
|
def sort_age(lst):
firstnum = lst[0][1]
result = (lst[0],)
for x in lst[1:]:
if x[1] > firstnum:
result += (x,)
else:
result = (x,) + result
return result
pass
|
./refactory/data/question_4/code/wrong/wrong_4_122.py
|
refactory_data_question_4_wrong_4_021
|
def sort_age(lst):
product = []
while lst:
largest = lst[0]
for i in lst:
if i[1]<larget[1]:
largest = i
lst.remove(largest)
product.append(largest)
return product
|
./refactory/data/question_4/code/wrong/wrong_4_021.py
|
refactory_data_question_4_wrong_4_355
|
def sort_age(lst):
# Fill in your code here
newlst=[]
while lst:
maximum = lst[0][1]
for i in lst:
if i[1]>maximum:
maximum = i[1]
newlst.append(i)
lst.remove(i)
print(newlst)
|
./refactory/data/question_4/code/wrong/wrong_4_355.py
|
refactory_data_question_4_wrong_4_016
|
def sort_age(lst):
sort = []
while lst:
biggest = lst[0]
for element in lst:
if element > biggest:
biggest = element
lst.remove(biggest)
sort.append(biggest)
return sort
|
./refactory/data/question_4/code/wrong/wrong_4_016.py
|
refactory_data_question_4_wrong_4_045
|
def sort_age(lst):
result = [lst[0]]
for i in lst[1:]:
if i[1] > result[0][1]:
result.insert(0, i)
elif i[1] < result[-1][1]:
result.append(i)
else:
for j in range(len(result) - 1):
if i[1] < result[j][1] and i[1] > result[j+1][1]:
result.insert(j+1, i)
return result
|
./refactory/data/question_4/code/wrong/wrong_4_045.py
|
refactory_data_question_4_wrong_4_308
|
def sort_age(lst):
for j in range(len(lst)-1):
for i in range(len(lst)-1-j):
if lst[i][1]> lst[i+1][1]:
lst[i],lst[i+1] = lst[i+1],lst[i]
return lst
|
./refactory/data/question_4/code/wrong/wrong_4_308.py
|
refactory_data_question_4_wrong_4_248
|
def sort_age(lst):
list1 = []
while lst:
biggest = lst[0][1]
b = lst[0]
for i in range(1,len(lst)):
if lst[i][1] > biggest:
biggest = lst[i][1]
s = (lst[i],)
lst.remove(biggest)
list1.append(biggest)
return list1
|
./refactory/data/question_4/code/wrong/wrong_4_248.py
|
refactory_data_question_4_wrong_4_245
|
def sort_age(lst):
list1 = []
smallest = lst[0][1]
s = (lst[0],)
for i in range(1,len(lst)):
if lst[i][1] < smallest:
smallest = lst[i][1]
s = (lst[i],)
list1 += s
return list1
|
./refactory/data/question_4/code/wrong/wrong_4_245.py
|
refactory_data_question_4_wrong_4_068
|
def sort_age(lst):
lst.sort(key = lambda x: x[1], reverse = True)
return lst
|
./refactory/data/question_4/code/wrong/wrong_4_068.py
|
refactory_data_question_4_wrong_4_168
|
def sort_age(lst):
sortt = [] #empty list
while lst:
largest = lst[0] #let the first element be the largest first
for i in lst:
if i[1] > largest[1]:
largest = i
lst.remove(largest)
sortt.append(largest)
return sort
|
./refactory/data/question_4/code/wrong/wrong_4_168.py
|
refactory_data_question_4_wrong_4_211
|
def sort_age(lst):
n = len(lst)
result = []
while n != 0:
test = []
for counter in range(n):
test.append(lst[counter][1])
first = test(max)
for counter in range(n):
if lst[counter][1] == first:
result.append(lst.pop(counter))
n = len(lst)
return result
|
./refactory/data/question_4/code/wrong/wrong_4_211.py
|
refactory_data_question_4_wrong_4_140
|
def sort_age(lst):
sort_list = []
while lst: # a is not []
smallest = lst[0]
for element in lst:
if element[1] < smallest[1]:
smallest = element
lst.remove(smallest)
sort_list.append(smallest)
return sort_list
|
./refactory/data/question_4/code/wrong/wrong_4_140.py
|
refactory_data_question_4_wrong_4_206
|
def sort_age(lst):
agelist = [lst[0],]
for i in range(1,len(lst)):
if lst[i][1] > agelist[0][1]:
agelist.insert(0, lst[i])
elif lst[i][1] < agelist[len(agelist)-1][1]:
agelist.insert(len(agelist), lst[i])
else:
for x in range(0,len(agelist)):
if agelist[x][1]> lst[i][1] > agelist[x+1][1]:
agelist.insert(x+1, lst[i])
break
return agelist
|
./refactory/data/question_4/code/wrong/wrong_4_206.py
|
refactory_data_question_4_wrong_4_192
|
def sort_age(lst):
lst.sort()
lst.reverse()
return lst
pass
|
./refactory/data/question_4/code/wrong/wrong_4_192.py
|
refactory_data_question_4_wrong_4_124
|
def sort_age(lst):
firstnum = lst[0][1]
result = [lst[0],]
for x in lst[1:]:
if x[1] < firstnum:
result += (x,)
else:
result = (x,) + result
return result
pass
|
./refactory/data/question_4/code/wrong/wrong_4_124.py
|
refactory_data_question_4_wrong_4_174
|
def sort_age(lst):
sort=[]
while lst:
smallest = lst[0][1]
for i in range (len(lst)):
if lst[i][1] < smallest:
smallest = lst[i][1]
lst.remove(smallest)
sort.append(smallest)
sort.reverse(smallest)
return sort
|
./refactory/data/question_4/code/wrong/wrong_4_174.py
|
refactory_data_question_4_wrong_4_087
|
def sort_age(lst):
new_lst = []
while lst:
oldest = lst[0]
for i in range(len(lst)):
if lst[i][1] > oldest[1]:
oldest = lst[i]
lst.remove(oldest)
new_lst.append(oldest)
print(new_lst)
|
./refactory/data/question_4/code/wrong/wrong_4_087.py
|
refactory_data_question_4_wrong_4_113
|
def sort_age(lst):
# Fill in your code here
out = [lst[0],]
for ele in lst[1:]:
for indx in range(len(out)):
if out[indx] < ele:
out.insert(indx, ele)
break
elif indx == len(out) - 1:
out.append(ele)
return out
|
./refactory/data/question_4/code/wrong/wrong_4_113.py
|
refactory_data_question_4_wrong_4_227
|
def sort_age(lst):
a=[]
while lst:
biggest=lst[0]
for i in lst:
if i > biggest:
biggest=i
lst.remove(biggest)
a.append(biggest)
return a
|
./refactory/data/question_4/code/wrong/wrong_4_227.py
|
refactory_data_question_4_wrong_4_225
|
def sort_age(lst):
a=[]
for i in lst:
if i[1]>lst[0][1]:
a.append(i)
continue
return a
|
./refactory/data/question_4/code/wrong/wrong_4_225.py
|
refactory_data_question_4_wrong_4_029
|
def sort_age(lst):
if len(lst) == 0:
return []
elif len(lst) == 1:
return lst
else:
mid = len(lst) // 2
lst1 = lst[:mid]
lst2 = lst[mid:]
result = []
while lst1 and lst2:
if lst1[0][1] < lst2[0][1]:
result.append(lst1.pop())
else:
result.append(lst2.pop())
result.extend(lst1)
result.extend(lst2)
return result
|
./refactory/data/question_4/code/wrong/wrong_4_029.py
|
refactory_data_question_4_wrong_4_043
|
def sort_age(lst):
result = [lst[0]]
for i in lst[1:]:
if i[1] > result[0][1]:
result.insert(0, i)
elif i[1] < result[-1][1]:
result.append(i)
else:
for j in range(len(result) - 1):
if i[1] < result[j][1] and i[1] > result[j+1][1]:
result.insert(j, i)
return result
|
./refactory/data/question_4/code/wrong/wrong_4_043.py
|
refactory_data_question_4_wrong_4_319
|
def sort_age(lst):
lst.sort(key = lambda x: x[1], reverse = True)
return lst
|
./refactory/data/question_4/code/wrong/wrong_4_319.py
|
refactory_data_question_4_wrong_4_013
|
def sort_age(lst):
return lst.sort(key=lambda x: x[1], reverse=True)
|
./refactory/data/question_4/code/wrong/wrong_4_013.py
|
refactory_data_question_4_wrong_4_340
|
def sort_age(lst):
l = len(lst)
for i in range(0, l):
for j in range(0, l-i-1):
if (lst[j][1] > lst[j + 1][1]):
temp = lst[j]
lst[j]= lst[j + 1]
lst[j + 1]= temp
return lst
|
./refactory/data/question_4/code/wrong/wrong_4_340.py
|
refactory_data_question_4_wrong_4_061
|
def sort_age(lst):
lst.sort(key = lambda x: x[1], reverse = True)
return lst
|
./refactory/data/question_4/code/wrong/wrong_4_061.py
|
refactory_data_question_4_wrong_4_051
|
def sort_age(lst):
final = []
while lst:
biggest = lst[0]
for i in lst:
if i[1] > biggest[1]:
biggest = i
lst.remove(biggest)
final.append(biggest)
print(final)
|
./refactory/data/question_4/code/wrong/wrong_4_051.py
|
refactory_data_question_4_wrong_4_191
|
def sort_age(lst):
sort = []
while lst: # a is not [ ]
biggest = lst[0]
for element in lst:
if element[1] > biggest[1]:
biggest = element
lst.remove(biggest)
sort.append(biggest)
return sort
|
./refactory/data/question_4/code/wrong/wrong_4_191.py
|
refactory_data_question_4_wrong_4_284
|
def sort_age(lst):
newlist = []
while lst:
oldest = lst[0]
for i in lst:
if i[1] > oldest:
oldest = i
else:
continue
lst.remove(oldest)
newlist.append(oldest)
return newlist
|
./refactory/data/question_4/code/wrong/wrong_4_284.py
|
refactory_data_question_4_wrong_4_282
|
def sort_age(lst):
for i in range(len(lst)-1):
for j in range(len(lst)-1-i):
if lst[j][1] > lst[j+1][1]:
lst[j][1], lst[j+1][1] = lst[j+1][1], lst[j][1]
else:
continue
return lst
pass
|
./refactory/data/question_4/code/wrong/wrong_4_282.py
|
refactory_data_question_4_wrong_4_073
|
def sort_age(lst):
sort = []
while lst:
oldest = lst[0]
for i in lst[1:]:
if i[1] > oldest[1]:
oldest = i
lst.remove(oldest)
sort.append(oldest)
return sort
|
./refactory/data/question_4/code/wrong/wrong_4_073.py
|
refactory_data_question_4_wrong_4_005
|
def sort_age(lst):
sort = []
while lst:
oldest = lst[0]
for person in lst:
if person[1] >= oldest[1]:
person = oldest
lst.remove(oldest)
sort.append(oldest)
print(lst)
|
./refactory/data/question_4/code/wrong/wrong_4_005.py
|
refactory_data_question_4_wrong_4_316
|
def sort_age(lst):
lst1 = []
while lst:
largest = lst[0]
for i in lst:
if i > largest:
largest = i
lst.remove(largest)
lst1.append(largest)
return lst1
|
./refactory/data/question_4/code/wrong/wrong_4_316.py
|
refactory_data_question_4_wrong_4_030
|
def sort_age(lst):
if len(lst) == 0:
return []
elif len(lst) == 1:
return lst
else:
mid = len(lst) // 2
lst1 = sort_age(lst[:mid])
lst2 = sort_age(lst[mid:])
result = []
while lst1 and lst2:
if lst1[0][1] < lst2[0][1]:
result.append(lst1.pop())
else:
result.append(lst2.pop())
result.extend(lst1)
result.extend(lst2)
return result
|
./refactory/data/question_4/code/wrong/wrong_4_030.py
|
refactory_data_question_4_wrong_4_143
|
def sort_age(lst):
males = []
females = []
for i in lst:
if lst[0][0] == "M":
males = males + [lst[0],]
elif lst[0][0] == "F":
females = females + [lst[0],]
return merge_sort(males) + merge_sort(females)
def merge(left, right):
results = []
while left and right:
if left[0][0] < right[0][0]:
results.append(left,pop(0))
else:
results.append(right.pop(0))
results.extend(left)
results.extend(right)
return results
def merge_sort(lst):
if len(lst) < 2:
return lst
mid = len(lst) // 2
left = merge_sort(lst[:mid])
right = merge_sort(lst[mid:])
return merge(left, right)
|
./refactory/data/question_4/code/wrong/wrong_4_143.py
|
refactory_data_question_4_wrong_4_079
|
def sort_age(lst):
lst = lst.sort(key = lambda x: x[1], reverse=True)
return lst
|
./refactory/data/question_4/code/wrong/wrong_4_079.py
|
refactory_data_question_4_wrong_4_344
|
def sort_age(lst):
current=0
tup=()
for i in lst:
if i[1]>current:
tup+=tuple(i)
current=i[1]
else:
tuple(i)+tup
return tup
|
./refactory/data/question_4/code/wrong/wrong_4_344.py
|
refactory_data_question_4_wrong_4_075
|
def sort_age(lst):
lst.sort(key=lambda x:x[1],reverse=True)
return lst
|
./refactory/data/question_4/code/wrong/wrong_4_075.py
|
refactory_data_question_4_wrong_4_283
|
def sort_age(lst):
for i in range(len(lst)-1):
for j in range(len(lst)-1-i):
if lst[j][1] < lst[j+1][1]:
lst[j][1], lst[j+1][1] = lst[j+1][1], lst[j][1]
else:
continue
return lst
pass
|
./refactory/data/question_4/code/wrong/wrong_4_283.py
|
refactory_data_question_4_wrong_4_053
|
def sort_age(lst):
newlst = []
while lst:
current = lst[0]
for element in lst:
if element[1] < current[1]:
current = element
newlst += current
lst.remove(current)
return newlst
|
./refactory/data/question_4/code/wrong/wrong_4_053.py
|
refactory_data_question_4_wrong_4_165
|
def sort_age(lst):
sort = [] #empty list
while lst:
largest = lst[0] #let the first element be the smallest first
for i in lst:
if i[1] > largest[1]:
largest = i
lst.removal(largest)
sort.append(a)
return sort
|
./refactory/data/question_4/code/wrong/wrong_4_165.py
|
refactory_data_question_4_wrong_4_141
|
def sort_age(lst):
sort_list = []
while lst: # a is not []
biggest = lst[0]
for element in lst:
if element[1] > smallest[1]:
biggest = element
lst.remove(biggest)
sort_list.append(biggest)
return sort_list
|
./refactory/data/question_4/code/wrong/wrong_4_141.py
|
refactory_data_question_4_wrong_4_115
|
def sort_age(lst):
# Fill in your code here
if lst == ():
return lst
out = [lst[0],]
for ele in lst[1:]:
for indx in range(len(out)):
if out[indx][1] < ele[1]:
out.insert(indx, ele)
break
elif indx == len(out) - 1:
out.append(ele)
return out
|
./refactory/data/question_4/code/wrong/wrong_4_115.py
|
refactory_data_question_4_wrong_4_228
|
def sort_age(lst):
youngest = lst[0][1]
for item in lst:
if item[1] < youngest:
youngest = item[1]
lst.remove(item)
lst = item + lst
return lst
|
./refactory/data/question_4/code/wrong/wrong_4_228.py
|
refactory_data_question_4_wrong_4_175
|
def sort_age(lst):
sort=[]
while lst:
smallest = lst[0][1]
for i in range (1,len(lst)):
if lst[i][1] < smallest:
smallest = lst[i][1]
lst.remove(smallest)
sort.append(smallest)
sort.reverse(smallest)
return sort
|
./refactory/data/question_4/code/wrong/wrong_4_175.py
|
refactory_data_question_4_wrong_4_046
|
def sort_age(lst):
output = []
while lst:
smallest = lst[0]
for i in lst:
if i[1] < smallsest[1]:
smallest = i
lst.remove(i)
output.append(i)
return output
|
./refactory/data/question_4/code/wrong/wrong_4_046.py
|
refactory_data_question_4_wrong_4_050
|
def sort_age(lst):
final = []
while lst:
smallest = lst[0]
for i in lst:
if i[1] < smallest[1]:
smallest = i
lst.remove(smallest)
final.append(smallest)
print(lst)
|
./refactory/data/question_4/code/wrong/wrong_4_050.py
|
refactory_data_question_4_wrong_4_291
|
def sort_age(lst):
sort=[]
while lst:
biggest=lst[0][1]
for i in lst:
if i[1]>biggest:
biggest=i[1]
lst.remove(i)
sort.append(i)
return lst# Fill in your code here
|
./refactory/data/question_4/code/wrong/wrong_4_291.py
|
refactory_data_question_4_wrong_4_205
|
def sort_age(lst):
if len(lst)==1:
return lst
else:
used_lst=lst.copy()
ages=()
for i in lst:
ages+=(i[1],)
for i in lst:
if i[1]==max(ages):
new_lst=[i]
used_lst.remove(i)
return new_lst+sort_age(used_lst)
|
./refactory/data/question_4/code/wrong/wrong_4_205.py
|
refactory_data_question_4_wrong_4_037
|
def sort_age(lst):
lst.sort(key=lambda x: x[1],reverse=True)
print(lst)
|
./refactory/data/question_4/code/wrong/wrong_4_037.py
|
refactory_data_question_4_wrong_4_243
|
def sort_age(lst):
list1 = []
i = 0
smallest = lst[0][1]
s = (lst[0],)
for i in range(1,len(lst)):
if lst[i][1] < smallest:
smallest = lst[i][1]
s = (lst[i],)
list1 += s
return list1
|
./refactory/data/question_4/code/wrong/wrong_4_243.py
|
refactory_data_question_4_wrong_4_251
|
def sort_age(lst):
list1 = []
while lst:
biggest = lst[0]
for i in range(1,len(lst)):
if lst[i][1] > biggest[1]:
biggest = lst[i][1]
lst.remove(biggest)
list1.append(biggest)
return list1
|
./refactory/data/question_4/code/wrong/wrong_4_251.py
|
refactory_data_question_4_wrong_4_093
|
def sort_age(lst):
result = []
maximum = 0
for i in lst:
if i[1] > maximum:
maximum = i[1]
result.insert(0,i)
else:
result.append(i)
return result
|
./refactory/data/question_4/code/wrong/wrong_4_093.py
|
refactory_data_question_4_wrong_4_324
|
def sort_age(lst):
newnew = [lst[0]]
for i in lst:
for j in range(len(newnew)):
if i[1]>newnew[j][1]:
newnew.insert(j+1,i)
elif i[1]<newnew[j][1]:
newnew.insert(j,i)
return newnew
return newnew
|
./refactory/data/question_4/code/wrong/wrong_4_324.py
|
refactory_data_question_4_wrong_4_309
|
def sort_age(lst):
for i in range(len(lst-1)):
for j in range(len(lst)-1-i):
if lst[j][1] < lst[j+1][1]:
lst[j][1],lst[j+1][1] = lst[j+1][1],lst[j][1]
else:
continue
return lst
pass
|
./refactory/data/question_4/code/wrong/wrong_4_309.py
|
refactory_data_question_4_wrong_4_007
|
def sort_age(lst):
for i in range(0,len(lst)):
this=lst[i]
for j in range(0,len(lst)):
if lst[j][1]<this[1]:
del lst[i]
lst=lst[0:j-1]+[this]+lst[j:]
return lst# Fill in your code here
pass
|
./refactory/data/question_4/code/wrong/wrong_4_007.py
|
refactory_data_question_4_wrong_4_348
|
def sort_age(lst):
current=0
tup=()
for i in lst:
if i[1]>current:
tup+=tuple(i)
current=i[1]
else:
tup=tuple(i)+tup
return [tup]
|
./refactory/data/question_4/code/wrong/wrong_4_348.py
|
refactory_data_question_4_wrong_4_242
|
def sort_age(lst):
list1 = []
i = 0
smallest = lst[0][1]
s = lst[0]
for i in range(1,len(lst)):
if lst[i][1] < smallest:
smallest = lst[i][1]
s = lst[i]
list1 += s
return list1
|
./refactory/data/question_4/code/wrong/wrong_4_242.py
|
refactory_data_question_4_wrong_4_332
|
def sort_age(lst):
sort = []
while lst:
biggest = lst[0]
for i in lst:
if i[1] > biggest[1]:
biggest - i
lst.remove(biggest)
sort.append(biggest)
return sort
|
./refactory/data/question_4/code/wrong/wrong_4_332.py
|
refactory_data_question_4_wrong_4_200
|
def sort_age(lst):
lst.sort(key=lambda x:x[1],reverse=True)
return lst
|
./refactory/data/question_4/code/wrong/wrong_4_200.py
|
refactory_data_question_4_wrong_4_094
|
def sort_age(lst):
lst.sort(key=lambda tup:tup[1], reverse = True)
return lst
|
./refactory/data/question_4/code/wrong/wrong_4_094.py
|
refactory_data_question_4_wrong_4_070
|
def sort_age(lst):
store = []
oldest = lst[0]
for i in lst[1:]:
if i[1] > oldest[1]:
oldest = i
lst.remove(oldest)
sort.append(oldest)
return sort
|
./refactory/data/question_4/code/wrong/wrong_4_070.py
|
refactory_data_question_4_wrong_4_312
|
def sort_age(lst):
for i in range(len(lst)-1):
for j in range(len(lst)-1-i):
if lst[j][1] < lst[j+1][1]:
lst[j][1],lst[j+1][1] = lst[j+1][1],lst[j][1]
else:
continue
return lst
pass
|
./refactory/data/question_4/code/wrong/wrong_4_312.py
|
refactory_data_question_4_wrong_4_147
|
def sort_age(lst):
sorted = []
while lst:
youngest = lst[0]
for elem in lst:
if elem[1] < youngest[1]:
youngest = elem
print(youngest)
lst.remove(youngest)
sorted.append(youngest)
return sorted
|
./refactory/data/question_4/code/wrong/wrong_4_147.py
|
refactory_data_question_4_wrong_4_354
|
def sort_age(lst):
lst.sort(key = lambda x: x[1],reverse=True)
return lst
|
./refactory/data/question_4/code/wrong/wrong_4_354.py
|
refactory_data_question_4_wrong_4_181
|
def sort_age(lst):
a = lst
sort = []
while a:
largest = a[0]
for item in a:
if item[1] >largest[1]:
largest = item
a.remove(largest)
sort.append(largest)
print(sort)# Fill in your code here
|
./refactory/data/question_4/code/wrong/wrong_4_181.py
|
refactory_data_question_4_wrong_4_049
|
def sort_age(lst):
return lst.sort(key=lambda x: x[1], reverse=True)
|
./refactory/data/question_4/code/wrong/wrong_4_049.py
|
refactory_data_question_4_wrong_4_224
|
def sort_age(lst):
a=[]
for i in lst:
if i==max(lst):
a.append(i)
continue
return a
|
./refactory/data/question_4/code/wrong/wrong_4_224.py
|
refactory_data_question_4_wrong_4_346
|
def sort_age(lst):
current=0
tup=()
for i in lst:
if i[1]>current:
tup+=tuple(i)
current=i[1]
else:
tup=tuple(i)+tup
return tup
|
./refactory/data/question_4/code/wrong/wrong_4_346.py
|
refactory_data_question_4_wrong_4_337
|
def sort_age(lst):
new_lst=[lst[0],]
for x in lst[1:]:
if x[1] > new_lst[-1][1]:
new_lst += [x,]
else:
count=0
while count<len(new_lst):
if x[1] > new_lst[count][1]:
count+=1
continue
else:
new_lst = new_lst[0:count]+[x,]+new_lst[count:]
break
return new_lst[::-1]
|
./refactory/data/question_4/code/wrong/wrong_4_337.py
|
refactory_data_question_4_wrong_4_110
|
def sort_age(lst):
new = []
while lst:
largest = lst[0][1]
for i in lst:
if i[1]>largest:
largest = i[1]
tpl = ()
for j in lst:
if j[1] == largest:
j = tpl
lst.remove(tpl)
new.append(tpl)
return new
|
./refactory/data/question_4/code/wrong/wrong_4_110.py
|
refactory_data_question_4_wrong_4_019
|
def sort_age(lst):
product = []
while lst:
smallest = lst[0]
for i in lst:
if i[1]<smallest[1]:
smallest = i
lst.remove(smallest)
product.append(smallest)
return product
|
./refactory/data/question_4/code/wrong/wrong_4_019.py
|
refactory_data_question_4_wrong_4_320
|
def sort_age(lst):
lst.sort(key = lambda x: x[1], reverse = True)
return lst
|
./refactory/data/question_4/code/wrong/wrong_4_320.py
|
refactory_data_question_4_wrong_4_277
|
def sort_age(lst):
lst.sort(key=lambda x: x[1], reverse = True)
return lst
pass
|
./refactory/data/question_4/code/wrong/wrong_4_277.py
|
refactory_data_question_4_wrong_4_047
|
def sort_age(lst):
output = []
while lst:
smallest = lst[0]
for i in lst:
if i[1] < smallest[1]:
smallest = i
lst.remove(i)
output.append(i)
return output
|
./refactory/data/question_4/code/wrong/wrong_4_047.py
|
refactory_data_question_4_wrong_4_054
|
def sort_age(lst):
newlst = []
while lst:
current = lst[0]
for element in lst:
if element[1] < current[1]:
current = element
newlst += (current,)
lst.remove(current)
return newlst
|
./refactory/data/question_4/code/wrong/wrong_4_054.py
|
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.