Happy Codings - Programming Code Examples
Html Css Web Design Sample Codes CPlusPlus Programming Sample Codes JavaScript Programming Sample Codes C Programming Sample Codes CSharp Programming Sample Codes Java Programming Sample Codes Php Programming Sample Codes Visual Basic Programming Sample Codes

C Programming Code Examples

C > Strings Code Examples

program to count occurrences of a word in a string

Finds Prime Number in C++ The Language - In C++ coding, we take a 'For Loop' which will start from 1 up to number that has entered to check whether it is Prime Number or not with in for loop we set an 'IF' condition and placed

C Code Check Palindrome Using Recursion - In this article we have shared two C programs to check if the input number is palindrome or not. 1) using while loop 2) using recursion. If a number 'remains same', even if we reverse its

Find Armstrong number in C++ Language - In math, A number in which the sum of cube of its individual digits is equal to the number itself is called Armstrong number. 1^3 + 5^3 + 3^3 = 153. To make logic firstly concept about

C++ Language Implements Binomial Heap - Linking nodes in binomial heap. Create nodes in binomial heap and Insert nodes in binomial heap. Union nodes in "Binomial Heap". Merge nodes in binomial heap. And display binomial

Implementing Circular Doubly Linked List - 'Memory allocated' for node dynamically and inserts element at beginning. Inserts elemnet at last. Inserts element at position and delete node at particular position. Update value of a

C++ Programs Use Above Below Primitive - Program to check whether two lines intersect to each other. The above-below primitive can be used to test whether a line intersects a line segment. It does iff one endpoint of segment

C Convert Binary to Octal Number System - In C program user is asked to enter the binary number and the program then converts that binary number to the octal number by calling a user defined function. To understand this...

Codes Prints Strong Numbers from 1 to n - Program print Strong numbers between 1 to n. Strong number is a special number whose sum of factorial of digits is equal to original number. For example: 145 is strong number.