Discussion on: Daily Challenge #59 - Snail Sort

[Mat-R-Such]

Python

def remove (a):
    # remove first row 
    a = a[1:]  
    return a
def reversedMy (a):
    # reverse array 
    a= list(reversed(a))
    # reverse any row in array
    return [list(reversed(a[i])) for i in range(len(a))]
def snail (a):
    if len(a[0]) == 0:      return [[]]
    maks = len(a)*len(a[0])
    tab= []
    while len(tab) < maks:

        for i in range(len(a[0])):
            tab.append(a[0][i])

        a = remove(a)
        m = len(a)

        for i in range(0,m):
            tab.append(a[i][m])
            a[i].pop(m)

        a = reversedMy(a)

    return tab