Enable Javascript in your browser and then refresh this page, for a much enhanced experience.
First solution in Clear category for Absolute Sorting by zimnytam
def checkio(numbers_array):
numbers_array = list(numbers_array)
n=1
while n < len(numbers_array):
k=1
while k < len(numbers_array):
if abs(numbers_array[k]) < abs(numbers_array[k-1]):
zimniok = numbers_array[k-1]
numbers_array[k-1] = numbers_array[k]
numbers_array[k] = zimniok
k=k+1
n=n+1
return numbers_array
#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!")
Jan. 6, 2018
