Comments on: Majority Element of an Array (Moore's Algorithm)

By: Test de programare - Codility - Dominator [închise]

Test de programare - Codility - Dominator [închise] — Fri, 07 May 2021 18:15:35 +0000

[…] dominant member of array” (calcularea membrului dominant al unei matrice), a fost primul rezultat. Vedeți algoritmul descris la pagina […]

By: java – Programming Test – Codility – Dominator-ThrowExceptions – ThrowExceptions

Mon, 11 May 2020 14:26:59 +0000

[…] “computing dominant member of array”, it was the first result. See the algorithm described on page […]

By: Bijoy

Bijoy — Mon, 01 Jun 2015 15:34:03 +0000

Sorted array like int[] arr = { 1,1,2,2,2,2,3}; first solution will not work.
Both conditions will be failed if(arr[n/2] == arr[0] || arr[n/2] == arr[n-1])
But array is valid and majority element(2) exist.

By: Kamal Rawat

Kamal Rawat — Fri, 07 Sep 2012 04:32:54 +0000

In reply to antken. I think the check is fine.. Look at the definition of Majority element.. If a number appears exactly n/2 times then it is not majority.. It has to come more than n/2 times.. count becomes ==0 when we find other number equal to times this number is repeated. We should leave it there itself..

By: antken

antken — Fri, 07 Sep 2012 01:19:06 +0000

(line 16)

By: antken

antken — Fri, 07 Sep 2012 01:18:26 +0000

In the Moore’s Algorithm will work, if you’ll change from “if (count==0)” to “if (count <=0)".