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 find last occurrence of a character in a string





Making Your Functions to be Inline in C++ - An inline function is a function in which body is inserted in the "place of its call". There are two ways to make your functions to be inline. The first one consists in 'simple definition' of

C Implement Binary Tree using Linked List - Program implements binary tree using linked list. Binary Search tree is binary tree in which each Internal Node x stores an element such that the element stored in the left subtree of

Code Perform Binary Search use Recursion - C program, 'using recursion', performs binary search. In this c program, an array of random number is generated. User is asked to enter a key. The array of random numbers are sorted

Find the Frequency of Substring in Strings - Take a string and a substring as input. Store it in the arrays 'str[] & str1[]' respectively. Using For Loop to 'compare' str1[] with the str[]. Do step2 until the end of main string. During the

Program Print Fibonacci Series in a Range - Fibonacci series is a series of numbers where the current number is the sum of previous 2 terms. For Example: 0, 1, 1, 2, 3, 5, 8, 13, 21,... Here c is the current term, b is the n-1th term

C++ Using The If Else Ladder Else If Clause - The "expressions" are evaluated in order; if an expressionis true, the 'statement' or 'block of statement' associated with it is executed, and this terminates the whole chain. The Code for

Code Finds product of Digits of a Number - C program code input a number and calculate product of its digits. I have divided the logic to calculate product of digits in three steps. Extract last digit of the number. Multiply the

Program Find the Number of Occurrences - 'Binary Search tree' for a given unsorted data array & maintain an additional count variable. If any 'Element is Repeated' then increase the count of that 'Node'. Proceed with the search