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 > File Operations Code Examples

A Quicksort for files





Display all the Nodes in a Linked list using - C program display all the nodes in a linked list 'using recursion'. This program uses recursive function and displays a 'Linked List'. A Linked List is an ordered set of 'data elements', each

Perimeter of a Circle Rectangle & Triangle - This C Program calculates the perimeter of a circle, rectangle and triangle. This program is used to find the perimeter of circle, rectangle and triangle. Perimeter of rectangle: 2 *(x+y)

C++ Sample Calculate Power of a Number - Program takes two numbers (a 'base number' and an 'exponent') and Calculates the Power. The technique works only if the exponent is a positive integer. If you need to find the power

Finding ASCII Value of a Character in C++ - A character variable holds "ASCII value" (an "integer number" between 0 and 127) rather than that character itself in C programming. That value is known as ASCII value. Example

C Programming Sample Reading the Files - To read the file in C Language, we must open it first using any of the mode, for example if you only want to read the file then open it in "r" mode. Based on the mode selected during

C Program Code Calculate Simple Interest - C code example to input principle amount in some variable say principle and input time in some variable say time. Input rate in some variable say rate. Find simple interest using

C++ Generate N Number of Passwords of - C++ Program to generate N passwords each of 'length M'. Problem focuses on finding the N permutations each of length M. Generates random number between 1 and 10. Enter the

C++ Implementations Binary Search Tree - Insert x into the tree; duplicates are ignored. Remove x from the tree. Nothing is done if x is not found. Find the "smallest item" in the tree. Find the "largest item" in the tree. Find