LinearSearch and BinarySearch Added.

Author: mehmetpekdemir

src/com/mehmetpekdemir/Main.java

@@ -2,6 +2,8 @@
 
 import com.mehmetpekdemir.list.doublylinkedlist.EmployeeDoublyLinkedList;
 import com.mehmetpekdemir.list.singlylinkedlist.EmployeeLinkedList;
+import com.mehmetpekdemir.search.binarysearch.BinarySearch;
+import com.mehmetpekdemir.search.linearsearch.LinearSearch;
 import com.mehmetpekdemir.shared.Employee;
 import com.mehmetpekdemir.sort.BubbleSort;
 import com.mehmetpekdemir.sort.CountingSort;
@@ -146,6 +148,15 @@ public static void main(String[] args) {
 
 		System.out.println(linkedStack.peek());
 
+		System.out.println("\n---------- Linear Search ----------");
+
+		final int[] linearSearchArray = { 20, 35, -15, 7, 55, 1, -22 };
+		System.out.println(LinearSearch.search(linearSearchArray, -15));
+
+		System.out.println("\n---------- Binary Search ----------");
+
+		final int[] binarySearchArray = { -22, -15, 1, 7, 20, 35, 55 };
+		System.out.println(BinarySearch.search(binarySearchArray, -15));
 	}
 
 }

src/com/mehmetpekdemir/search/binarysearch/BinarySearch.java

@@ -0,0 +1,28 @@
+package com.mehmetpekdemir.search.binarysearch;
+
+/**
+ * 
+ * @author MEHMET PEKDEMIR
+ * @since 1.0
+ */
+public class BinarySearch {
+
+	public static int search(int[] input, int value) {
+		int start = 0;
+		int end = input.length;
+
+		while (start < end) {
+			int midpoint = (start + end) / 2;
+			if (input[midpoint] == value) {
+				return midpoint;
+			} else if (input[midpoint] < value) {
+				start = midpoint + 1;
+			} else {
+				end = midpoint;
+			}
+		}
+
+		return -1;
+	}
+
+}

src/com/mehmetpekdemir/search/linearsearch/LinearSearch.java

@@ -0,0 +1,20 @@
+package com.mehmetpekdemir.search.linearsearch;
+
+/**
+ * 
+ * @author MEHMET PEKDEMIR
+ * @since 1.0
+ */
+public class LinearSearch {
+
+	public static int search(int[] input, int value) {
+
+		for (int i = 0; i < input.length; i++) {
+			if (input[i] == value) {
+				return i;
+			}
+		}
+
+		return -1;
+	}
+}