Happy Codings - Programming Code Examples

C++ Programming Code Examples

C++ > Pyramid Patterns Code Examples

Print Stars Pattern - upsidedown



Print Stars Pattern - upsidedown

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

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

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

C Geopolitical Environmental Information
C Program Code Decimal point character for nonmonetary values. Thousands separator for nonmonetary values. Specifies grouping for nonmonetary values. Local currency and

Checks If the Substring is Present in String
C Program 'checks the substring' is present in a given string. Program accepts both string & substring. Then checks whether the substring is present in the string. Enter search substring

Program Print several types of Alphabets
Print phonetic alphabet. Print lower case greek alphabet. Print lower case hebrew alphabet. Print the lower case phoenician alphabet. Print lower case arab alphabet.

Sum of each Row and Columns of a matrix
C program to read elements in a matrix and find the sum of elements of each row and columns of matrix. C program to calculate sum of rows and columns of matrix. Input...

Code Finds the Median of 2 Sorted Arrays
Algorithm finds the median of 2 sorted arrays using binary search approach. Takes the input of 'n' Data Elements of both the arrays. Using decrease, conquer method find the combined

C Programming code Basic Hash example
Basic hash example. Fire up hashtable, insert data into hashtable, resolve collisions in hashtable, display hashtable, delete an entry from hashtable, hash data for hashtable...

C++ Code Solves Tower of Hanoi Problem
In The C++ program, displays the solution to the Tower of Hanoi problem using the base-2 representation of the move number with the following rules:- There is one binary digit (bit)

C++ Sorting a Given Data Using Shell Sort
Shell sort is improvement over insertion sort. It 'compares' the element separated by a gap of several positions. A data element is sorted with 'multiple' passes and with each pass gap