Question: Given an array A, write some loose pseudocode to find if there is a majority element (over half of all elements in A is this

Given an array A, write some loose pseudocode to find if there is a majority element (over half of all elements in A is this element) in A. This algorithm must use o(1) extra space outside the array A (excluding memory from function calls) and run in time O(n). If you use another algorithm as a sub-process, you need only explain what you use and do not need to copy pseudocode from that algorithm
Step by Step Solution
There are 3 Steps involved in it
Get step-by-step solutions from verified subject matter experts
