Enable Javascript in your browser and then refresh this page, for a much enhanced experience.
Absolute sorting solution in Clear category for Absolute Sorting by joskar1999
def checkio(numbers_array):
tab = []
pom = 0
for i in range(len(numbers_array)):
tab.append(numbers_array[i])
for i in range(len(numbers_array)-1):
for j in range(len(numbers_array)-1):
if abs(tab[j]) > abs(tab[j+1]):
pom = tab[j]
tab[j] = tab[j+1]
tab[j+1] = pom
return tab
#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!")
Oct. 21, 2017
