Question
Time remaining: 01:53:16 Computer Science Part 2: Given an array A of n integers, a leader element of the array A is the element that
Time remaining:
01:53:16
Computer Science
Part 2:
Given an array A of n integers, a leader element of the array A is the element that appears
more than half of the time in A.
Using one stack, implement in Java an O(n) running time complexity method
static int leader(int[] A)
to find a leader element and return the index (any) of the leader in A. The program must
returns -1 if no leader element exists.
Examples:
int[] a = {23, 23, 67, 23, 67, 23, 45}; ====> leader(a) = 5
int[] a = {23, 24, 67, 23, 67, 23, 45}; ====> leader(a) = -1
Important Notes:
You must add the main method in your program in order to test your implementation.
There are no data errors that need to be checked as all the data will be assumed
correct.
You can use the array of the previous example to test your program, however, I
suggest that you also use other input arrays to validate the correctness and efficiency
of your solution.
Your program MUST be submitted only in source code form (.java file).
A program that does not compile or does not run loses all correctness points.
Step by Step Solution
There are 3 Steps involved in it
Step: 1
Get Instant Access to Expert-Tailored Solutions
See step-by-step solutions with expert insights and AI powered tools for academic success
Step: 2
Step: 3
Ace Your Homework with AI
Get the answers you need in no time with our AI-driven, step-by-step assistance
Get Started