Partition

Algorithm/Sort/Partition.hpp

@@ -0,0 +1,33 @@
+#ifndef __CYTL__PARTITION__
+#define __CYTL__PARTITION__
+
+#include "Comparable.hpp"
+#include <iterator>
+
+namespace CYTL
+{
+    template<class T>
+    void swap(T& t1, T& t2)
+    {
+        T tmp(t1);
+        t1 = t2;
+        t2 = tmp;
+    }
+
+    template<class Iterator, class Pred>
+    void partition(Iterator begin, Iterator end, Pred pred)
+    {
+        if(begin >= end) return;
+
+        Iterator lo = begin, hi = end-1;
+
+        while(lo < hi)
+        {
+            if( pred(*lo) ) lo++;
+            else swap(*lo, *(hi--));
+        }
+    }
+
+}
+
+#endif // __CYTL__PARTITION__

Algorithm/Sort/PartitionTest.cpp

@@ -0,0 +1,34 @@
+#include "Partition.hpp"
+#include <assert.h>
+#include <vector>
+#include <iostream>
+
+bool isOdd(int x)
+{ return x % 2; }
+
+bool lessThan5(int x)
+{ return x < 5; }
+
+int main()
+{
+    std::vector<int> vec{1,2,3,4,5,6,7,8};
+
+    CYTL::partition(vec.begin(), vec.end(), isOdd);
+    assert(vec == (std::vector<int>{1,7,3,5,6,4,8,2}));
+
+    vec = {8,7,6,5,4,3,2,1};
+    CYTL::partition(vec.begin(), vec.end(), lessThan5);
+    assert(vec == (std::vector<int>{1,2,3,4,5,6,7,8}));
+
+    return 0;
+}
+
+
+
+
+
+
+
+
+
+