# C Programming Examples on Numerical Problems & Algorithms

This section covers C Programming Examples on Numerical Problems & Algorithms. Every example program includes the description of the program, C code as well as output of the program. Here is the listing of C programming examples:

**1. C Programming examples on “Solving Linear Equations”**

**2. C Programming examples on “Bandwidth Reduction”**

C Program to Implement RCM Algorithm C Program to Optimize Wire Length in Electrical Circuit C Program to Perform Bandwidth Reduction on Graphs |

**3. C Programming examples on “Matrix Multiplication”**

**4. C Programming examples on “Determinants and Permanents”**

C Program to Check if a Matrix is Invertible C Program to Compute Determinant of a Matrix |

**5. C Programming examples on “Constrainted and UnConstrained Optimization”**

C Program to Find Minimum Value of any Algebraic Expression C Program to Find Maximum Value of any Algebraic Expression C Program to Implement Steepest Descent Method and Compute Local Optima C Program to Implement Conjugate Method and Compute Local Optima |

**6. C Programming examples on “Linear Programming”**

C Program to Find Maximum Value of an Expression and Given 3 Inequalities C Program to Optimize Solution for Employer Applicant Mark Problem Using Linear Programming |

**7. C Programming examples on “Random Number Generation”**

**8. C Programming examples on “Factoring and Primality Testing”**

**9. C Programming examples on “Arbitrary-Precision Arithmetic”**

C Program to Perform Addition Operation Using Bitwise Operators C Program to Implement Booth’s Multiplication Algorithm for Multiplication of 2 signed Numbers C Program to Implement the Schonhage-Strassen Algorithm for Multiplication of Two Numbers C Program to Perform Arithmetic Operations on Numbers of Size Greater than that of Int Without Using any Data Type of Size Greater than Int |

**10. C Programming examples on “Knapsack Problem”**

C Program to Solve the 0-1 Knapsack Problem C Program to Solve the Fractional Knapsack Problem C Program to Perform Partition of an Integer in All Possible Ways C Program to Fill Given n Numbers into a Given N Number and Ensure that Minimum is Left from N C Program to Implement the Bin Packing Algorithm C Program to Solve Knapsack Problem Using Dynamic Programming C Program to Calculate Maximum Payoff by ReOrdering Two Given Sets |

**11. C Programming examples on “Discrete Fourier Transform”**

C Program to Implement the Bin Packing Algorithm C Program to Solve Knapsack Problem Using Dynamic Programming C Program to Compute Discrete Fourier Transform Using the Fast Fourier Transform Approach C Perform to a 2D FFT Inplace Given a Complex 2D Array |

If you want to learn implementations of all algorithms and programs in C,

**Here’s the list of 1000 C Algorithms, Problems & Programming Examples.**