Advertisement
Not a member of Pastebin yet?
Sign Up,
it unlocks many cool features!
- #include <stdio.h>
- #include <stdlib.h>
- #include <limits.h>
- #define SIZE 5
- //algorytm posiada zlozonosc O(n^2)
- void findMinimialDifference(int tab[], int n){
- int difference =0;
- int sum1 =0, sum2 = 0;
- int i,j,k;
- int current_result = INT_MAX;
- int savedIndex =0;
- for(i=0; i<n; i++) {
- for(j=0; j<=i; j++) {
- sum1+= tab[j];
- }
- for(k=j; k<n; k++ ){
- sum2+= tab[k];
- }
- if(abs(sum1-sum2) < current_result) {
- current_result = abs(sum1-sum2);
- savedIndex= i;
- }
- sum1 =0;
- sum2 =0;
- }
- printf("\Minimalna roznica wynosi = %d\n", current_result);
- printf("Wyszukana wartosc: i= %d\n" , savedIndex);
- }
- int main()
- {
- int a[SIZE] = {1,2,3,4,5};
- findMinimialDifference(a,SIZE);
- return 0;
- }
Advertisement
Add Comment
Please, Sign In to add comment
Advertisement