Happy Codings - Programming Code Examples

C++ Programming Code Examples

C++ > Pyramid Patterns Code Examples

Print Stars Pattern



Print Stars Pattern

         *
       * * *
     * * * * *
   * * * * * * *
 * * * * * * * * *

#include<iostream.h>
#include<conio.h>

void main()
{
int i,j,k;
clrscr();
for(i=1; i<=5; i++)
{
for(j=4; j>=i; j--)
{
cout<<" ";
}
for(k=1; k<=(2*i-1); k++)
{
cout<<"*";
}
cout<<"\n";
}
getch();
}

Using Insertion Sort Technique in The C++
To sort an array using insertion sort, enter the array size and then array elements in random order. Start Sorting the Elements of the array in Ascending Order using insertion sort as like

C Increment every Element of the Array by
C Program increments every element of the array by one & print array. We need to add 1 to all the elemnts of the given array. After adding 1 to all the elements of an array print

C Programming Codes Displaying a Table
C Language code how to display a table in C programming language is more or less similar to that of counting. We use only one iteration and increment it with value of which table is

C++ Codes Generate Armstrong Numbers
To generate 'Armstrong numbers' in C++, you have to ask to the user to enter the interval to print the Armstrong number between a given interval as shown here in the following codes.

C Program code to Subtract two matrices
C language read elements in two matrices and find the difference of two matrices. Subtract two matrices in C. Elements of two matrices can only be subtracted if and only...

Multiline Comments in C++ programming
To write a "Multiline Comment" you have to write "/*" at the start of the Comment. After this you can write as many number of lines of description. When you are done with writing

C Finds All Roots of A Quadratic Equation
Step by step descriptive logic to find roots of Quadratic Equation using Switch Case. Input coefficients of quadratic equation. Store it in some variable say a, b, c. Find discriminant of

C++ Program Merge Sort using Linked list
Split the Data into two equal half until we get at most one element in both half. Merge Both into one making sure the resulting 'Sequence' is sorted. Then 'recursively' split them, merge