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 > Linked Lists Code Examples

C Program to Print Nth Node from the last of a Linked List

Checks a Character is Capital Letter or Not - Takes input a Character and Check it whether a 'character' is capital letter, small letter, Digit or Special character. 'All characters' like small or capital letters, digits and special characters

Program Finds the Longest Path in a DAG - Program to find longest path in DAG. Given a weighted directed acyclic graph and a source vertex s in it, find the longest distances from s to all other vertices in the given graph. Create

Find the Number of Integers Divisible by 5 - C Program to which calculates the number of integers divisible by 5 in the given range. This C program takes the range as input and finds the number of integers divisible by 5 in range.

C Example Code Nested Printf Statements - C Program code to demonstrate nested printf statements. String will be first printed while executing inner printf. Length of the string "abcdefghijklmnopqrstuvwxyz". So printf will

Find Fibonacci Series Understanding Logic - The Fibonacci series is infinite but we can not make a C++ program that display an "infinite" output. In program, we take input the "range" in integer upto which Fibonacci series will be

A Calculator by Switch Case and Functions - Create menu driven Calculator that performs basic mathematic operations (Add, Subtract, Multiply, Divide) use switch case & functions. The calculator should input two numbers and

Implements Max-Flow Min-Cut Theorem - Program demonstrates implementation of max-flow_min-cut_theorem. So returns true if there is a 'path from source' 's' to sink 't' in residual graph. Also fills parent[] to store the

C++ Sample Code Implement Bucket Sort - Divide the range into equal parts and assign a 'bucket' to each part. Split the data and insert them into the Corresponding bucket by using insertion sort. 'Merge' all the buckets into one