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

A text effect





C Program Compare Strings Using StrCmp - C program to compare two strings using loop character by character. Logic to compare two strings. Input two strings from user and Store it in some variable say str1 and str2. Compare

Program to Delete Element from an array - Program code to delete an element from an array at specified position. How to remove an element from array at given position. Array is a linear data structure. It provides an index...

Implement The Edmonds-Karp Algorithm - The Edmonds_Karp Algorithm which is used to compute the maximum flow between the 'sink and source vertex'. It is the same as the "Ford - Fulkersson" Algorithm except that it

Finds Prime Number in C++ The Language - In C++ coding, we take a 'For Loop' which will start from 1 up to number that has entered to check whether it is Prime Number or not with in for loop we set an 'IF' condition and placed

C Swap 2 Numbers using Bitwise Operator - Swap two number using bitwise operator in C programming. There are tons of discussions going around the internet to swap 2 numbers without using temporary variable. We can...

C Language Print Natural Numbers 1 to N - C program print all natural numbers from 1 to n using loop. Input upper limit to print natural number from user. Store it in a variable say N. Run a For Loop from 1 to N with 1 increment.

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

Perform Integer Partition for Specific Case - C++ program code generates all the possible "partition" can be generated by breaking the given value. This algorithm takes the input of a "natural number" and prints all the possible