Documenting algorithm/remove_if

Author: thamara

algorithm/remove_if.md

@@ -0,0 +1,25 @@
+# remove_if
+
+**Description** : Removes elementes from range `[first, last)` that satisfy a condition and returns a new past-the-end iterator for the new end of range.
+
+**Example**:
+```cpp
+    auto isOdd = [](int i) {
+        return ((i%2) == 1);
+    };
+
+    std::vector<int> v {1, 2, 3, 4, 5};
+
+    // Remove all elements that returns true for isOdd
+    auto newEndIt = std::remove_if(v.begin(), v.end(), isOdd);
+    
+    // Erase elements from [newEndIt, v.end()]
+    v.erase(newEndIt, v.end());
+
+    // v is now {2, 4}
+    for (auto value : v) { 
+        std::cout << value << " "; 
+    }
+```
+**[See Sample code](../snippets/algorithm/remove_if.cpp)**
+**[Run Code](https://rextester.com/OWAN21750)**

snippets/algorithm/remove_if.cpp

@@ -0,0 +1,30 @@
+ /*
+    Author : Thamara Andrade
+    Date : Date format 09/09/2019
+    Time : Time format 23:00
+    Description : Removes elements from vector that satisfies a criteria.
+*/
+
+#include <iostream>
+#include <vector>
+#include <algorithm>
+
+int main()
+{
+    auto isOdd = [](int i) {
+        return ((i%2) == 1);
+    };
+
+    std::vector<int> v {1, 2, 3, 4, 5};
+
+    // Remove all elements that returns true for isOdd
+    auto newEndIt = std::remove_if(v.begin(), v.end(), isOdd);
+    
+    // Erase elements from [newEndIt, v.end()]
+    v.erase(newEndIt, v.end());
+
+    // v is now {2, 4}
+    for (auto value : v) { 
+        std::cout << value << " "; 
+    }
+}