Enable Javascript in your browser and then refresh this page, for a much enhanced experience.
First solution in Clear category for Absolute Sorting by aieozn
import math;
def checkio(numbers_array):
a=0;
tab=[];
for z in range(len(numbers_array)):
tab.append(numbers_array[z]);
lop=0;
while(a!=1):
if lop==0:
a=1;
lop=0;
for i in range(len(tab)-1):
if tab[i]<0:
c=-tab[i];
else:
c=tab[i];
if tab[i+1]<0:
d=-tab[i+1];
else:
d=tab[i+1];
if c>d:
a=tab[i];
b=tab[i+1];
tab[i]=b;
tab[i+1]=a;
lop=lop+1;
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"
Nov. 26, 2016
