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





C++ Sample Code Implement Bubble Sort - Bubble sort algorithm sort data by comparing 2 consecutive numbers. The time Complexity of this algorithm is O(n^2). And compare two consecutive number. Switch values if number

C++ Find Closest Pair of Points in an Array - Sort array of points according to X coordinate and Y coordinate. Find the distance between two points. And return the 'smallest distance' between 2 points. Find the 'distance' beween

Find Armstrong Numbers between 1 to N - The Armstrong Number is a n-digit number that is equal to the sum of nth power of its digits. 407 = 4^3 + 0^3 + 7^3 = 407 is. Input upper limit to print Armstrong number from

Implementation for Top-Down Splay Tree - Finding the smallest item in the tree. Not the most efficient implementation ('two passes'), but has correct "amortized behavior". A good alternative is to first call Find with parameter

This is a Tictactoe Game in C++ Language - It isn't too smart to prevent you from winning but it is worth playing it. "opening headerfile" iostream for in-out. Opening headerfile conio for clrscr(); Opening headerfile stdlib for. And

C Check a Number is Divisible by 5 and 13 - Check whether a number is divisible by 5 and 13 or not using if else. A number is divisible by some other number if it gives 0 as remainder. To check if a number is exactly divisible by a...

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

Program to Generate All Pairs of Subsets - The "time complexity" of this algorithm is O (n*2^n). This algorithm takes the input of 'n' data element and prints unique subset pairs whose union gives the set. It generates 0 to