Enable Javascript in your browser and then refresh this page, for a much enhanced experience.
Absolute sorting solution in Uncategorized category for Absolute Sorting by capback250
def checkio(numbers_array):
arr = list(numbers_array)
n = 1
while n < len(arr):
for i in range(len(arr)-n):
if abs(arr[i]) > abs(arr[i+1]):
arr[i], arr[i+1] = arr[i+1], arr[i]
n += 1
return arr
#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"
Aug. 1, 2015
