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

Convert Hex string to Long

Generate All Possible Subsets With Exactly - Algorithm takes the input of "n" data element and 'prints all possible' combination of length 'k'. It maintains a boolean array of length 'n'. If the corresponding boolean value is true, then

Every Possible Combination of two Strings - Program display 'every possible combination' of two words from the given 2 string without displaying "repeated combinations". Convert string in 2D array. Make the first string words

C Programs Binary Octal Hex Conversions - C programming code example for Number Conversions: Binary to decimal, decimal to binary, decimal to octal, decimal to hex, octal to decimal, octal to binary, binary to octal,

Undirected Graph is Connected Using DFS - A "Recursive Function" to print 'DFS' starting from v. Returns reverse ('or transpose') of this graph. Add edge to connect v and w. Check if Graph is Connected and display 'The Graph is

Performs Edge Coloring to the Line Graph - Takes the input of the number of 'vertexes' & the number of edges in the graph. It takes the input of vertex pairs for the given number of edges. It generates a line graph for the given

How to using Switch in a C program code - C programming using switch: The number chosen. Get the choice input. Pick a number between 1 and 20. Check for invalid selection. Selects invalid choice message. Jumps to the

C++ Program Code Implement Radix Sort - In this algorithm Sorting of Data is done from least significant digit to most significant digit. Here we need 10 different spaces labeled 0 to 9. Assume we have "n" Number of inputs. Let

Code Generates All Possible Combinations - Algorithm print all the 'possible combination' of each length from the given array. The time complexity of this algorithm is 'O(n*(2^n))'. A function to print all 'Combination of a Length'