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

C++ Programming Code Examples

C++ > Conversions Code Examples

C++ Program to Convert Binary Number to Decimal and vice-versa

Program to Solve The Fractional Knapsack - Given a 'set of items', each with a mass and a value, determine the number of each item to include in a collection so that the total weight is less than or equal to given limit & the total

C program Copies one String into another - Demonstrate multiple loop control variables. This is a testing of converge. Copies one string into another. It copies characters to both the ends, converging at the middle...

Maximum Minimum Elements in the Array - How to find maximum and minimum element in an array using recursion in C programming. Recursion works on the concept of divide and conquer. We break the problem in its smallest

C Codes Pointer to Pointer Double Pointer - In C, A "Pointer" holds the Address of another variable of same type. When a Pointer Holds the address of another pointer then such type of pointer is known as "pointer-to-pointer" or

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

Code convert numbers to roman numerals - Take a decimal number as input. Check if the number is greater than 1000 or 900 or 500 or 400 or 100 or 90 or 50 or 40 or 10 or 9 or 5 or 4 or 1. If it is, then store its equivalent roman...

C++ Check whether Graph is Biconnected - A recursive function that returns true if there is an articulation point in a graph, otherwise returns false. If graph is Biconnected returns true, otherwise returns false. If this Graph is

Directed Graphs Contains a Eulerian Cycle - If graph has no odd degree vertex, there is at least one Eulerian Circuit. And if graph as two vertices with odd degree, there is no Eulerian Circuit but at least one Eulerian Path. If graph