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 > Functions Code Examples

C program to find GCD (HCF) of two numbers using recursion

Simple Class Called Cube in C++ language - The object should calculate the 'total area' & the volume based on the side measurement. If the program supplies a side equal or lower than 0, reset the side to 1. "Create an empty"

Program Find the Average using Function - C code to find the average using function. We have created user defined function average() for the calculation of average. The numbers entered by user are passed to this c function

The C++ Language Multilevel inheritance - "Multilevel inheritance" represents a type of inheritance when a "Derived" class is a base class for another class. In c++ deriving a class from a derived class is known as 'multi-level'

Creating a Function Checks Prime Number - Function returns true if the number passed to the function is a 'prime number', returns false if the number passed is not a 'prime number'. The appropriate message is printed from the

C++ Wheel Sieve Generate Prime Number - This is a C++ Program to find 'Prime number' between the given range using 'Wheel Seive' method. "Wheel Factorization" is a graphical method for manually performing preliminary

C++ Codes String Matching in Linear Time - Create the Shift-Lookup-Table. Start with the second character, since the shift to the first is always 0. Search the "string" and return when the first occurrence is found. Searching string

Shortest Path Between two Vertices Using - This is a C++ Program to check whether path exists between two given nodes. The idea is to run the 'Depth First search' algorithm with the given source node, if during 'dfs' we visit

C++ Coding Sorts a Data using Heap Sort - Heap sort is comparison based algorithm. It's selection sort sample. The time complexity is O(n*log(n)). Build a max heap using the given data element. And then Delete the root node