Happy Codings - Programming Code Examples

C++ Programming Code Examples

C++ > Pyramid Patterns Code Examples

Print Dimond of Star



Print Dimond of Star

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

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

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

Implementations for AA-Tree in The C++
Internal method to insert into a subtree. x is the item to insert. t is the node that roots the tree. Set the "New Root". Internal method to remove from subtree. x: the item to remove.

Check a Number can be Expressed as Sum
Program to check whether a number can be expressed as sum of two prime numbers. To accomplish this task, "checkPrime()" function is created. The "checkPrime()" returns 1 if the

Program Print Fibonacci Series in a Range
Fibonacci series is a series of numbers where the current number is the sum of previous 2 terms. For Example: 0, 1, 1, 2, 3, 5, 8, 13, 21,... Here c is the current term, b is the n-1th term

C Program Codings Concatenate 2 Strings
Program to Concatenate two strings in single string. Concatenation of two strings is simple copying a string to another. To concatenate 2 strings str1 & str2, you will copy all characters

C Convert Binary to Hexadecimal Number
C Program to input binary number from user and convert to hexadecimal number system. Binary Number System is a base 2 number system. Binary number system use only two

Read and write Strings Printf() and Scanf()
Compare 2 strings, 'Concatenate Strings' and copy one string to another & perform various 'string manipulation operations'. We perform such operations using 'pre-defined' functions

Program Implement the Vizing's Theorem
The chromatic index of the simple graph can be either 'maxDegree' or maxDegree+1. The chromatic index is the maximum number of color needed for the 'edge coloring' of graph.

C++ Performing Edge Coloring of a Graph
In graph theory, an "edge coloring" of a graph is an assignment of colors to the edges of the graph so that no two adjacent edges have the same color. Any "2 edges" connected to same