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 > Data Structures Code Examples

Program for Circular Queue implementation through Array





Convert Binary Code of a Number into its - C program to using recursion, evaluates the gray code equivalent of a binary number. A gray is also represented using 0s and 1s. The speciality of gray code is that only one bit is

C Program to Find Sum of Array Elements - Find Sum of Array elements Using Recursive function in C language. Function declaration to find sum of array. Input size and elements in array. Recursively find the sum of elements

Undirected Graph contains a Eulerian Path - Check if this graph is Eulerian or not. Check if all non-zero degree vertices are connected. If graph has no "odd degree vertex", there is at least one Eulerian Circuit. And if graph as two

C Programming to Multiply Two Matrices - C Code to Multiply Two Matrices. How many rows in the first matrix? How many cols in the first matrix? How many rows in the second matrix? How many cols in the second matrix?

C Codes Displays Largest Element of Array - This C Program takes n number of elements from user and stores it in array arr[]. To find the largest element, the first two elements of array are checked and largest of these two...

Implement Doubly Linked list using Singly - Program implements doubly linked list using singly Linked List. It makes use of 2 pointers, one points at the current node, other points at the head and when user requests to move

Perform to a 2D FFT Inplace a Complex 2D - A fast Fourier transform (FFT) is an algorithm to computing the discrete 'Fourier transform' and its inverse. Fourier analysis converts time (or space) to frequency and vice versa; an FFT

C Program Filter text with a stop word list - Read stoplist into binary tree, expects one entry per line. Split string into tokens, return token array. Make sure, copy string to a safe place. Always keep last entry null terminated.