majority element

[suhas-kadu]

Problem statement: Given an array of n elements check whether it has a majority element or not

Three approaches are discussed in the solution viz.

1. Brute Force O(n*n)
2. Sorting O(n*logn)
3. Boyer-Moore Vote algorithm O(n)