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 > For Loops and While Loops Code Examples

program to find HCF (GCD) of two numbers

C++ Language & Monoalphabetic Cypher - A substitution cipher is a method of encoding by which units of 'plaintext are replaced' with ciphertext, according to a regular system; the "units" may be "single letters", pairs of letters

C program code Self-Referential structure - Buffer for ungetch, next free position in buf, word frequency count, getword: get next word or character from input, addtree: add a node with w, at or below p, a new word has

Alternate Nodes in linked list by Recursion - Print the alternate nodes in a linked list using recursion. Program, using recursion, displays the alternate nodes in a Linked List. A linked list is an "ordered set" of data elements, each

Checks Cycle in a Graph using Topological - Displaying the "Topological Sort Method" of finding whether a given graph contains cycle or not using Kosaraju's Algorithm. Enter the source and destination. Cycles exist in graph.

Code Find Sum of lower Triangular matrix - C program to read elements in a matrix and find sum of lower triangular matrix. How to find sum of lower triangular matrix in C. Find sum of lower triangular matrix, we need to

Construct a Random Graph by the Method - Generates a undirected random graph for the given number "edges and vertexes". The time complexity of this algorithm is O(v*e). Takes the input of the number of vertexes & edges

C Program Find ASCII value of a Character - ASCII value represents the english characters as numbers, each letter is assigned a number from 0 to 127. For example, the ASCII value for uppercase X is 88. This program takes the

Find Maximum Numbers of Edge Disjoint - C++ program displays the maximum number of edge disjoint paths present between two vertices. 'Maximum number' of edge disjoint paths refers to the maximum flow or shortest