majority element (divide and conquer)

#include <cstdio>
using namespace std;
int error=1000000000;

int (int *a,int b,int e)
{
    int mid =(b+e)/2;
    if(b>=e)
        return a[b];

```
int n1= getMajorityElement(a,b,mid);
int n2= getMajorityElement(a,mid+1,e);
if(n1 == error && n2 == error) return error;
if(n1 == error) return n2;
if(n2 == error) return n1;

if(n1 == n2)
    return n1;
else
    return error;
```

}

int main()
{
    int n;
    scanf("%d",&n);
    int *a = new int [n];
    for( int i =0; i< n; i++)
        scanf("%d",&a[i]);
    int num = getMajorityElement(a,0,n-1);
    printf("%dn",num);

```
return 0;
```

}