We use cookies to ensure you have the best browsing experience on our website. Please read our cookie policy for more information about how we use cookies.
  1. Prepare
  2. Algorithms
  3. Sorting
  4. Big Sorting
  5. Discussions

Big Sorting

  • medyk_pawel
     + 1 comment

    Python3, tried this way

    from functools import cmp_to_key

def compare_big(num1, num2):
    if len(num1) > len(num2):
        return 1
    elif len(num1) < len(num2):
        return -1
    else:
        for d1, d2 in zip(num1, num2):
            if d1 > d2:
                return 1
            elif d1 < d2:
                return -1
        return 0

def bigSorting(unsorted):
    return sorted(unsorted, key=cmp_to_key(compare_big))
    # Write your code herefrom functools import cmp_to_key

def compare_big(num1, num2):
    if len(num1) > len(num2):
        return 1
    elif len(num1) < len(num2):
        return -1
    else:
        for d1, d2 in zip(num1, num2):
            if d1 > d2:
                return 1
            elif d1 < d2:
                return -1
        return 0

def bigSorting(unsorted):
    return sorted(unsorted, key=cmp_to_key(compare_big))
    # Write your code here

    B