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


Php Programming Code Examples

Php > E-Mail Code Examples

Email with attachment





Print the Factorial of Number by recursion - Program takes a Positive integer & Calculates the factorial of the number. First user enter 6 then, Factorial will be equal to '1*2*3*4*5*6' 720. Learn to Find the "Factorial" of a number

Generate All Possible Subsets With Exactly - Algorithm takes the input of "n" data element and 'prints all possible' combination of length 'k'. It maintains a boolean array of length 'n'. If the corresponding boolean value is true, then

C++ Same Namespaces in Multiple Places - In C++, namespace can be defined in different parts of the program. All the objects that are in different parts of a program, but if in same namespace will form one namespace. Better

C++ Language List of Reserved Keywords - Any "Programming Language" has a "list" of keywords. C++ Keywords are list of reserved words for this Programming Language. Each keyword has a special meaning and it can not

Print some General File info in C program - Filename, device, inode, protection, number of hard links, user ID of owner, group ID of owner, device type, total size, blocksize for filesystem I/O, number of blocks allocated,

C Codes Surface Area & Volume of a Cube - The formula used to find the surface area and volume of the cube is surface_area = 6 * (a*a) and volume = a*a*a. Library Function is used in header file to compute Math Functions. We

Print Armstrong Numbers from 1 to 1000 - Program code print Armstrong Number from 1 to 1000. An Armstrong number is an n-digit base b number such that the sum of its (base b) Digits Raised to the Power n is the number

C++ Codings Sample Heap Sort Algorithm - The 'Heapsort' is a comparison-based sorting algorithm. 'Heapsort' can be thought of as an improved 'Selection Sort': like that algorithm, it divides its input into a sorted & an unsorted