Algorithms_in_C 1.0.0
Set of algorithms implemented in C.

Files  
cantor_set.c  
Program to generate Cantor ternary set  
cartesian_to_polar.c  
Function to convert a Cartesian coordinate to polar form.  
collatz.c  
Implementation of Collatz' conjecture  
euclidean_algorithm_extended.c  
Program to perform the extended Euclidean algorithm  
factorial_large_number.c  
Compute factorial of arbitrarily large numbers by storing individual digits in a byte.  
fibonacci.c  
Program to print the nth term of the Fibonacci series.  
fibonacci_fast.c  
Compute \(m^{mth}\) Fibonacci number using the formulae:  
fibonacci_formula.c  
Finding Fibonacci number of any n number using [Binet's closed form formula](https://en.wikipedia.org/wiki/Fibonacci_number#Binet's_formula) compute \(f_{nth}\) Fibonacci number using the binet's formula: Fn = 1√5 * (1+√5 / 2)^n+1 − 1√5 * (1−√5 / 2)^n+1.  
palindrome.c  
Program to identify if a number is palindrome number or not.  
prime.c  
Program to identify if a number is prime number or not.  
prime_sieve.c  
Prime Sieve algorithm implementation.  
strong_number.c  
Strong number is a number whose sum of all digits’ factorial is equal to the number n For example: 145 = 1!(1) + 4!(24) + 5!(120)  