Enable Javascript in your browser and then refresh this page, for a much enhanced experience.
First solution in Uncategorized category for Absolute Sorting by quis20
def checkio(numbers_array):
sorted_numbers = list(numbers_array)
for xx in range(len(numbers_array)):
for idx,number in enumerate(numbers_array):
if idx < (len(numbers_array)-1):
if abs(sorted_numbers[idx]) > abs(sorted_numbers[idx+1]):
tmp = sorted_numbers[idx+1]
sorted_numbers[idx+1] = sorted_numbers[idx]
sorted_numbers[idx] = tmp
return sorted_numbers
#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"
Jan. 24, 2016
