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

Convert a Number Decimal System to Binary System using Recursion

Check Whether Number is Strong Number - How to check Strong Numbers using loop in C. What is Strong number? Strong number is a special number whose sum of factorial of digits is equal to the original number. 145 is

C++ Computes Discrete Fourier Transform - This is a C++ Program to perform Fast Fourier Transform. A 'Fast Fourier transform' (FFT) is an algorithm to compute the discrete Fourier transform (DFT) & its inverse. Fourier analysis

Find the Number of Permutations of given - Prints a total number of permutation possible for a given string. The time complexity of this algorithm is "O(n)". Algorithm takes the input of the string. Then it checks for the repetition

Program Finds Prime Factors of a Number - Factors of a number that are prime numbers are called as "Prime Factors" of that number. For example: 2 and 5 are the prime factors of 10. Logic to check prime factors of a number.

C Check Whether a number is Even or Odd - C Program code to Check Whether a number is even or odd using if else. A number exactly divisible by 2 leaving no remainder, is known as even number. Any number modulo divided

File Encryption and Decryption C program - Do not give the have the same sourcefile and destinationfile, encrypting or decrypting, bug will be worked out as I get more interested in file encryption. Decrypt the file with the same

C Programming Codes to Quick Sort Array - Programming code load some random values into the array. Print the original array. Print the 'quicksorted' array. Sort everything in between 'low' 'high'. Compare value and find

C++ Generating All Subsets of a Given Set - Program print all the possible combination of each length from the given array in gray code order. The 'time complexity' of this algorithm is 'O(n*(2^n))'. This algorithm takes the input