From 6d3882df727d800e4fad65675a41b9fc0ac890d1 Mon Sep 17 00:00:00 2001
From: Aayush Vyas <70998175+AayushVyasKIIT@users.noreply.github.com>
Date: Thu, 2 Sep 2021 21:34:11 +0530
Subject: [PATCH] std::cout after assert

---
 data_structures/dsu_path_compression.cpp | 4 ++--
 data_structures/dsu_union_rank.cpp       | 4 ++--
 2 files changed, 4 insertions(+), 4 deletions(-)

diff --git a/data_structures/dsu_path_compression.cpp b/data_structures/dsu_path_compression.cpp
index dc6b7a94a..7ec9851ae 100644
--- a/data_structures/dsu_path_compression.cpp
+++ b/data_structures/dsu_path_compression.cpp
@@ -172,13 +172,13 @@ static void test1() {
     uint64_t n = 10;///< number of items
     dsu d(n+1);///< object of class disjoint sets
     //set 1
-    cout << "Test case# 1: passed"<<endl;
     d.UnionSet(1,2); //performs union operation on 1 and 2
     d.UnionSet(1,4); //performs union operation on 1 and 4
     vector<uint64_t> ans = {1,4,3};
     for(uint64_t i=0;i<ans.size();i++){
         assert(d.get(4).at(i) == ans[i]); //makes sure algorithm works fine
     }
+    cout << "Test case# 1: passed"<<endl;
 }
 /**
  * @brief Self-implementation Test case #2
@@ -189,7 +189,6 @@ static void test2() {
     uint64_t n = 10;///< number of items
     dsu d(n+1);///< object of class disjoint sets
     //set 1
-    cout << "Test case# 2: passed"<<endl;
     d.UnionSet(3,5);
     d.UnionSet(5,6);
     d.UnionSet(5,7);
@@ -197,6 +196,7 @@ static void test2() {
     for(uint64_t i=0;i<ans.size();i++){
         assert(d.get(3).at(i) == ans[i]); //makes sure algorithm works fine
     }
+    cout << "Test case# 2: passed"<<endl;
 }
 
 
diff --git a/data_structures/dsu_union_rank.cpp b/data_structures/dsu_union_rank.cpp
index 2c2668df5..006a99646 100644
--- a/data_structures/dsu_union_rank.cpp
+++ b/data_structures/dsu_union_rank.cpp
@@ -129,7 +129,6 @@ class dsu{
  */
 static void test1() {
     /* checks the parents in the resultant structures */
-    cout << "Test case# 1: passed"<<endl;
     uint64_t n = 10; ///<number of elements
     dsu d(n+1); ///< object of class disjoint sets
     d.unionSet(2,1); //performs union operation on 1 and 2
@@ -145,6 +144,7 @@ static void test1() {
     for(uint64_t i=0;i<ans.size();i++){
         assert(d.getParents(7).at(i) == ans[i]); //makes sure algorithm works fine
     }
+    cout << "Test case# 1: passed"<<endl;
 }
 /**
  * @brief Self-implementation Test case #2
@@ -152,7 +152,6 @@ static void test1() {
  */
 static void test2() {
     /* checks the parents in the resultant structures */
-    cout << "Test case# 2: passed"<<endl;
     uint64_t n = 10; ///<number of elements
     dsu d(n+1); ///< object of class disjoint sets
     d.unionSet(2,1); //performs union operation on 1 and 2
@@ -169,6 +168,7 @@ static void test2() {
     for(uint64_t i=0;i<ans.size();i++){
         assert(d.getParents(2).at(i) == ans[i]); //makes sure algorithm works fine
     }
+    cout << "Test case# 2: passed"<<endl;
 }
 /**
  * @brief Main function