/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

0 vote335 views1 answer
Numpy move columns
Python
0 vote367 views1 answer
Get turtle pos
Python
4 votes397 views3 answers
AttributeError: module 'tensorflow._api.v2.train' has no attribute 'GradientDescentOptimizer' site:stackoverflow.com
Python
2 votes392 views1 answer
Not x axis labels python
Python
3 votes369 views1 answer
Python nested functions get variables from function scope
Python
2 votes317 views1 answer
Give a function a name python
Python
2 votes334 views1 answer
Django models distinct
Python
0 vote352 views1 answer
Python svg viewing
Python
11 votes334 views3 answers
How to convert a list into string with \n
Python
1 vote360 views1 answer
Changing instance through dict changes all instances
Python