diff -r 28e26cad1a6da73b5e6a5c030a65ee5bb77aed0d -r 8b7c98b7acaac42034eff0ebee63d7b143841e26 cpp/algorithms/algorithms.vcxproj
--- a/cpp/algorithms/algorithms.vcxproj	Sat Feb 16 22:33:58 2013 -0600
+++ b/cpp/algorithms/algorithms.vcxproj	Sun Feb 17 18:50:14 2013 -0600
@@ -15,9 +15,11 @@
   </ItemGroup>
   <ItemGroup>
     <ClInclude Include="src\Algorithm.h" />
+    <ClInclude Include="src\BinarySearch.h" />
     <ClInclude Include="src\HeapSort.h" />
     <ClInclude Include="src\InsertSort.h" />
     <ClInclude Include="src\MedianSort.h" />
+    <ClInclude Include="src\MergeSort.h" />
     <ClInclude Include="src\QuickSort.h" />
     <ClInclude Include="src\SearchAlgorithm.h" />
     <ClInclude Include="src\SortAlgorithm.h" />
diff -r 28e26cad1a6da73b5e6a5c030a65ee5bb77aed0d -r 8b7c98b7acaac42034eff0ebee63d7b143841e26 cpp/algorithms/algorithms.vcxproj.filters
--- a/cpp/algorithms/algorithms.vcxproj.filters	Sat Feb 16 22:33:58 2013 -0600
+++ b/cpp/algorithms/algorithms.vcxproj.filters	Sun Feb 17 18:50:14 2013 -0600
@@ -44,5 +44,11 @@
     <ClInclude Include="src\HeapSort.h">
       <Filter>Header Files</Filter>
     </ClInclude>
+    <ClInclude Include="src\MergeSort.h">
+      <Filter>Header Files</Filter>
+    </ClInclude>
+    <ClInclude Include="src\BinarySearch.h">
+      <Filter>Header Files</Filter>
+    </ClInclude>
   </ItemGroup>
 </Project>
\ No newline at end of file
diff -r 28e26cad1a6da73b5e6a5c030a65ee5bb77aed0d -r 8b7c98b7acaac42034eff0ebee63d7b143841e26 cpp/algorithms/src/Algorithm.h
--- a/cpp/algorithms/src/Algorithm.h	Sat Feb 16 22:33:58 2013 -0600
+++ b/cpp/algorithms/src/Algorithm.h	Sun Feb 17 18:50:14 2013 -0600
@@ -28,6 +28,11 @@
 		ss << "] ";
 		return ss.str();
 	}
+
+	std::vector<T> getContainer()
+	{
+		return this->_container;
+	}
 };
 
 #endif
