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

Display the IP address using WMI

C Program Find Square Root of a Number - C input a number and find square root of the given number. How to find square root of a number in C programming using inbuilt sqrt() function. Using predefined sqrt() function to

C++ Coding Sorts a Data using Heap Sort - Heap sort is comparison based algorithm. It's selection sort sample. The time complexity is O(n*log(n)). Build a max heap using the given data element. And then Delete the root node

C++ Uses Naor Reingold Pseudo Function - A C++ Program to genrate random numbers using Naor-Reingold random function. Moni Naor and Omer Reingold described efficient constructions for cryptographic primitives in

Generate Random Partition out of a Given - Program 'takes the input' of a set of integers or characters. It firstly generates the random partition of the "Length of the Set". Starting from the beginning, it 'prints the number' of

C Program Reverse String Without Library - Lets find the length of the string using library function strlen(). A "string" is charracter array and a "Character Array" have character range between 0 to length-1. Thus we have position

C Program to Find Sum of Array Elements - Read elements in an array and find the sum of all elements of the array. C code find sum of elements of the array. Add elements of an array using for loop in C programming. Logic

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

C++ Programming Simple Stack Program - A "stack" is a basic data structure and can be defined in an abstract, implementation-free manner, or it can be generally "defined" as a linear list of items in which all additions and