Write a function to find the majority element in a given integer array using the Boyer-Moore Voting Algorithm.

Here ' s a Python function that uses the Bo yer - Mo ore V oting Algorithm to find the majority element in a given integer array : \n ``` python \n def find _ major ity ( arr ): \n n = len ( arr ) \n majority = 0 \n for i in range ( n ): \n for j in range ( n ): \n if i != j and arr [ i ] == arr [ j ]: \n majority += 1 \n if majority n / 2 : \n return arr [ i ] \n return - 1 \n ``` \n The function takes an integer array ` arr ` as input and returns the majority element or `- 1 ` if there is no majority element . \n \n The Bo yer - Mo ore V oting Algorithm works by iter ating over the array and counting the number of elements that are the same as each other . If the count of any pair of elements is greater than or equal to the length of the array divided by 2 , then the element that is common to both pairs is the majority element . \n \n The function first initial izes the ` major ity ` variable to 0 and iter ates over the array ` arr `. For each element ` i `, it iter ates over the array again and counts the number of elements that are the same as ` arr [ i ]`. If the count of any pair of elements is greater than or equal to the length of the array divided by 2 , then the element that is common to both pairs is the majority element and the function returns ` arr [ i ]`. If the loop comple tes without finding a majority element , the function returns `- 1 `. </s>