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 > Date Time Code Examples

Translate date in french

Coding find Maximum Minimum Element - Code to enter elements in an array from user and find maximum and minimum elements in array. C program to find biggest and smallest elements in an array. Input element in array...

Perform Preorder Non-Recursive Traversal - C++ Program to "Print Preorder Traversal" of a given binray tree without using recursion. A binary tree node has data, left child and right child. "Helper Function" that allocates a new

C Display the Characters in Prime Position - Take a string as input and store it in the array str[]. "Store the Length" of the input string in the variable 'k'. Use "two Loops" to divide the numbers "upto the value" of k. Increment the

Code Passing Array to Function using Call - When we pass the address of an array while calling a function then this is called function call by reference. When we pass an address as an argument, the function declaration...

Create Random Linear Extensions for DAG - "Linear extension" is another term for finding topological sort of a graph. A C++ program to print topological sorting of a DAG. Pointer to an array containing adjacency listsList. Graph

C++ Codes Linear Congruential Generator - C++ Program to "generate random numbers" using Linear Congruential Generator. A linear congruential generator (LCG) is an algorithm that yields a sequence of pseudo-randomized

Programs to Traverse the Tree Recursively - C Coding, using recursion, performs traversal operation across the nodes in a tree. The tree we have used is the "Binary Search Tree". The user "Generates a Tree" by inserting integers.

Identify Whether the String is Palindrome - Take a string as input and store it in the array s[]. Load each character of the array s[] into the array stack[]. Use variables front and top to represent the last and top element of the