对逗号分隔的数字字符串进行排序

def sort_numbers(string):
    # 将逗号分隔的数字字符串转换为数字数组
    numbers = [int(num) for num in string.split(',')]

    # 使用快速排序算法对数字数组进行排序
    quicksort(numbers, 0, len(numbers) - 1)

    # 将排序后的数字数组转换回逗号分隔的数字字符串
    sorted_string = ','.join(str(num) for num in numbers)

    return sorted_string

def quicksort(arr, low, high):
    if low < high:
        pivot_index = partition(arr, low, high)
        quicksort(arr, low, pivot_index - 1)
        quicksort(arr, pivot_index + 1, high)

def partition(arr, low, high):
    pivot = arr[high]
    i = low - 1

    for j in range(low, high):
        if arr[j] < pivot:
            i += 1
            arr[i], arr[j] = arr[j], arr[i]

    arr[i + 1], arr[high] = arr[high], arr[i + 1]
    return i + 1

# 示例用法
string = "9,5,2,7,1,8"
sorted_string = sort_numbers(string)
print(sorted_string)  # 输出: "1,2,5,7,8,9"

def main_handler(event, context):
    string = event['string']
    sorted_string = sort_numbers(string)
    return sorted_string

def sort_numbers(string):
    # 将逗号分隔的数字字符串转换为数字数组
    numbers = [int(num) for num in string.split(',')]

    # 使用快速排序算法对数字数组进行排序
    quicksort(numbers, 0, len(numbers) - 1)

    # 将排序后的数字数组转换回逗号分隔的数字字符串
    sorted_string = ','.join(str(num) for num in numbers)

    return sorted_string

def quicksort(arr, low, high):
    if low < high:
        pivot_index = partition(arr, low, high)
        quicksort(arr, low, pivot_index - 1)
        quicksort(arr, pivot_index + 1, high)

def partition(arr, low, high):
    pivot = arr[high]
    i = low - 1

    for j in range(low, high):
        if arr[j] < pivot:
            i += 1
            arr[i], arr[j] = arr[j], arr[i]

    arr[i + 1], arr[high] = arr[high], arr[i + 1]
    return i + 1