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

Calendar for any month any year





C Program Codes Get nth Bit of a Number - Program to input any number from user and check whether nth bit of the given number is set (1) or not (0). How to check whether nth bit of a given number is set or unset using...

Find the Odd Element given an Array with - Will hold XOR of two odd occurring elements. Xor will basically be xor of two odd occurring elements. Get one set rightmost bit in the xor2. Now divide elements in two sets. XOR

Program Sortings an Array of 10 Elements - "Heapsort" can be thought of as an improved "selection sort": like that algorithm, it divides its input into a sorted and an unsorted region, and it iteratively shrinks the unsorted region

Calculate Addition or Subtraction & Trace - Calculate the addition or subtraction & trace of 2 matrices. Here trace of the matrix is the sum of the elements on the main diagonal i.e the diagonal from the upper left to the lower

Number of days in a Month by switch case - C Program to Input month number and Print Total Number of Days in Month using switch case. Input month number from user. Store it in some variable say month. Switch the value

Calculates Area & Circumference of Circle - To calculate "area and circumference" of any circle in "C++", you have to ask to the user to enter the radius of circle, place the radius in a variable say r and make two variable, one for

C++ Check if a Point lies Inside or Outside - 'C++ Program' to Check if a Point d lies inside or outside a circle defined by Points a, b, c in a 'Plane'. For any point t (xt, yt) on the plane, its position with respect to the circle defined

Program Code Implement Pigeonhole Sort - Code implement pigeonhole sort. Pigeonhole sorting, also known as count sort, is a sorting algorithm that is suitable for 'Sorting Lists' of elements where the Number of Elements (n)