* array - given input array subsetSum array - sum to store each subset of the array taken - ean array to check whether element is taken into sum partition or not K - number of partitions needed N - total number of element in array curIdx - current subsetSum index limitIdx - lastIdx from where array element should be taken
def isKPartitionPossibleRec ( arr , subsetSum , taken , subset , K , N , curIdx , limitIdx ) : NEW_LINE INDENT if subsetSum [ curIdx ] == subset : NEW_LINE DEDENT