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 > Site Navigation Code Examples

Page Scroller ver 3





Counts Numbers of Vowels & Consonants - C program to Count total number of Vowel or Consonant in a string using switch case. Input String from user, store it in some variable say 'str'. Initialize 2 other variables to store vowel

Program to Implement the RSA Algorithm - Encodes any message using 'RSA Algorithm'. Input is 'Case Sensitive' and works only for all characters. RSA is one of the first practicable 'public-key' cryptosystems and is widely used

C Programming Bubble sort [Linked List] - If the list is empty, create first node. Go to last node. Add node at the end. Preform a bubble sort on the linked list. The 'c' node precedes the 'a' and 'e' node pointing up...

Swapping numbers Function Call by Value - Before we discuss function call by value, lets understand the terminologies that we'll use while explaining this: Actual parameters: The parameters that appear in function calls and

Count the Occurrence of each C Keywords - C Program 'counts the occurrences' of each C keyword by array structure. "C keywords" are the words which have a definition and cannot be used as an identifier. Continue, double, for

Finds Factorial of a Number use Recursion - Program Find the Factorial of a number using 'recursion'. C Program prints the factorial of a number using recursion. 'Factorial' is product of all the number from 1 to the user specified

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.

Generate Random Subset by Coin Flipping - Prints a 'subset' of the given array using coin flipping method. The time complexity of this algorithm is O(n). Takes the input of 'n' data element and prints a possible subset. that, it