#include #include #include #include #include int a[] = {4108, 4340, 3399, 6931, 7654, 7868, 3505, 3655, 4459, 8246, 3251, 4920, 7270, 7368, 4007, 2401, 8878, 2015, 1151, 9211, 3917, 2486, 5661, 7860, 1274, 6970, 2249}; const int length = sizeof(a) / sizeof(int); int *pa = &a[0]; void get_smallest_difference(int*, int); int get_sum(int*, int); void display_array(int*, int); int min_diff = -1; int *pMin_diff = &min_diff; void show_result(int*, int, int*, int, int); int main() { get_smallest_difference(a, length); return 0; } void get_smallest_difference(int *array, int length) { bool in_array_1[length]; int comb = 0, i = 0, diff = 0, sum_1 = 0, sum_2 = 0; int array_1[length]; int array_2[length]; int *pArr_1 = &array_1[0]; int *pArr_2 = &array_2[0]; int index_array_1 = -1; int index_array_2 = -1; //int min_diff = -1; for(i = 0; i < length; i++) { in_array_1[i] = false; array_1[i] = 0; array_2[i] = 0; } do { in_array_1[length-1] = !in_array_1[length-1]; for(int j = 1; j < length; j++) { if(comb % (int)(pow(2, j)) == 0) in_array_1[length-j-1] = !in_array_1[length-j-1]; } index_array_1 = -1; index_array_2 = -1; for(i = 0; i < length; i++) { if(in_array_1[i]) array_1[++index_array_1] = *(array+i); else array_2[++index_array_2] = *(array+i); } if(!(index_array_1 < 0 || index_array_2 < 0)) { sum_1 = get_sum(array_1, index_array_1+1); sum_2 = get_sum(array_2, index_array_2+1); diff = sum_1 > sum_2 ? sum_1 - sum_2 : sum_2 - sum_1; if(*pMin_diff < 0 || diff < *pMin_diff) { *pMin_diff = diff; if(diff <= 1) { show_result(array_1, index_array_1+1, array_2, index_array_2+1, diff); return; } } } } while(++comb < pow(2, length)); } void show_result(int *arr_1, int len_1, int *arr_2, int len_2, int diff) { display_array(arr_1, len_1); printf("\n"); display_array(arr_2, len_2); printf("\n"); printf("(Diff: %d)\n", diff); } int get_sum(int *array, int length) { int sum = 0; for(int i=0; i

array partitioning