/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 vote151 views1 answer
Read ms word with python
Python
0 vote138 views1 answer
Download csv file from jupyter notebook
Python
0 vote143 views1 answer
Spark group by alias
Python
0 vote130 views1 answer
Difference between end and sep python
Python
0 vote128 views2 answers
Arg parse array argument
Python
1 vote157 views1 answer
Fourreau de maroquin
Python
0 vote131 views7 answers
Online python compailer
Python
0 vote133 views1 answer
Numpy second derivative of array
Python
0 vote185 views1 answer
Isidentifier method in python
Python
225 votes347 views6 answers
Random number generator python
Python