Print the pattern by using one loop | Set 2 (Using Continue Statement) Last Updated : 16 Feb, 2023 Comments Improve Suggest changes Like Article Like Report Given a number n, print triangular pattern. We are allowed to use only one loop.Example: Input: 7 Output: * * * * * * * * * * * * * * * * * * * * * * * * * * * * We use single for-loop and in the loop we maintain two variables for line count and current star count. If current star count is less than current line count, we print a star and continue. Else we print a new line and increment line count. C++ // C++ program to print a pattern using single // loop and continue statement #include<bits/stdc++.h> using namespace std; // printPattern function to print pattern void printPattern(int n) { // Variable initialization int line_no = 1; // Line count // Loop to print desired pattern int curr_star = 0; for (int line_no = 1; line_no <= n; ) { // If current star count is less than // current line number if (curr_star < line_no) { cout << "* "; curr_star++; continue; } // Else time to print a new line if (curr_star == line_no) { cout << "\n"; line_no++; curr_star = 0; } } } // Driver code int main() { printPattern(7); return 0; } Java // Java program to print a pattern using single // loop and continue statement import java.io.*; class GFG { // printPattern function to print pattern static void printPattern(int n) { // Variable initialization // Line count int line_no = 1; // Loop to print desired pattern int curr_star = 0; for ( line_no = 1; line_no <= n;) { // If current star count is less than // current line number if (curr_star < line_no) { System.out.print ( "* "); curr_star++; continue; } // Else time to print a new line if (curr_star == line_no) { System.out.println (""); line_no++; curr_star = 0; } } } // Driver code public static void main (String[] args) { printPattern(7); } } // This code is contributed by vt_m Python 3 # Python 3 program to print # a pattern using single # loop and continue statement # printPattern function # to print pattern def printPattern(n): # Variable initialization line_no = 1 # Line count # Loop to print # desired pattern curr_star = 0 line_no = 1 while(line_no <= n ): # If current star count # is less than current # line number if (curr_star < line_no): print("* ", end = "") curr_star += 1 continue # Else time to print # a new line if (curr_star == line_no): print("") line_no += 1 curr_star = 0 # Driver code printPattern(7) # This code is contributed # by Smitha C# // C# program to print a pattern using single // loop and continue statement using System; class GFG { // printPattern function to print pattern static void printPattern(int n) { // Variable initialization // Line count int line_no = 1; // Loop to print desired pattern int curr_star = 0; for ( line_no = 1; line_no <= n;) { // If current star count is less than // current line number if (curr_star < line_no) { Console.Write ( "* "); curr_star++; continue; } // Else time to print a new line if (curr_star == line_no) { Console.WriteLine (); line_no++; curr_star = 0; } } } // Driver code public static void Main () { printPattern(7); } } // This code is contributed by vt_m PHP <?php // php program to print a // pattern using single loop // and continue statement // printPattern function // to print pattern function printPattern($n) { // Variable initialization $line_no = 1; // Line count // Loop to print desired pattern $curr_star = 0; for ($line_no = 1; $line_no <= $n;) { // If current star count is less // than current line number if ($curr_star < $line_no) { echo "* "; $curr_star++; continue; } // Else time to print // a new line if ($curr_star == $line_no) { echo "\n"; $line_no++; $curr_star = 0; } } } // Driver code $n=7; printPattern($n); // This code is contributed by mits ?> JavaScript <script> // JavaScript program to print a pattern using single // loop and continue statement // printPattern function to print pattern function printPattern(n) { // Variable initialization var line_no = 1; // Line count // Loop to print desired pattern var curr_star = 0; for (var line_no = 1; line_no <= n; ) { // If current star count is less than // current line number if (curr_star < line_no) { document.write("* "); curr_star++; continue; } // Else time to print a new line if (curr_star == line_no) { document.write("<br>"); line_no++; curr_star = 0; } } } // Driver code printPattern(7); // This code is contributed by rdtank. </script> Output: * * * * * * * * * * * * * * * * * * * * * * * * * * * * Time Complexity: O(n2)Auxiliary Space: O(1)Please refer below post for one more approach. Print pattern using only one loop Comment More infoAdvertise with us Next Article Print the pattern by using one loop | Set 2 (Using Continue Statement) A Ashish Varshney Improve Article Tags : DSA Basic Coding Problems pattern-printing Practice Tags : pattern-printing Similar Reads DSA Tutorial - Learn Data Structures and Algorithms DSA (Data Structures and Algorithms) is the study of organizing data efficiently using data structures like arrays, stacks, and trees, paired with step-by-step procedures (or algorithms) to solve problems effectively. Data structures manage how data is stored and accessed, while algorithms focus on 7 min read Quick Sort QuickSort is a sorting algorithm based on the Divide and Conquer that picks an element as a pivot and partitions the given array around the picked pivot by placing the pivot in its correct position in the sorted array. It works on the principle of divide and conquer, breaking down the problem into s 12 min read Merge Sort - Data Structure and Algorithms Tutorials Merge sort is a popular sorting algorithm known for its efficiency and stability. It follows the divide-and-conquer approach. It works by recursively dividing the input array into two halves, recursively sorting the two halves and finally merging them back together to obtain the sorted array. Merge 14 min read Bubble Sort Algorithm Bubble Sort is the simplest sorting algorithm that works by repeatedly swapping the adjacent elements if they are in the wrong order. This algorithm is not suitable for large data sets as its average and worst-case time complexity are quite high.We sort the array using multiple passes. After the fir 8 min read Data Structures Tutorial Data structures are the fundamental building blocks of computer programming. They define how data is organized, stored, and manipulated within a program. Understanding data structures is very important for developing efficient and effective algorithms. What is Data Structure?A data structure is a st 2 min read Breadth First Search or BFS for a Graph Given a undirected graph represented by an adjacency list adj, where each adj[i] represents the list of vertices connected to vertex i. Perform a Breadth First Search (BFS) traversal starting from vertex 0, visiting vertices from left to right according to the adjacency list, and return a list conta 15+ min read Binary Search Algorithm - Iterative and Recursive Implementation Binary Search Algorithm is a searching algorithm used in a sorted array by repeatedly dividing the search interval in half. The idea of binary search is to use the information that the array is sorted and reduce the time complexity to O(log N). Binary Search AlgorithmConditions to apply Binary Searc 15 min read Insertion Sort Algorithm Insertion sort is a simple sorting algorithm that works by iteratively inserting each element of an unsorted list into its correct position in a sorted portion of the list. It is like sorting playing cards in your hands. You split the cards into two groups: the sorted cards and the unsorted cards. T 9 min read Dijkstra's Algorithm to find Shortest Paths from a Source to all Given a weighted undirected graph represented as an edge list and a source vertex src, find the shortest path distances from the source vertex to all other vertices in the graph. The graph contains V vertices, numbered from 0 to V - 1.Note: The given graph does not contain any negative edge. Example 12 min read Selection Sort Selection Sort is a comparison-based sorting algorithm. It sorts an array by repeatedly selecting the smallest (or largest) element from the unsorted portion and swapping it with the first unsorted element. This process continues until the entire array is sorted.First we find the smallest element an 8 min read Like