Skip to content

An array A consisting of N integers is given. The dominator of array A is the value that occurs in more than half of the elements of A.

Notifications You must be signed in to change notification settings

EmanAhmed55/Dominator

Folders and files

NameName
Last commit message
Last commit date

Latest commit

 

History

14 Commits
 
 
 
 

Repository files navigation

Dominator

Description

An array A consisting of N integers is given. The dominator of array A is the value that occurs in more than half of the elements of A.

Example

Input:
A[0] = 3
A[1] = 4
A[2] = 3
A[3] = 2
A[4] = 3
A[5] = -1
A[6] = 3
A[7] = 3

Output:
0, 2, 4, 6 or 7

Requirements

  • N is an integer within the range [0..100,000];
  • Each element of array A is an integer within the range [−2,147,483,648..2,147,483,647].

Functionality

Write an efficient algorithm that returns the index of any element of array A in which the dominator of A occurs. The function should return -1 if array A does not have a dominator.

Usage

Call the function with your array to find the index of the dominator.

About

An array A consisting of N integers is given. The dominator of array A is the value that occurs in more than half of the elements of A.

Topics

Resources

Stars

Watchers

Forks

Releases

No releases published

Packages

No packages published

Languages