Happy Codings - Programming Code Examples

C Programming Code Examples

C > Strings Code Examples

String Programming - Append string: strncat



String Programming - Append string: strncat

#include <stdio.h>
#include <string.h>

int main(void)
{
  char string1[200], string2[200];
  unsigned int len;

  gets(string1);
  gets(string2);

  len = 79 - strlen(string2);

  strncat(string2, string1, len);
  printf(string2);

  return 0;
}

C program to Calculate (1*1)+(2*2)+(3*3)
In The C, you can print any number series and I will show you how to 'print number series' in C Language with explanation. In case of print number series you need to focus on common

C Swap 2 Numbers using Bitwise Operator
Swap two number using bitwise operator in C programming. There are tons of discussions going around the internet to swap 2 numbers without using temporary variable. We can...

Sample Implements Sieve of Eratosthenes
C++ program sample to implement Sieve of Eratosthenes. Program initializes an integer array with all the "elements initialized" to 0. Then The Algorithm follows where the each

Program Find the Area of Scalene Triangle
First Input the length of a side of the triangle. Then Input the 'length of another side' of the triangle, then input the angle between these sides of the triangle. The area of the Scalene

Create Random Linear Extensions for DAG
"Linear extension" is another term for finding topological sort of a graph. A C++ program to print topological sorting of a DAG. Pointer to an array containing adjacency listsList. Graph

Assignment Operators in The C Language
C Programming to assignment operators. An Assignment Operator is used for assigning a value to a variable. C code demonstrate the working of assignment operators. The most

C Language codings Relational Operators
A relational operator checks the relationship between two operands. If the relation is true, it returns 1; if the relation is false, it returns value 0. C program to demonstrate working

Binary Search Tree by Recursive Traversals
Function to insert a node in the tree. Inorder recursive & nonrecursive traversal. 'Preorder' recursive & nonrecursive traversal. 'Postrder' recursive traversal. Postorder non recursive