\ No newline at end of file
diff -r 28e26cad1a6da73b5e6a5c030a65ee5bb77aed0d -r 8b7c98b7acaac42034eff0ebee63d7b143841e26 cpp/algorithms/src/BinarySearch.h
--- /dev/null	Thu Jan 01 00:00:00 1970 +0000
+++ b/cpp/algorithms/src/BinarySearch.h	Sun Feb 17 18:50:14 2013 -0600
@@ -0,0 +1,29 @@
+#ifndef BINARYSEARCH_H
+#define BINARYSEARCH_H
+
+#include "SearchAlgorithm.h"
+
+template <class T>
+class BinarySearch : public SearchAlgorithm<T>
+{
+public:
+	virtual int Search(T item)
+	{
+		int low = 0;
+		int high = this->_container.size() - 1;
+		int idx;
+		while (low <= high)
+		{
+			idx = ( low + high ) / 2;
+			if ( item == this->_container.at(idx) )
+				return idx;
+			else if ( item < this->_container.at(idx) )
+				high = idx - 1;
+			else
+				low = idx + 1;
+		}
+		return -1;
+	}
+};
+
+#endif
\ No newline at end of file
diff -r 28e26cad1a6da73b5e6a5c030a65ee5bb77aed0d -r 8b7c98b7acaac42034eff0ebee63d7b143841e26 cpp/algorithms/src/MergeSort.h
--- /dev/null	Thu Jan 01 00:00:00 1970 +0000
+++ b/cpp/algorithms/src/MergeSort.h	Sun Feb 17 18:50:14 2013 -0600
@@ -0,0 +1,61 @@
+#ifndef MERGESORT_H
+#define MERGESORT_H
+
+#include "SortAlgorithm.h"
+#include <vector>
+
+template <class T>
+class MergeSort : public SortAlgorithm<T>
+{
+public:
+	
+	virtual void Sort()
+	{
+		this->_container = mergesort(this->_container);
+	}
+
+	std::vector<T> mergesort(std::vector<T> arr)
+	{
+		if (arr.size() <= 1)
+			return arr;
+		size_t middle = arr.size() / 2;
+		std::vector<T> left(arr.begin(), arr.begin() + middle);
+		std::vector<T> right(arr.begin() + middle, arr.end());
+
+		left = mergesort(left);
+		right = mergesort(right);
+		
+		return merge(left, right);
+	}
+
+	std::vector<T> merge(std::vector<T> left, std::vector<T> right)
+	{
+		std::vector<T> res;
+
+		while (left.size() > 0 || right.size() > 0)
+		{
+			if (left.size() > 0 && right.size() > 0)
+			{
+				if (left.at(0) <= right.at(0))
+				{
+					res.push_back(left.at(0));
+					left.erase(left.begin());
+				} else {
+					res.push_back(right.at(0));
+					right.erase(right.begin());
+				}
+			} else if (left.size() > 0) {
+				res.push_back(left.at(0));
+				left.erase(left.begin());
+			} else if (right.size() > 0) {
+				res.push_back(right.at(0));
+				right.erase(right.begin());
+			}
+
+		}
+
+		return res;
+	}
+};
+
+#endif
\ No newline at end of file
diff -r 28e26cad1a6da73b5e6a5c030a65ee5bb77aed0d -r 8b7c98b7acaac42034eff0ebee63d7b143841e26 cpp/algorithms/src/SearchAlgorithm.h
--- a/cpp/algorithms/src/SearchAlgorithm.h	Sat Feb 16 22:33:58 2013 -0600
+++ b/cpp/algorithms/src/SearchAlgorithm.h	Sun Feb 17 18:50:14 2013 -0600
@@ -3,11 +3,12 @@
 
 #include "Algorithm.h"
 
-class SearchAlgorithm
+template <class T>
+class SearchAlgorithm : public Algorithm<T>
 {
 public:
 	//void f() { this->
-	virtual void Search() = 0;
+	virtual int Search(T item) = 0;
 };
 
 #endif
\ No newline at end of file
diff -r 28e26cad1a6da73b5e6a5c030a65ee5bb77aed0d -r 8b7c98b7acaac42034eff0ebee63d7b143841e26 cpp/algorithms/src/main.cpp
--- a/cpp/algorithms/src/main.cpp	Sat Feb 16 22:33:58 2013 -0600
+++ b/cpp/algorithms/src/main.cpp	Sun Feb 17 18:50:14 2013 -0600
@@ -7,16 +7,21 @@
 #include "InsertSort.h"
 #include "MedianSort.h"
 #include "QuickSort.h"
+#include "MergeSort.h"
+#include "BinarySearch.h"
 
 using namespace std;
 
 int main()
 {
-	QuickSort<int> sort1;
+	MergeSort<int> sort1;
 	//sort1.initContainer(create_vector<string>("test")("test2"));
 	//cout << sort1.ToString();
 	//vector<int> arr1 = create_vector<int>(
-	sort1.initContainer(create_vector<int>(3)(2)(3)(1));
+	sort1.initContainer(create_vector<int>(3)(2)(4)(3)(1));
 	sort1.Sort();
 	cout << sort1.ToString() << endl;
+	BinarySearch<int> search1;
+	search1.initContainer(sort1.getContainer());
+	cout << search1.Search(7) << endl;
 }	
\ No newline at end of file