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


Visual Basic Programming Code Examples

Visual Basic > Graphics Games Programming Code Examples

Getting the Colour Depth





C Programming Codes Displaying a Table - C Language code how to display a table in C programming language is more or less similar to that of counting. We use only one iteration and increment it with value of which table is

C++ Pointers to Pointer or Double Pointer - Dereference operator or indirection operator, noted by asterisk, is also a "unary operator" in C++ languages that uses for pointer variables. 'Double Pointer' or Pointer to Pointer need to

Check a Number can be Expressed as Sum - Program to check whether a number can be expressed as sum of two prime numbers. To accomplish this task, "checkPrime()" function is created. The "checkPrime()" returns 1 if the

Program Code Calculates the Value of nPr - C Program code calculates the value of nPr. A permutation is a re-arrangement of elements of a set. And any duplications of the collected elements in different orders is allowed. Then

C++ Find kth Largest Element in Sequence - A Function to build max heap from the initial array by checking all non-leaf node to satisfy the condition. And build "max-heap" k times, extract the 'maximum' and store it in the end

Calculating Difference Between two Time - Ask to enter two time periods and these two periods are stored in structure variables t1 t2 respectively. The computeTimeDifference() Function calculates the Difference Between

Code print the address of array elements - For loop to print value and address of each element of array. Just to demonstrate that the array elements are stored in contiguous locations, I am displaying the addresses in...

Find ith Largest Number from a Given List - It is an improvement in BST by adding 2 more key functions - 'rank()' and 'select()'. The time complexity of Order-Statistic tree generation is O(n+n*log(n)). Once the tree is constructed