From 20374a138ce1f865f158763a8a83fc95a705270f Mon Sep 17 00:00:00 2001
From: Ayushi Bisht <94152085+AyuBisht@users.noreply.github.com>
Date: Wed, 12 Jan 2022 11:26:20 +0530
Subject: [PATCH] fixed indentation
---
Code/C++/n_queen_problem.cpp | 132 +++++++++++++++++------------------
1 file changed, 66 insertions(+), 66 deletions(-)
diff --git a/Code/C++/n_queen_problem.cpp b/Code/C++/n_queen_problem.cpp
index a3d9f0c07..be065a0b3 100644
--- a/Code/C++/n_queen_problem.cpp
+++ b/Code/C++/n_queen_problem.cpp
@@ -118,96 +118,96 @@ int main(){
return 0;
}
/*
-TEST CASE 1:
-INPUT: 4
-OUTPUT:
+ TEST CASE 1:
+ INPUT: 4
+ OUTPUT:
-* Q * *
-* * * Q
-Q * * *
-* * Q *
+ * Q * *
+ * * * Q
+ Q * * *
+ * * Q *
-* * Q *
-Q * * *
-* * * Q
-* Q * *
+ * * Q *
+ Q * * *
+ * * * Q
+ * Q * *
-TEST CASE 2:
-INPUT: 5
-OUTPUT:
+ TEST CASE 2:
+ INPUT: 5
+ OUTPUT:
-Q * * * *
-* * Q * *
-* * * * Q
-* Q * * *
-* * * Q *
+ Q * * * *
+ * * Q * *
+ * * * * Q
+ * Q * * *
+ * * * Q *
-Q * * * *
-* * * Q *
-* Q * * *
-* * * * Q
-* * Q * *
+ Q * * * *
+ * * * Q *
+ * Q * * *
+ * * * * Q
+ * * Q * *
-* Q * * *
-* * * Q *
-Q * * * *
-* * Q * *
-* * * * Q
+ * Q * * *
+ * * * Q *
+ Q * * * *
+ * * Q * *
+ * * * * Q
-* Q * * *
-* * * * Q
-* * Q * *
-Q * * * *
-* * * Q *
+ * Q * * *
+ * * * * Q
+ * * Q * *
+ Q * * * *
+ * * * Q *
-* * Q * *
-Q * * * *
-* * * Q *
-* Q * * *
-* * * * Q
+ * * Q * *
+ Q * * * *
+ * * * Q *
+ * Q * * *
+ * * * * Q
-* * Q * *
-* * * * Q
-* Q * * *
-* * * Q *
-Q * * * *
+ * * Q * *
+ * * * * Q
+ * Q * * *
+ * * * Q *
+ Q * * * *
-* * * Q *
-Q * * * *
-* * Q * *
-* * * * Q
-* Q * * *
+ * * * Q *
+ Q * * * *
+ * * Q * *
+ * * * * Q
+ * Q * * *
-* * * Q *
-* Q * * *
-* * * * Q
-* * Q * *
-Q * * * *
+ * * * Q *
+ * Q * * *
+ * * * * Q
+ * * Q * *
+ Q * * * *
-* * * * Q
-* Q * * *
-* * * Q *
-Q * * * *
-* * Q * *
+ * * * * Q
+ * Q * * *
+ * * * Q *
+ Q * * * *
+ * * Q * *
-* * * * Q
-* * Q * *
-Q * * * *
-* * * Q *
-* Q * * *
+ * * * * Q
+ * * Q * *
+ Q * * * *
+ * * * Q *
+ * Q * * *
-TIME COMPLEXITY: O(N!) (N is the user input, that is the number of queens to be placed on a N X N chessboard)
-SPACE COMPLEXITY: O(N^2)
+ TIME COMPLEXITY: O(N!) (N is the user input, that is the number of queens to be placed on a N X N chessboard)
+ SPACE COMPLEXITY: O(N^2)
*/