Algorithms_in_C 1.0.0
Set of algorithms implemented in C.
|
Files | |
file | cantor_set.c |
Program to generate Cantor ternary set | |
file | cartesian_to_polar.c |
Function to convert a Cartesian co-ordinate to polar form. | |
file | collatz.c |
Implementation of Collatz' conjecture | |
file | factorial_large_number.c |
Compute factorial of arbitrarily large numbers by storing individual digits in a byte. | |
file | fibonacci_fast.c |
Compute \(m^{mth}\) Fibonacci number using the formulae: | |
file | 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. | |
file | palindrome.c |
Program to identify if a number is palindrome number or not. | |
file | poly_add.c |
Implementation of [Addition of two polynomials] (https://en.wikipedia.org/wiki/Polynomial#Addition) | |
file | postfix_evaluation.c |
Postfix evaluation algorithm implementation | |
file | prime.c |
Program to identify if a number is prime number or not. | |
file | prime_seive.c |
Prime Seive algorithm implementation. | |
file | rot13.c |
ROT13 is a simple letter substitution cipher that replaces a letter with the 13th letter after it in the alphabet. | |
file | run_length_encoding.c |
Encode a null terminated string using Run-length encoding | |
file | 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) | |
file | sudoku_solver.c |
Sudoku Solver using recursive implementation of brute-force algorithm. | |
file | union_find.c |
Union find algorithm. | |