diff --git a/search/src/main/java/org/hft/dsa/BinarySearch.java b/search/src/main/java/org/hft/dsa/BinarySearch.java
index a0d7d9513e89bec827bd19962ca2cdc027104866..811973c0c6d74046041398b13c10e961e185f6fb 100644
--- a/search/src/main/java/org/hft/dsa/BinarySearch.java
+++ b/search/src/main/java/org/hft/dsa/BinarySearch.java
@@ -29,7 +29,7 @@ public class BinarySearch  implements Search{
 			return Optional.empty();} // nichts gefunden
 			int mitte = (links + rechts)/2;
 			if(s[mitte].equals(key) ) {
-			return Optional(mitte);} // gefunden
+			return (mitte);} // gefunden
 			if(s[mitte].getKey().compareTo(key) > 0) {
 			return suche(s, key, links, mitte - 1);	
 			}
diff --git a/search/src/main/java/org/hft/dsa/Main.java b/search/src/main/java/org/hft/dsa/Main.java
new file mode 100644
index 0000000000000000000000000000000000000000..ddff2c37e3ce500f0e9694e35a6350348fa40223
--- /dev/null
+++ b/search/src/main/java/org/hft/dsa/Main.java
@@ -0,0 +1,18 @@
+package org.hft.dsa;
+
+import model.Person;
+import model.Reader;
+
+public class Main {
+
+	public static void main(String[] args) {
+		Person[] personSortiert = Reader.getSortedSample();
+		Person[] personUnsortiert = Reader.getRawSample();
+		
+		for (Person person : personUnsortiert) {
+			System.out.println(person);
+		}
+
+	}
+
+}