 Simple programs: quadratic equation ax^2 + bx + c = 0; fibonacci numbers
 Single root of f(x)=0: Bisectional method
 Single root of f(x)=0: False position method
 Single root of f(x)=0: Secant method
 Single root of f(x)=0: Newton method
 Multiple roots of f(x)=0: Brute force method
 Roots for a system of two nonlinear equations f(x,y)=0, g(x,y)=0: Newton method
 Interpolation: Linear interpolation
 Interpolation: Lagrange npoint interpolation (and example)
 Interpolation: Spline interpolation (and example)
 Integration of f(x) on [a,b]: Trapesoid rule
 Integration of f(x) on [a,b]: Simpson's rule
 Integration of f(x) on [a,b]: NewtonCotes rule (and example)
 Example and test output for three rules of integration (integral3.cpp)
 Integration of f(x1,x2) using NewtonCotes rule twice.
 1D integration using MonteCarlo method (code and data)
 nD integration using MonteCarlo method (code and data)
 Ordinary Differential Equations: first order ODE (Euler, modified Euler, 4th order RungeKutta)
 Ordinary Differential Equations: second order ODE (Euler, modified Euler, 4th order RungeKutta)
 Ordinary Differential Equations: system of N first order equations (4th order RungeKutta)
 Sudoku solver sudoku.cpp with input file (sudoku.dat) and a description (sudoku.txt)
