Advertisement
Not a member of Pastebin yet?
Sign Up,
it unlocks many cool features!
- #include<stdlib.h>
- #include<stdio.h>
- int n, a[100], ap[100] = { 0 };
- int divide(int li, int ls)
- {
- int mij, d1, d2;
- if (li != ls)
- {
- mij = (li + ls) / 2;
- d1 = divide(li, mij);
- d2 = divide(mij + 1, ls);
- }
- else
- return ap[a[li]]++;
- }
- int main()
- {
- int i,b;
- printf("n= ");
- scanf("%d", &n);
- for (i = 0; i < n; i++)
- scanf("%d", &a[i]);
- b = divide(0, n - 1);
- if (n % 2 == 1)
- n++;
- for (i = 0; i < 99; i++)
- {
- if (ap[i] >= n / 2)
- {
- printf("\nElementul majoritar este:\n%d\n", i);
- break;
- }
- }
- if (i == 99)
- printf("Nu exista un element majoritar\n");
- }
Advertisement
Add Comment
Please, Sign In to add comment
Advertisement