Initial working Draft- BoyerMajorityVoting Algo

Author: ajkarri

Algos/.classpath

@@ -0,0 +1,6 @@
+<?xml version="1.0" encoding="UTF-8"?>
+<classpath>
+	<classpathentry kind="src" path="src"/>
+	<classpathentry kind="con" path="org.eclipse.jdt.launching.JRE_CONTAINER/org.eclipse.jdt.internal.debug.ui.launcher.StandardVMType/JavaSE-1.7"/>
+	<classpathentry kind="output" path="bin"/>
+</classpath>

Algos/.gitignore

@@ -0,0 +1 @@
+/bin

Algos/.project

@@ -0,0 +1,17 @@
+<?xml version="1.0" encoding="UTF-8"?>
+<projectDescription>
+	<name>Algos</name>
+	<comment></comment>
+	<projects>
+	</projects>
+	<buildSpec>
+		<buildCommand>
+			<name>org.eclipse.jdt.core.javabuilder</name>
+			<arguments>
+			</arguments>
+		</buildCommand>
+	</buildSpec>
+	<natures>
+		<nature>org.eclipse.jdt.core.javanature</nature>
+	</natures>
+</projectDescription>

Algos/.settings/org.eclipse.jdt.core.prefs

@@ -0,0 +1,11 @@
+eclipse.preferences.version=1
+org.eclipse.jdt.core.compiler.codegen.inlineJsrBytecode=enabled
+org.eclipse.jdt.core.compiler.codegen.targetPlatform=1.7
+org.eclipse.jdt.core.compiler.codegen.unusedLocal=preserve
+org.eclipse.jdt.core.compiler.compliance=1.7
+org.eclipse.jdt.core.compiler.debug.lineNumber=generate
+org.eclipse.jdt.core.compiler.debug.localVariable=generate
+org.eclipse.jdt.core.compiler.debug.sourceFile=generate
+org.eclipse.jdt.core.compiler.problem.assertIdentifier=error
+org.eclipse.jdt.core.compiler.problem.enumIdentifier=error
+org.eclipse.jdt.core.compiler.source=1.7

Algos/src/algos/BoyerMooreVoteAlgo.java

@@ -0,0 +1,49 @@
+package algos;
+
+
+/*
+ *  USAGE: find the majorty elemnt in a LIST. 
+ */
+public class BoyerMooreVoteAlgo {
+	private int [] IntergerList;
+	
+	public BoyerMooreVoteAlgo (int[] IntegerList) {
+		this.setIntergerList(IntegerList);
+	}
+	
+	/*
+	 *  We will sweep down the sequence starting with the first one
+	 *  As we sweep we maintain a pair consisting of a current candidate and a counter.
+	 *  Initially, the current candidate is unknown (first value is assigned) and counter is 0.
+	 *  When we move the pointer forward over an element e: 
+	 *     - If the counter is 0, we set the current candidate to e and we set the counter to 1.
+	 *     - if the counter is not 0, we increment or decrement the counter according to whether e is the current candiate;
+	 *  When we are done, the current candidate is the majority element, if there is a majority.
+	 */
+	public int FindMajority() {
+		int currentValue  = IntergerList[0];
+		int counter  = 0;
+		for (int i = 0; i< IntergerList.length; i++) {
+			if (currentValue == IntergerList[i]) {
+				++counter;
+			} else if (counter == 0) {
+				currentValue = IntergerList[i];
+				++ counter;
+			} else {
+				--counter;
+			}
+			System.out.println("Current max Value is " + currentValue + " value in the array is " + IntergerList[i] + " Counter = "+ counter);
+		}
+		
+		return currentValue;
+	}
+
+	public int [] getIntergerList() {
+		return IntergerList;
+	}
+
+	public void setIntergerList(int [] intergerList) {
+		IntergerList = intergerList;
+	}
+
+}

Algos/src/calls/TestAlgos.java

@@ -0,0 +1,16 @@
+package calls;
+import algos.*;
+public class TestAlgos {
+
+	public static void main(String[] args) {
+		// TODO Auto-generated method stub
+		TestBoyerMooreVoteAlgo();
+
+	}
+
+	public static void TestBoyerMooreVoteAlgo () {
+		int [] TestArray = {1,1,1,3,3,2,2,3,3,3,2,3,3};
+		BoyerMooreVoteAlgo boyer = new BoyerMooreVoteAlgo(TestArray);
+		System.out.println("max occurence elemnt in the array is " + boyer.FindMajority());
+	}
+}