Unit 1 & 2 Methods

Some of the algorithms explored:

• Given a, b, c for the quadratic y = ax² + bx + c,
  find the number of solutions and the turning point. 

• Root finding algorithms (also see the spreadsheet below)

  • Linear search

  • Bisection method

  • Fixed point iterations

  • Method of False Position

  • Newton-Raphson Method (multiple versions)

  • Secant Method

• Rational Root Theorem

• Polynomial long division

• Instantaneous <-> Average Rate of Change

• Forwards, Central, Backwards Differences

• Derivatives of Polynomials

• Search for Turning Points

  • Linear Search, Bisection Method

  • Gradient Descent

• Generating Random Numbers (LCGs) and Dice Rolls

• Simulating Probabilities

• Generating Sample Spaces

• Approximating Circular Functions (maybe can be extended with rational approximations and Bhāskara's approx)