Aman Mehara
  • Home
  • About
0/1 Knapsack Problem
dynamic programming

0/1 Knapsack Problem

  • Aman Mehara

    Aman Mehara

    Read more posts by this author.

    Aman Mehara

Aman Mehara

17 Mar 2018 •

More in dynamic programming

  • Partition Problem

    17 Mar 2018 – 1 min read

  • Subset Sum Problem

    17 Mar 2018 – 1 min read

  • The Coin Change Problem

    11 Mar 2018 – 1 min read

See all 3 posts →
dynamic programming

Subset Sum Problem

A special case of 0/1 Knapsack Problem Given a finite set \(S = \{ s \in \mathbb{Z}_+\}\) and an integer \(t < 0 \), is there a subset
  • Aman Mehara
    Aman Mehara
Aman Mehara 17 Mar 2018 • 1 min read
mathematics

Quadratic Equations

When \(a \ne 0\) , there are two solutions to \(ax^2 + bx + c = 0\) and they are $$x = {-b \pm \sqrt{b^2-4ac} \over 2a}.$$ Discriminant: \(D = b^2-4ac\) If \(\alpha\) and \(\beta\) are the roots of quadratic equation (\(ax^2 + bx + c = 0\
  • Aman Mehara
    Aman Mehara
Aman Mehara 15 Mar 2018 • 1 min read
Aman Mehara © 2021
Latest Posts Facebook Twitter Ghost