下面是从Julia function直接翻译过来的代码，我通常使用的将Julia代码转换成Python的最快方法是：注解掉所有end，并将所有条件和循环放入:，从所有索引中减去1，最后替换等效函数。
这些是代码中的一些特殊点，注意我删除了lomed函数，并添加了sum，因为我不熟悉统计学中的低中值概念。

• 因为Python从0开始索引数组，所以你需要调整代码中的一些索引来匹配它。
• 因为Julia使用div，而Python的等价物是//，所以需要将round(N / 2)行更改为N // 2。
• 在for循环中，i从1到round((N + 1) / 2) - 1，您需要调整切片x[i - tryA + Amin - 1]中的索引，以便它们从0而不是1开始。
• 在i从round((N + 1) / 2)到N - 2的第二个for循环中，您需要调整切片x[i + tryA - Amin + 1]中的索引，以便它们从0开始，而不是从1开始。

def sn(x):
    N = len(x)

    x = sorted(x)
    a2 = [0 for _ in range(N)]
    a2[0] = x[N//2]-x[0]
    for i in range(2,(N+1)//2+1):
        nA = i-1
        nB = N-i
        diff = nB-nA
        leftA = leftB = 1
        rightA = rightB = nB
        Amin = diff//2+1
        Amax = diff//2+nA

        while leftA < rightA:
            lent = rightA-leftA+1
            even = 1 - lent%2
            half = (lent-1)//2
            tryA = leftA+half
            tryB = leftB+half
            if tryA < Amin:
                rightB = tryB
                leftA = tryA + even
            elif tryA > Amax:
                rightA = tryA
                leftB = tryB+even
            else:
                medA = x[i-1]-x[i-tryA+Amin-2]
                medB = x[tryB+i-1] - x[i-1]
                if medA >= medB:
                    rightA = tryA
                    leftB = tryB+even
                else:
                    rightB = tryB
                    leftA = tryA+even
                # end
            # end
        # end
        if leftA > Amax:
            a2[i-1] = x[leftB+i-1]-x[i-1]
        else:
            medA = x[i-1]-x[i-leftA+Amin-2]
            medB = x[leftB+i-1]-x[i-1]
            a2[i-1] = min(medA,medB)
        #end
    #end

    for i in range((N+1)//2+1, N):
        nA = N-i
        nB = i-1
        diff = nB-nA
        leftA = leftB = 1
        rightA = rightB = nB
        Amin = diff//2+1
        Amax = diff//2+nA
        while leftA < rightA:
            lent = rightA-leftA+1
            even = 1-lent%2
            half = (lent-1)//2
            tryA = leftA+half
            tryB = leftB+half
            if tryA < Amin:
                rightB = tryB
                leftA = tryA + even
            elif tryA > Amax:
                rightA = tryA
                leftB = tryB+even
            else:
                medA = x[i+tryA-Amin]-x[i-1]
                medB = x[i-1]-x[i-tryB-1]
                if medA >= medB:
                    rightA = tryA
                    leftB = tryB+even
                else:
                    rightB = tryB
                    leftA = tryA+even
                # end
            # end
        # end
        if leftA > Amax:
            a2[i-1] = x[i-1]-x[i-leftB-1]
        else:
            medA = x[i+leftA-Amin]-x[i-1]
            medB = x[i-1]-x[i-leftB-1]
            a2[i-1] = min(medA,medB)
        # end
    # end # 20

    a2[N-1] = x[N-1]-x[(N+1)//2-1]

    # Normalization
    cn = 1.0
    if N < 10:
        cn = [0, .743, 1.851, .954, 1.351, .993, 1.198, 1.005, 1.131][N-1]
    elif N%2 == 1:
        cn = N/(N-0.9)
    # end
    return cn * 1.1926 * sum(a2)