Enable Javascript in your browser and then refresh this page, for a much enhanced experience.
First solution in Uncategorized category for Absolute Sorting by ppitek40
import math
def checkio(numbers_array):
lista = []
for i in numbers_array:
lista.append(int(i))
n = len(numbers_array)
while n > 1:
for i in range(n - 1):
if abs(lista[i]) > abs(lista[i + 1]):
lista[i], lista[i + 1] = lista[i + 1], lista[i]
n = n - 1
return lista
#These "asserts" using only for self-checking and not necessary for auto-testing
if __name__ == '__main__':
def check_it(array):
if not isinstance(array, (list, tuple)):
raise TypeError("The result should be a list or tuple.")
return list(array)
assert check_it(checkio((-20, -5, 10, 15))) == [-5, 10, 15, -20], "Example" # or (-5, 10, 15, -20)
assert check_it(checkio((1, 2, 3, 0))) == [0, 1, 2, 3], "Positive numbers"
assert check_it(checkio((-1, -2, -3, 0))) == [0, -1, -2, -3], "Negative numbers"
print("Coding complete? Click 'Check' to review your tests and earn cool rewards!")
Dec. 11, 2017