/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 vote158 views1 answer
Multiplication of matrix in python
Python
0 vote178 views1 answer
Pip install google cloud secret manager
Python
0 vote191 views1 answer
Get_permissions
Python
0 vote253 views1 answer
Position in array python
Python
1 vote175 views1 answer
Python in line conditional statement
Python
0 vote141 views1 answer
Fibonacci sequence in python
Python
0 vote198 views1 answer
Python get timestamp of today
Python
2 votes174 views1 answer
Python merge strings in columns
Python
16 votes248 views5 answers
Primes in python
Python
0 vote178 views2 answers
3.81/(1000*1000*100)
Python