/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 vote343 views1 answer
Cv2 reverse contrast
Python
0 vote92 views1 answer
Python move all txt files
Python
69 votes133 views6 answers
How to activate venv python
Python
0 vote156 views1 answer
Bad resolution with df plot
Python
-1 vote124 views1 answer
Heads or tails python
Python
1 vote90 views1 answer
Drop rows pandas where value
Python
0 vote144 views1 answer
Is file a keywoard in python
Python
0 vote127 views1 answer
Extract a jar py
Python
19 votes190 views1 answer
Python substring
Python
66 votes126 views6 answers
Wait function python
Python