Happy Codings - Programming Code Examples

C++ Programming Code Examples

C++ > For Loops and While Loops Code Examples

Initializing each element separately in the loop:



Initializing each element separately in the loop:

int newArray[5];
int n = 0;

// Initializing elements of array seperately
for(n=0;n<sizeof(newArray);n++)
{
  newArray[n] = n; 
}

C program to Getting the Time as a String
Returns the time as a string in 12 or 24 hour format. Stores the time as a string. Getting time value. Getting time and date structure. Save the hour value. Adjust if 12 hour format.

C++ Program Three Dimensional 3D Array
3D array contains three for loops. to initialize and "print three dimensional" array, you have to use three for loops. Third for loop forms 1D array, Second for loop forms 2D array and the

C Language Code find First and Last Digit
C Language program code to find first & last digit. Input a number from user & store it in some variable say num. Find last digit using modulo division by 10 lastDigit = num % 10.

Checks Character is Uppercase Lowercase
C program code to input character from user and check whether character is Uppercase or Lowercase alphabet using If Else Statement. Input a character from user. Store it in some

Snake Game graphic code in a C program
C programming language Snake game. Use arrow keys to direct the snake. Avoid the head of snake not to hit any part of snake. Pick beats untill you win the game. Press

C Language Code Convert Binary to Octal
Program takes a binary number as input and converts to octal. Take a binary number as input. Divide the binary number into groups of 3 bits. For each group of 3 bits, multiply...

C Returns a Pointer to the first occurrence
C programming code sample about returns a pointer to the first occurrence of str2 in str1 or a null pointer if there str2 is not part of str1. It returns a null pointer if no match is...

Directed Graphs Contains a Eulerian Cycle
If graph has no odd degree vertex, there is at least one Eulerian Circuit. And if graph as two vertices with odd degree, there is no Eulerian Circuit but at least one Eulerian Path. If graph