Happy Codings - Programming Code Examples

Php Programming Code Examples

Php > Graphics Code Examples

Access Distinct RGB Values



Access Distinct RGB Values

<?php 
$im = ImageCreateFromPng("rockym.png"); 
$rgb = ImageColorAt($im, 100, 100); 
$r = ($rgb >> 16) & 0xFF; 
$g = ($rgb >> 8) & 0xFF; 
$b = $rgb & 0xFF; 
?>

C Implement Binary Tree using Linked List
Program implements binary tree using linked list. Binary Search tree is binary tree in which each Internal Node x stores an element such that the element stored in the left subtree of

Read integers into an array and Reversing
We have declared one pointer variable and one array. Address of first element of array is stored inside pointer variable. Accept Size of an Array. Now we have accepted element...

Converts Decimal Number to Octal in C++
In the program, the decimal number is stored in the variable decimalNumber and passed to function decimalToOctal(). Function converts the 'decimal number' passed to its equivalent

Simple Multi Level Inheritance in the C++
In C++ language, Multilevel Inheritance The class A serves as a base class for the derived class B, which in turn serves as a 'base class' for the derived class C. The class B is known

C++ Direct Recursion vs Indirect recursion
Direct Recursion: When function calls itself, it is called "Direct recursion". Indirect recursion: When function calls "another function" & that function calls the calling function, then this is

C Check if the Matrix is an Identity Matrix
C code checks a given Matrix is an Identity Matrix. Identity matrix is a square matrix with 1's along the diagonal from upper left to lower right and 0's in all other positions. If it

C++ Program Find Quotient & Remainder
In program, user enter 2 integers (divisor and dividend), computes quotient and remainder. To compute 'quotient and remainder', divisor and dividend should be integers. The division

C++ Program to Implement Pairing Heap
In this, Insert item x into the 'priority queue', maintaining heap order. Return a pointer to the node containing the new item. Find the 'smallest' item in the priority queue. Return