/Python/Python sorting array without inbuilt sort

Python sorting array without inbuilt sort

data_list = [-5, -23, 5, 0, 23, -6, 23, 67]
new_list = []

while data_list:
    minimum = data_list[0]  # arbitrary number in list 
    for x in data_list: 
        if x < minimum:
            minimum = x
    new_list.append(minimum)
    data_list.remove(minimum)    

print new_list

Source: stackoverflow.com

Sorting numbers in python without sort function

number=[1,5,6,9,0]
for i in range(len(number)):
  for j in range(i+1,len(number)):
    if number[i]<number[j]:
      number[i],number[j]=number[j],number[i]
print(number)

-1

Similar codes

1 vote268 views1 answer
All pdf in a directory to csv python
Python
0 vote253 views1 answer
Push notification using python
Python
0 vote365 views1 answer
Cv2.imshow not working in vscode
Python
0 vote253 views1 answer
Gpu version of pytorch
Python
0 vote271 views1 answer
Music distorted on discord
Python
0 vote225 views6 answers
How to write a correct python code
Python
1 vote288 views1 answer
Kmeans sklearn
Python
0 vote276 views2 answers
Python add 1
Python
0 vote307 views1 answer
Qcut and cut function in python stack overflow
Python
39 votes255 views2 answers
Pandas how to get last index
Python