find majority of element using hash function.cpp

/* C++ program for finding out majority
element in an array */
#include <bits/stdc++.h>
using namespace std;

void findMajority(int arr[], int size)
{
	unordered_map<int, int> m;
	for(int i = 0; i < size; i++)
		m[arr[i]]++;
	int count = 0;
	for(auto i : m)
	{
		if(i.second > size / 2)
		{
			count =1;
			cout << "Majority found :- " << i.first<<endl;
			break;
		}
	}
	if(count == 0)
		cout << "No Majority element" << endl;
}

// Driver code
int main()
{
	int arr[] = {2, 2, 2, 2, 5, 5, 2, 3, 3};
	int n = sizeof(arr) / sizeof(arr[0]);
	
	// Function calling
	findMajority(arr, n);

	return 0;
}