id stringlengths 35 39 | content stringlengths 44 3.85k | max_stars_repo_path stringlengths 52 57 |
|---|---|---|
refactory_data_question_5_wrong_5_087 | def top_k(lst, k):
list = []
while len(lst) < k:
a = max(lst)
lst.remove(a)
new.append(a)
return list
| ./refactory/data/question_5/code/wrong/wrong_5_087.py |
refactory_data_question_5_wrong_5_028 | def top_k(lst, k):
sort = []
while lst:
largest = lst[0]
for i in lst:
if i > largest:
largest = i
sort.append(i)
return sort[:k-1]
| ./refactory/data/question_5/code/wrong/wrong_5_028.py |
refactory_data_question_5_wrong_5_098 | def top_k(lst, k):
l = []
if k > len(lst):
return False
elif k == 1:
return lst
else:
a = max(lst)
lst.remove(a)
l.append(a)
return top_k(lst, k-1)
# Fill in your code here
pass
| ./refactory/data/question_5/code/wrong/wrong_5_098.py |
refactory_data_question_5_wrong_5_020 | def top_k(lst, k):
arranged = []
while k > 0:
lst.remove(max(lst))
arranged.append(max(lst))
k = k-1
return arranged
pass
| ./refactory/data/question_5/code/wrong/wrong_5_020.py |
refactory_data_question_5_wrong_5_088 | def top_k(lst, k):
lst = sort_descending(lst)
return lst[:k-1]
def sort_descending(lst):
for i in range(len(lst)-1):
for j in range(i, len(lst)):
if lst[j][1] > lst[i][1]:
x = lst[i]
lst[i] = lst[j]
lst[j] = x
return lst
| ./refactory/data/question_5/code/wrong/wrong_5_088.py |
refactory_data_question_5_wrong_5_037 | def top_k(lst, k):
sort = []
while lst:
smallest = lst[0]
for i in lst:
if i<smallest:
smallest = i
lst.remove(smallest)
sort.append(smallest)
counter = k
while counter !=len(lst):
lst.pop()
counter += 1
return lst
| ./refactory/data/question_5/code/wrong/wrong_5_037.py |
refactory_data_question_5_wrong_5_008 | def top_k(lst, k):
sort = []
while lst:
biggest = lst[0]
for element in lst:
if element > biggest:
biggest = element
lst.remove(biggest)
sort.append(biggest)
return sort[:k+1]
| ./refactory/data/question_5/code/wrong/wrong_5_008.py |
refactory_data_question_5_wrong_5_011 | def sort_age(lst):
new=[]
while lst !=[]:
big=lst[0]
for i in lst:
if i[1]>big[1]:
big=i
lst.remove(big)
new.append(big)
return new
def top_k(lst, k):
return sort_age(lst)[:k]
pass
| ./refactory/data/question_5/code/wrong/wrong_5_011.py |
refactory_data_question_5_wrong_5_013 | def top_k(lst, k):
if lst == []:
return lst
lower = []
higher = []
plist = []
pivot = lst[0]
for e in lst:
if e < pivot:
lower.append(e)
if x == pivot:
plist.append(e)
if x > pivot:
higher.append(e)
sort_list ... | ./refactory/data/question_5/code/wrong/wrong_5_013.py |
refactory_data_question_5_wrong_5_063 | def top_k(lst, k):
if k<=0:
return []
else:
maxi=max(lst)
length=len(lst)
for i in range(length):
if lst[i]==maxi:
pos=i
new_list=lst.copy()
new_list.pop(pos)
return [maxi]+top_k(new_lst,k-1)
| ./refactory/data/question_5/code/wrong/wrong_5_063.py |
refactory_data_question_5_wrong_5_077 |
def top_k(lst, k):
# Fill in your code here
result = []
while lst:
minimum = lst[0] # arbitrary number in list
for x in lst:
if x > minimum:
minimum = x
result.append(minimum)
lst.remove(minimum)
return lst[:k]
| ./refactory/data/question_5/code/wrong/wrong_5_077.py |
refactory_data_question_5_wrong_5_039 | def top_k(lst, k):
i=0
while i+1<len(lst):
if lst[i]<lst[i+1]:
lst.extend([i])
lst.pop(i)
i=0
else:
i+=1
return lst[:4]
| ./refactory/data/question_5/code/wrong/wrong_5_039.py |
refactory_data_question_5_wrong_5_035 | def top_k(lst, k):
if lst == []:
return []
else:
final = []
while lst:
element = max(lst)
final += [element,]
lst.remove(element)
if len(final) == k:
break
return final
| ./refactory/data/question_5/code/wrong/wrong_5_035.py |
refactory_data_question_5_wrong_5_054 | def top_k(lst, k):
count = 0
op = []
big = lst[0]
while count < k:
op += [max(lst)]
count += 1
return op
| ./refactory/data/question_5/code/wrong/wrong_5_054.py |
refactory_data_question_5_wrong_5_072 | def top_k(lst, k):
results = []
counter = 0
while counter < k:
for i in range(-len(lst),-1):
if lst[i] == max(lst):
results.append(lst.pop(i))
counter += 1
return results
| ./refactory/data/question_5/code/wrong/wrong_5_072.py |
refactory_data_question_5_wrong_5_041 | def top_k(lst, k):
i=0
while i+1<len(lst):
if lst[i]<lst[i+1]:
lst.extend([i])
lst.pop(i)
i=0
else:
i+=1
return lst[:k]
| ./refactory/data/question_5/code/wrong/wrong_5_041.py |
refactory_data_question_5_wrong_5_091 | def top_k(lst, k):
lst2 = []
max = lst[0]
for i in lst:
if i > max:
max = i
while len(lst2) != k:
lst2.append(max)
return lst2
| ./refactory/data/question_5/code/wrong/wrong_5_091.py |
refactory_data_question_5_wrong_5_083 | def top_k(lst, k):
result = []
for i in range(len(lst)):
largest = lst[0]
for element in lst:
if element > largest:
largest = element
lst.remove(largest)
result.append(largest)
return lst[:k]
| ./refactory/data/question_5/code/wrong/wrong_5_083.py |
refactory_data_question_5_wrong_5_053 | def top_k(lst, k):
count = 0
op = []
big = lst[0]
while count < k:
op += max(lst)
count += 1
return op
| ./refactory/data/question_5/code/wrong/wrong_5_053.py |
refactory_data_question_5_wrong_5_085 | def top_k(lst, k):
result = []
while len(lst)>len(lst)-k:
biggest = lst[0]
for element in lst:
if element > biggest:
biggest = element
result.append(biggest)
lst.remove(biggest)
return result
pass
| ./refactory/data/question_5/code/wrong/wrong_5_085.py |
refactory_data_question_5_wrong_5_104 | def top_k(lst, k):
counter=0
new_lst=[]
while counter<k:
maxi=max(lst)
new_lst.append(maxi)
lst.remove(maxi)
counter+=1
| ./refactory/data/question_5/code/wrong/wrong_5_104.py |
refactory_data_question_5_wrong_5_009 | def top_k(lst, k):
n = len(lst) - k
counter = 0
while counter < k:
lst.remove(min(lst))
counter = counter + 1
sort_list = []
while lst != []:
sort_lst.append(max(lst))
lst.remove(max(lst))
return sort_list
| ./refactory/data/question_5/code/wrong/wrong_5_009.py |
refactory_data_question_5_wrong_5_066 | def top_k(lst, k):
# Fill in your code here
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)
return(sort)[:k]
| ./refactory/data/question_5/code/wrong/wrong_5_066.py |
refactory_data_question_5_wrong_5_055 | def top_k(lst, k):
values = []
greatest = lst[0]
while len(values) < k:
for item in lst:
if item > greatest:
greatest = item
lst.remove(greatest)
values.append(greatest)
greatest = lst[0]
return values
| ./refactory/data/question_5/code/wrong/wrong_5_055.py |
refactory_data_question_5_wrong_5_073 | def top_k(lst, k):
results = []
counter = 0
while counter < k:
for i in range(-len(lst),0):
if lst[i] == max(lst):
results.append(lst.pop(i))
counter += 1
continue
return results
| ./refactory/data/question_5/code/wrong/wrong_5_073.py |
refactory_data_question_5_wrong_5_078 | def top_k(lst, k):
sort = []
while lst:
largest = lst[0]
for element in lst:
if element > largest:
largest = element
lst.remove(largest)
sort.append(largest)
return sort[:k]
| ./refactory/data/question_5/code/wrong/wrong_5_078.py |
refactory_data_question_5_wrong_5_099 | def top_k(lst, k):
l = []
if k > len(lst):
return False
elif k == 1:
return lst
else:
a = max(lst)
lst.remove(a)
l.append(a)
top_k(lst, k-1)
return l
# Fill in your code here
pass
| ./refactory/data/question_5/code/wrong/wrong_5_099.py |
refactory_data_question_5_wrong_5_084 | def top_k(lst, k):
new_list = []
for i in lst:
if k==0:
break
new_list+=max(lst)
k-1
return lst
pass
| ./refactory/data/question_5/code/wrong/wrong_5_084.py |
refactory_data_question_5_wrong_5_007 | def top_k(lst, k):
lst1 = []
for i in lst:
if i >= k:
lst1.append(i)
sort = []
while lst1:
biggest = lst[0]
for element in lst1:
if element > biggest:
biggest = element
lst1.remove(biggest)
sort.append(biggest)
return ... | ./refactory/data/question_5/code/wrong/wrong_5_007.py |
refactory_data_question_5_wrong_5_006 | def top_k(lst, k):
sort = []
while lst:
biggest = lst[0]
for element in lst:
if element > biggest:
biggest = element
lst.remove(biggest)
sort.append(biggest)
if len(sort)==k:
break
return sort
| ./refactory/data/question_5/code/wrong/wrong_5_006.py |
refactory_data_question_5_wrong_5_043 | def top_k(lst, k):
a=[]
while lst:
largest = lst[0]
for i in lst:
if i > largest:
largest = i
lst.remove(largest)
a.append(largest)
return a[:k]
| ./refactory/data/question_5/code/wrong/wrong_5_043.py |
refactory_data_question_5_wrong_5_103 | def top_k(lst, k):
counter=0
new_lst=[]
while counter<k:
maxi=max(lst)
new_lst.append(maxi)
lst.remove(maxi)
| ./refactory/data/question_5/code/wrong/wrong_5_103.py |
refactory_data_question_5_wrong_5_038 | def top_k(lst, k):
i=0
while i+1<len(lst):
if lst[i]<lst[i+1]:
lst.extend([i])
lst.pop(i)
i=0
else:
i+=1
return lst[:4]
| ./refactory/data/question_5/code/wrong/wrong_5_038.py |
refactory_data_question_5_wrong_5_095 | def top_k(lst, k):
for i in range(len(lst)):
for j in range(len(lst) - 1):
if lst[j] > lst[j + 1]:
lst[j] = lst[j + 1]
lst[j + 1] = lst[j]
lst.reverse()
return lst[:k]
pass
| ./refactory/data/question_5/code/wrong/wrong_5_095.py |
refactory_data_question_5_wrong_5_024 | def top_k(lst, k):
sort = []
while lst:
biggest = lst[0]
for i in lst[1:]:
if i > biggest:
oldest = i
lst.remove(biggest)
sort.append(biggest)
n = 1
sort_k = []
while n <= k:
sort_k.append(sort.pop[0])
n += 1
r... | ./refactory/data/question_5/code/wrong/wrong_5_024.py |
refactory_data_question_5_wrong_5_010 | def top_k(lst, k):
n = len(lst) - k
counter = 0
while counter < k:
lst.remove(min(lst))
counter = counter + 1
sort_list = []
while lst != []:
sort_list.append(max(lst))
lst.remove(max(lst))
return sort_list
| ./refactory/data/question_5/code/wrong/wrong_5_010.py |
refactory_data_question_5_wrong_5_089 | def top_k(lst, k):
newlist = []
while lst:
biggest = lst[0]
for i in lst:
if i > biggest:
biggest = i
else:
continue
lst.remove(biggest)
if len(newlist) == k:
break
else:
newlist.append(bigges... | ./refactory/data/question_5/code/wrong/wrong_5_089.py |
refactory_data_question_5_wrong_5_065 | def top_k(lst, k):
x = []
for i in range(k-1):
y = i
for j in lst:
if y < j:
y = j
x += y
return x
pass
| ./refactory/data/question_5/code/wrong/wrong_5_065.py |
refactory_data_question_5_wrong_5_076 | def top_k(lst, k):
new = []
while len(lst) > len(lst) - k:
top = max(lst)
new.append(top)
lst.remove(top)
return new
| ./refactory/data/question_5/code/wrong/wrong_5_076.py |
refactory_data_question_5_wrong_5_101 | def top_k(lst, k):
# Fill in your code here
sort=sort(lst)
return sort[:k]
def sort(lst):
sort=[]
while lst:
largest=lst[0]
for elem in lst:
if elem > largest:
largest = elem
lst.remove(largest)
sort.append(largest)
return sort
| ./refactory/data/question_5/code/wrong/wrong_5_101.py |
refactory_data_question_5_wrong_5_100 | def top_k(lst, k):
l = []
if k > len(lst):
return False
elif k == 1:
return lst
else:
while len(l) <= k:
a = max(lst)
lst.remove(a)
l.append(a)
return l
# Fill in your code here
pass
| ./refactory/data/question_5/code/wrong/wrong_5_100.py |
refactory_data_question_5_wrong_5_045 | def top_k(lst, k):
newlst = []
while len(newlst)<=k:
maximum = lst[0]
for i in lst:
if i > maximum:
maximum = i
newlst.append(maximum)
lst.remove(maximum)
return newlst
| ./refactory/data/question_5/code/wrong/wrong_5_045.py |
refactory_data_question_5_wrong_5_064 | def top_k(lst, k):
results = []
counter = 0
while counter < k:
for i in range(-len(lst),-1):
if lst[i] == max(lst):
results.append(lst.pop(i))
counter += 1
return results
pass
| ./refactory/data/question_5/code/wrong/wrong_5_064.py |
refactory_data_question_5_wrong_5_047 | def top_k(lst, k):
sorted_lst = []
while lst:
for n in range(1, len(lst)):
biggest = lst[0]
if lst[n] > biggest:
biggest = lst[n]
lst.remove(biggest)
sorted_lst.append(biggest)
return sorted_lst[0:3]
| ./refactory/data/question_5/code/wrong/wrong_5_047.py |
refactory_data_question_5_wrong_5_051 | def top_k(lst, k):
a=[]
while lst:
biggest=lst[0]
for i in lst:
if i>biggest:
biggest=i
lst.remove(biggest)
a.append(biggest)
return a[0:k]
| ./refactory/data/question_5/code/wrong/wrong_5_051.py |
refactory_data_question_5_wrong_5_107 | def top_k(lst, k):
newlst = []
for i in range(k+1):
newlst.append(max(lst))
lst.remove(max(lst))
return newlst
| ./refactory/data/question_5/code/wrong/wrong_5_107.py |
refactory_data_question_5_wrong_5_021 | def top_k(lst, k):
r=[]
for qwerty in range(0,k):
biggest=lst[0]
for k in lst:
if biggest<k:
biggest=k
r.append[biggest]
lst.remove[biggest]
return r
| ./refactory/data/question_5/code/wrong/wrong_5_021.py |
refactory_data_question_5_wrong_5_094 | def top_k(lst, k):
for i in range(len(lst)):
for j in range(len(lst) - 1):
if lst[j] > lst[j + 1]:
lst[j] = lst [j + 1]
lst[j + 1] = lst[j]
lst.reverse()
return lst[:k]
pass
| ./refactory/data/question_5/code/wrong/wrong_5_094.py |
refactory_data_question_5_wrong_5_015 | def top_k(lst, k):
if lst == []:
return lst
lower = []
higher = []
plist = []
pivot = lst[0]
for e in lst:
if e < pivot:
lower.append(e)
if e == pivot:
plist.append(e)
if e > pivot:
higher.append(e)
sort_list ... | ./refactory/data/question_5/code/wrong/wrong_5_015.py |
refactory_data_question_5_wrong_5_019 | def top_k(lst, k):
arranged = []
while k>0:
lst.remove(max(lst))
arranged.append(max(lst))
k -= 1
return arranged
pass
| ./refactory/data/question_5/code/wrong/wrong_5_019.py |
refactory_data_question_5_wrong_5_027 | def top_k(lst, k):
sorted_lst = lst
while sorted_lst:
largest = sorted_lst[0]
for element in sorted_lst:
if element > largest:
largest = element
sorted_lst.remove(largest)
sorted_lst.append(largest)
return sorted_lst[:k-1]
pass
| ./refactory/data/question_5/code/wrong/wrong_5_027.py |
refactory_data_question_5_wrong_5_057 | def top_k(lst, k):
sort = []
while lst:
biggest = lst[0]
for element in lst:
if element > biggest:
biggest = element
lst.remove(biggest)
sort.append(biggest)
if len(sort) == k:
return sort
else:
continue
| ./refactory/data/question_5/code/wrong/wrong_5_057.py |
refactory_data_question_5_wrong_5_075 | def top_k(lst, k):
new = []
while len(lst) >= len(lst) - k:
top = max(lst)
new.append(top)
lst.remove(top)
return new
| ./refactory/data/question_5/code/wrong/wrong_5_075.py |
refactory_data_question_5_wrong_5_004 | def top_k(lst, k):
sort = []
while lst:
biggest = lst[0]
for element in lst:
if ele > biggest:
biggest = ele
lst.remove(element)
sort.append(element)
if len(sort)==k:
break
return sort
| ./refactory/data/question_5/code/wrong/wrong_5_004.py |
refactory_data_question_5_wrong_5_092 | def top_k(lst, k):
lst2 = []
max = lst[0]
for i in lst:
if i > max:
max = i
lst.pop(max)
while len(lst2) != k:
lst2.append(max)
return lst2
| ./refactory/data/question_5/code/wrong/wrong_5_092.py |
refactory_data_question_5_wrong_5_068 | def top_k(lst, k):
new = []
for i in range(k-1):
new.append(lst.pop(max(lst)))
return new
| ./refactory/data/question_5/code/wrong/wrong_5_068.py |
refactory_data_question_5_wrong_5_030 | def top_k(lst, k):
sort, output = [], []
while lst:
largest = lst[0]
for i in lst:
if i > largest:
largest = i
lst.remove(largest)
sort.append(largest)
for j in sort:
output.append(j)
if len(output) == k:
break
retur... | ./refactory/data/question_5/code/wrong/wrong_5_030.py |
refactory_data_question_5_wrong_5_031 | def top_k(lst, k):
new_lst = []
while lst:
largest = lst[0]
for numbers in lst:
if numbers > largest:
largest = numbers
new_lst.append(lst.pop(largest))
return new_lst[:k]
| ./refactory/data/question_5/code/wrong/wrong_5_031.py |
refactory_data_question_5_wrong_5_082 | def top_k(lst, k):
sotsot = []
while lst:
while len(sotsot)<=k :
sotsot.append(max(lst))
lst.remove(max(lst)) #wont return u any value just modified the list only.
return sotsot
| ./refactory/data/question_5/code/wrong/wrong_5_082.py |
refactory_data_question_5_wrong_5_106 | def top_k(lst, k):
new = []
lst.sort()
for i in range(k-1):
new.append(lst[i])
return new
| ./refactory/data/question_5/code/wrong/wrong_5_106.py |
refactory_data_question_5_wrong_5_023 | def top_k(lst, k):
sort = []
while lst:
biggest = lst[0]
for i in lst[1:]:
if i > biggest:
oldest = i
lst.remove(biggest)
sort.append(biggest)
n = 1
sort_k = []
while n <= k:
sort_k.append(sort.pop[0])
return sort_k
... | ./refactory/data/question_5/code/wrong/wrong_5_023.py |
refactory_data_question_5_wrong_5_096 | def top_k(lst, k):
for i in range(len(lst)-1):
if lst[i]<lst[i+1]:
lst[i],lst[i+1]=lst[i+1],lst[i]
return lst[:k]
| ./refactory/data/question_5/code/wrong/wrong_5_096.py |
refactory_data_question_5_wrong_5_050 | def top_k(lst, k):
newlist = []
while len(newlist) < k:
newlist += [max(lst)]
for i in range(len(lst)):
if i == max(lst):
print(i)
break
del lst[i]
return newlist
| ./refactory/data/question_5/code/wrong/wrong_5_050.py |
refactory_data_question_5_wrong_5_033 | def top_k(lst, k):
final = []
while lst:
largest = lst[0]
for element in lst:
if element > largest:
largest = element
lst.remove(largest)
final.append(largest)
if len(final) == k:
break
return final
| ./refactory/data/question_5/code/wrong/wrong_5_033.py |
refactory_data_question_5_wrong_5_036 | def top_k(lst, k):
if lst == []:
return []
elif k == 0:
return lst
else:
final = []
while lst:
element = max(lst)
final += [element,]
lst.remove(element)
if len(final) == k:
break
return final
| ./refactory/data/question_5/code/wrong/wrong_5_036.py |
refactory_data_question_5_wrong_5_058 | def top_k(lst, k):
new_lst = []
for i in range(k):
new_lst.append(max(lst))
return new_lst
pass
| ./refactory/data/question_5/code/wrong/wrong_5_058.py |
refactory_data_question_5_wrong_5_081 | def top_k(lst, k):
sotsot = []
while lst:
while len(sotsot) <=k:
sotsot.append(max(lst))
lst.remove(max(lst)) #wont return u any value just modified the list only.
return sotsot
| ./refactory/data/question_5/code/wrong/wrong_5_081.py |
refactory_data_question_5_wrong_5_080 | def top_k(lst, k):
sotsot = []
while len(sotsot) <=k:
sotsot.append(max(lst))
lst.remove(max(lst)) #wont return u any value just modified the list only.
return sotsot
| ./refactory/data/question_5/code/wrong/wrong_5_080.py |
refactory_data_question_5_wrong_5_026 | def top_k(lst, k):
if lst==[]:
return []
sort=[]
while lst:
largest = lst[0]
for i in lst:
if i[1] > largest[1]:
largest = i
lst.remove(largest)
sort.append(largest)
return sort[:k]
pass
| ./refactory/data/question_5/code/wrong/wrong_5_026.py |
refactory_data_question_5_wrong_5_005 | def top_k(lst, k):
sort = []
while lst:
biggest = lst[0]
for element in lst:
if element > biggest:
biggest = element
lst.remove(element)
sort.append(element)
if len(sort)==k:
break
return sort
| ./refactory/data/question_5/code/wrong/wrong_5_005.py |
refactory_data_question_5_wrong_5_022 | def top_k(lst, k):
rs=[]
for qwerty in range(0,k):
biggest=lst[0]
for k in lst:
if biggest<k:
biggest=k
rs.append[biggest]
lst.remove[biggest]
return r
| ./refactory/data/question_5/code/wrong/wrong_5_022.py |
refactory_data_question_5_wrong_5_016 | def top_k(lst, k):
if lst == []:
return lst
lower = []
higher = []
plist = []
pivot = lst[0]
for e in lst:
if e < pivot:
lower.append(e)
if e == pivot:
plist.append(e)
if e > pivot:
higher.append(e)
sort_list ... | ./refactory/data/question_5/code/wrong/wrong_5_016.py |
refactory_data_question_5_wrong_5_025 | def top_k(lst, k):
sort = []
while lst:
biggest = lst[0]
for i in lst[1:]:
if i > biggest:
oldest = i
lst.remove(biggest)
sort.append(biggest)
n = 1
sort_k = []
while n <= k:
sort_k.append(sort.pop(0))
n += 1
r... | ./refactory/data/question_5/code/wrong/wrong_5_025.py |
refactory_data_question_5_wrong_5_059 | def top_k(lst, k):
new_lst = []
for i in range(k):
new_lst.append(lst.remove(max(lst)))
return new_lst
pass
| ./refactory/data/question_5/code/wrong/wrong_5_059.py |
refactory_data_question_5_wrong_5_070 | def top_k(lst, k):
new = []
while len(lst) > len(lst) - k:
new.append(lst.remove(max(lst)))
return new
| ./refactory/data/question_5/code/wrong/wrong_5_070.py |
refactory_data_question_5_wrong_5_052 | def top_k(lst, k):
a = sort_list(lst)
return a[0:k]
| ./refactory/data/question_5/code/wrong/wrong_5_052.py |
refactory_data_question_5_wrong_5_042 | def top_k(lst, k):
#top k in descending order
sort = []
x = len(lst)
while x >= x-k:
largest = lst[0]
for element in lst:
if element > largest:
largest = element
lst.remove(largest)
sort.append(largest)
return sort
| ./refactory/data/question_5/code/wrong/wrong_5_042.py |
refactory_data_question_5_wrong_5_079 | def top_k(lst, k):
# Fill in your code here
sort_lst = []
while lst: # a is not []
smallest = lst[0]
for element in lst:
if element < smallest:
smallest = element
lst.remove(smallest)
sort_lst.append(smallest)
return sort_lst[:k]
| ./refactory/data/question_5/code/wrong/wrong_5_079.py |
refactory_data_question_5_wrong_5_069 | def top_k(lst, k):
new = []
while len(lst) > len(lst) - k:
new.append(lst.pop(max(lst)))
return new
| ./refactory/data/question_5/code/wrong/wrong_5_069.py |
refactory_data_question_5_wrong_5_102 | def top_k(lst, k):
counter=0
new_lst=[]
while counter<k:
new_lst.append(lst.remove(max(lst)))
| ./refactory/data/question_5/code/wrong/wrong_5_102.py |
refactory_data_question_5_wrong_5_003 | def top_k(lst, k):
tmp = []
while len(lst) > 0:
tmp.append(max(lst))
lst.remove(max(lst))
return tmp[:5]
| ./refactory/data/question_5/code/wrong/wrong_5_003.py |
refactory_data_question_5_wrong_5_061 | def top_k(lst, k):
new_lst = []
while lst:
biggest = lst[0]
for x in lst:
if x > lst[0]:
biggest = x
lst.remove(biggest)
new_lst.append(biggest)
return new_lst[0:k]
| ./refactory/data/question_5/code/wrong/wrong_5_061.py |
refactory_data_question_5_wrong_5_014 | def top_k(lst, k):
if lst == []:
return lst
lower = []
higher = []
plist = []
pivot = lst[0]
for e in lst:
if e < pivot:
lower.append(e)
if e == pivot:
plist.append(e)
if e > pivot:
higher.append(e)
sort_list ... | ./refactory/data/question_5/code/wrong/wrong_5_014.py |
refactory_data_question_5_wrong_5_048 | def top_k(lst, k):
sorted_lst = []
while lst:
for n in range(1, len(lst)):
biggest = lst[0]
if lst[n] >= biggest:
biggest = lst[n]
lst.remove(biggest)
sorted_lst.append(biggest)
return sorted_lst[0:k]
| ./refactory/data/question_5/code/wrong/wrong_5_048.py |
refactory_data_question_5_wrong_5_049 | def top_k(lst, k):
sorted_lst = []
while lst:
biggest = lst[0]
for n in lst:
if lst[n] >= biggest:
biggest = lst[n]
lst.remove(biggest)
sorted_lst.append(biggest)
return sorted_lst[0:k]
| ./refactory/data/question_5/code/wrong/wrong_5_049.py |
refactory_data_question_5_wrong_5_062 | def top_k(lst,k):
a = []
while lst:
biggest = lst[0]
for element in lst:
if element > biggest:
biggest = element
lst.remove(biggest)
a.append(biggest)
return a[:3]
| ./refactory/data/question_5/code/wrong/wrong_5_062.py |
refactory_data_question_5_wrong_5_040 | def top_k(lst, k):
i=0
while i+1<len(lst):
if lst[i]<lst[i+1]:
lst.extend([i])
lst.pop(i)
i=0
else:
i+=1
return lst[:k+1]
| ./refactory/data/question_5/code/wrong/wrong_5_040.py |
refactory_data_question_5_wrong_5_046 | def top_k(lst, k):
new_list = []
while len(new_list) < k:
maximum = max(lst)
new_lst.append(lst)
lst.remove(maximum)
return new_lst
| ./refactory/data/question_5/code/wrong/wrong_5_046.py |
refactory_data_question_5_wrong_5_012 | def top_k(lst, k):
if lst == []:
return lst
lower = []
higher = []
plist = []
pivot = lst[0]
for e in lst:
if e < pivot:
lower.append(e)
if x == pivot:
plist.append(e)
if x > pivot:
higher.append(e)
sort_list ... | ./refactory/data/question_5/code/wrong/wrong_5_012.py |
refactory_data_question_5_wrong_5_018 | def top_k(lst, k):
# Fill in your code here
sort = []
while lst: # a is not []
largest = lst[0]
for element in lst:
if element > largest:
largest = element
lst.remove(largest)
sort.append(largest)
return sort[:k+1]
| ./refactory/data/question_5/code/wrong/wrong_5_018.py |
refactory_data_question_5_wrong_5_086 | def top_k(lst, k):
list = []
while len(list) < k:
a = max(lst)
lst.remove(a)
new.append(a)
return list
| ./refactory/data/question_5/code/wrong/wrong_5_086.py |
refactory_data_question_5_wrong_5_032 | def top_k(lst, k):
new_lst = []
while lst:
largest = lst[0]
for numbers in lst:
if numbers > largest:
largest = numbers
new_lst.append(numbers)
lst.remove(numbers)
return new_lst[:k]
| ./refactory/data/question_5/code/wrong/wrong_5_032.py |
refactory_data_question_5_wrong_5_093 | def top_k(lst, k):
result = []
while lst:
biggest = lst[0]
for elem in lst:
if elem > biggest:
biggest = elem
lst.remove(biggest)
result.append(biggest)
return result[:3]
# Fill in your code here
pass
| ./refactory/data/question_5/code/wrong/wrong_5_093.py |
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.