/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 vote120 views2 answers
Url namespaces for django rest router urls
Python
13 votes95 views6 answers
Range in python
Python
1 vote109 views1 answer
Data structures and algorithms in python
Python
0 vote97 views1 answer
How to add textbox in pygame window
Python
1 vote139 views1 answer
Django urlpattern
Python Django
0 vote100 views1 answer
Custom_settings in scrpay
Python
9 votes98 views1 answer
How to convert a set to a list in python
Python
0 vote101 views1 answer
Stackoverflow: install old version of networkx
Python
2 votes101 views1 answer
Get list of all files in folder and subfolders python
Python
3 votes103 views3 answers
Load saved model
Python