什么是近似算法？它適用于哪些問(wèn)題？這篇文章給你答案

def find_partition(numbers):    """Separate the available numbers into two eqal sum series.

    Args:        numbers: collection of numbers, for example list of integers.

    Returns:        Two lists of numbers.    """    X = []    Y = []    sum_X = 0    sum_Y = 0    for n in sorted(numbers, reverse=True):        if sum_X < sum_Y:           X.append(n)           sum_X = sum_X + n        else:           Y.append(n)           sum_Y = sum_Y + n    return (X, Y)

int karmarkarKarpPartition(int[] baseArr) {        // create max heap        PriorityQueue heap = new PriorityQueue(baseArr.length, REVERSE_INT_CMP);
    for (int value : baseArr) {                heap.add(value);        }
    while (heap.size() > 1) {        int val1 = heap.poll();            int val2 = heap.poll();            heap.add(val1 - val2);    }
    return heap.poll();}