[cpp][11_sorts] bubble_down_sort, done.

c-cpp/11_sorts/sorts.hpp

@@ -59,4 +59,16 @@ void selection_sort(BidirIt first,
     }
 }
 
+template <typename BidirIt,
+          typename BinaryPred = std::less<typename std::iterator_traits<BidirIt>::value_type>>
+void bubble_down_sort(BidirIt first, BidirIt last, BinaryPred comp = BinaryPred()) {
+    if (std::distance(first, last) <= 1) { return; }
+    for (auto it = first; it != last; ++it) {
+        for (auto itt = it + 1; itt != last; ++itt) {
+            if (comp(*itt, *it)) {
+                std::swap(*it, *itt);
+            }
+        }
+    }
+}
 #endif  // SORTS_SORTS_HPP_

c-cpp/11_sorts/sorts_test.cc

@@ -14,18 +14,25 @@ int main() {
     std::cout << '\n';
 
     std::vector<int> b(test_data.begin(), test_data.end());
-    bubble_sort(b.begin(), b.end());
+    insertion_sort(b.begin(), b.end());
     for (auto i : b) {
         std::cout << i << ' ';
     }
     std::cout << '\n';
 
     std::vector<int> c(test_data.begin(), test_data.end());
-    bubble_sort(c.begin(), c.end());
+    selection_sort(c.begin(), c.end());
     for (auto i : c) {
         std::cout << i << ' ';
     }
     std::cout << '\n';
 
+    std::vector<int> d(test_data.begin(), test_data.end());
+    bubble_down_sort(d.begin(), d.end());
+    for (auto i : d) {
+        std::cout << i << ' ';
+    }
+    std::cout << '\n';
+
     return 0;
 }