solve 11_PatternChallenge

Author: kotAPI

Pattern Algorithms/10_PatternChallenge.cpp

@@ -63,7 +63,6 @@ void printPattern_10(int input){
 // Newline to print when inner loops are done executing
 cout<<endl;
 }
-// Jump to newline when the inner loops have finished executing.
 
 }
 }

Pattern Algorithms/11_PatternChallenge.cpp

@@ -0,0 +1,90 @@
+
+/*******************************************************************************************************
+/* ___ _ _ _ _ 
+/* / _ \ | | (_)| | | | 
+/* / /_\ \__ __ ___ | | __ _ ___ _ __ _ | |_ | |__ _ __ ___ ___ 
+/* | _ |\ \ /\ / / / _ \| | / _` | / _ \ | '__|| || __|| '_ \ | '_ ` _ \ / __| 
+/* | | | | \ V V / | __/| || (_| || (_) || | | || |_ | | | || | | | | |\__ \ 
+/* \_| |_/ \_/\_/ \___||_| \__, | \___/ |_| |_| \__||_| |_||_| |_| |_||___/ 
+/* __/ |
+/* |___/ 
+/******************************************************************************************************/
+
+/***********************************
+/* 11_PatternChallenge
+/***********************************/
+
+// Library imports
+#include <iostream>
+using namespace std;
+
+//Prototypes for the algorithms
+void printPattern_11(int);
+
+int main(){
+// user input
+int userInput;
+
+cout<<"Enter number of lines."<<endl;
+cin>>userInput;
+
+printPattern_11(userInput);
+return 0;
+}
+
+/**********************************************************
+/* <printPattern_11>
+/*
+/* @description : Prints a pyramid pattern in increasing and then in a decreasing way after reaching the mid point.
+/* @param : Integer<input>
+/* @return : None, void
+/* @complexity : O(n)
+/* @explanation : Algorithm that iterates the first half of the pyramid with whitespaces upto 'mid' times, and the
+/* lower half of the pyramid is decremented again after middle(mid). First, we keep a track of the
+/* middle of the pyramid. we increment the numbers with every iteration and decrease the whitespaces.
+/* once the outer loop reaches mid, we use an if statement to check if 'i' is greater than mid. if yes,
+/* we increment the whitespaces and decrement the digits with every iteration, same as above but opposite. 
+/* @author : Pranay Kothapalli @kotAPI
+/**********************************************************/
+void printPattern_11(int input){
+// Outer loop loops input number of times
+int mid;
+// Check if the user input is even or odd, choose a valid mid point depending on the input
+if(input%2==0){
+// Mid/2 if the input is even. (if input is 8, mid is 4, 8/2 = 4).
+mid = input/2; 
+}
+else{
+// Mid/2+1 if the input is odd. (if input is 9, mid is 5, 9/2+1 = 5).
+mid = input/2 +1;
+}
+
+for(int i=1;i<input;i++){
+// if i hasn't reached the mid point of the pyramid
+// execute this block
+if(i<=mid){
+// decrementing white spaces on iteration depending on mid-i
+for(int j=mid-i;j>0;j--){
+cout<<" ";
+}
+// incrementing digits with every iteration depending on i
+for(int k=1;k<=i;k++){
+cout<<k;
+}
+}
+// if i is greater than mid.
+// execute this code block
+else{
+// Incrementing white spaces with every iteration depending on i-mid
+for(int j=1;j<=i-mid;j++){
+cout<<" ";
+}
+// decrementing the digits with every iteration depending on input-i. forming a reverse pyramid.
+for(int k=1;k<=input-i;k++){
+cout<<k;
+}
+}
+// Add a newline once the inner loops have finished executing.
+cout<<endl;
+}
+}

Pattern Algorithms/README.md

@@ -128,20 +128,8 @@
  1 2
  1
 
-### 12_PatternChallenge
-
-
- 1
- 1 2 1
- 1 2 3 2 1
- 1 2 3 4 3 2 1
- 1 2 3 4 5 4 3 2 1
- 1 2 3 4 5 6 5 4 3 2 1
- 1 2 3 4 5 6 7 6 5 4 3 2 1
- 1 2 3 4 5 6 7 8 7 6 5 4 3 2 1
-1 2 3 4 5 6 7 8 9 8 7 6 5 4 3 2 1
 
-### 13_PatternChallenge
+### 12_PatternChallenge
 
 
  1
@@ -163,7 +151,7 @@
  1 2
  1
 
-### 14_PatternChallenge
+### 13_PatternChallenge
 
 
 
@@ -186,7 +174,7 @@
  1 2 1
  1
 
-### 15_PatternChallenge
+### 14_PatternChallenge
 
 1 2 3 4 5 5 4 3 2 1
 1 2 3 4 4 3 2 1
@@ -200,7 +188,7 @@
 1 2 3 4 5 5 4 3 2 1
 
 
-### 16_PatternChallenge
+### 15_PatternChallenge
 
 p
 pr
@@ -216,7 +204,7 @@
 pr
 p
 
-### 17_PatternChallenge
+### 16_PatternChallenge
 (Chessboard with varying width and height)
 
 # # # #
@@ -229,7 +217,7 @@
  # # # #
 
 
-### 18_PatternChallenge
+### 17_PatternChallenge
 
  * * * * * * * * * *
  *
@@ -253,4 +241,59 @@
  *
  * * * * * * * * * *
 
-
+TODO :
+
+11111
+12221
+12321
+12221
+11111
+
+1
+A B
+2 3 4
+C D E F
+5 6 7 8 9
+
+ *******
+ *** ***
+ ** **
+ * *
+ ** **
+ *** ***
+ *******
+
+  *
+  * *
+  * * *
+  * * * *
+  * * *
+  * *
+  * 
+
+* * * * * * * * * * * * * * * * *
+ * * * * * * * * * * * * * *
+ * * * * * * * * * *
+  * * * * * *
+  * * * * * * * * *
+  * * * * * * *
+  * * * * *
+  * * *
+  *
+
+  *
+ * * *
+ * * * * *
+* * * * * * *
+*  *
+* * * *
+* * * * * *
+* * * * * * *
+* * * * * *
+* * * *
+*  *
+* * * * * * *
+ * * * * *
+ * * *
+  *
+