Happy Codings - Programming Code Examples

C Programming Code Examples

C > Strings Code Examples

C Program to Find the Length of a String

C Program to Find the Length of a String

Calculate Length of String without Using strlen() Function

You can use standard library function strlen() to find the length of a string but, this program computes the length of a string manually without using strlen() funtion.

#include <stdio.h>
int main()
{
    char s[888], j;

    printf("Enter a string: ");
    scanf("%s", s);

    for(j = 0; s[j] != '\0'; ++j);

    printf("Length of string: %d", j);
    return 0;
}

Simple Multi Level Inheritance in the C++ - In C++ language, Multilevel Inheritance The class A serves as a base class for the derived class B, which in turn serves as a 'base class' for the derived class C. The class B is known

Program to Check if a Binary Tree is a BST - Returns true if the given tree is a BST and its values are >= min & <= max. Allocates a new node with the data and "NULL" left and right pointers. The Given Binary Tree is a "BST" or

C Language Finding the Sum of G.P Series - C Language program is used to Find the Sum of the geometric progression series. Here G.P stands for geometric progression. Geometric progression, or GP, is a sequence where each

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...

Print Combination of 2 Words of 2 Strings - Print combination of two words of two given strings without any repetition. Incrementing the count if the characters of the main string match with the characters of the given word.

Program to Check Whether Graph is DAG - This is a C++ Program code to check whether graph is DAG. In mathematics and computer science, a directed acyclic graph, is a directed graph with no directed cycles. It is formed by

Demonstrates Printf Inside Another Printf - Firstly Inner printf is executed which results in printing 1324. Printf returns 'Total Number' of Digits:4 & second inner printf will looks like. It prints 4 & Returns the Total Number of digits

Implement Extended Eucledian Algorithm - Program demonstrates the implementation of "Extended Eucledian" Algorithm. For the 'Modular Multiplicative Inverse' to exist, the number & modular must be coprime. Return