Enable Javascript in your browser and then refresh this page, for a much enhanced experience.
Absolute sorting (krotka) solution in Clear category for Absolute Sorting by Poetakodu
def min(tab):
i = (tab[0])
for a in range(1,len(tab)):
if abs(tab[a]) < abs(i):
i = tab[a]
return i
def krotka(tuple):
wynik = []
for i in range(len(tuple)):
wynik.append(tuple[i])
return wynik
def checkio(arr):
wynik = []
lista = krotka(arr)
for i in range(len(lista)):
najmniejsza = min(lista)
wynik.append(najmniejsza)
lista.remove(najmniejsza)
print(wynik)
return wynik
#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"
Oct. 23, 2016
