diff --git a/src/dynamic_programming/fractional_knapsack.rs b/src/dynamic_programming/fractional_knapsack.rs
new file mode 100644
index 00000000000..7c5c93c295b
--- /dev/null
+++ b/src/dynamic_programming/fractional_knapsack.rs
@@ -0,0 +1,98 @@
+pub fn fractional_knapsack(mut capacity: f64, weights: Vec<f64>, values: Vec<f64>) -> f64 {
+    // vector of tuple of weights and their value/weight ratio
+    let mut weights: Vec<(f64, f64)> = weights
+        .iter()
+        .zip(values.iter())
+        .map(|(&w, &v)| (w, v / w))
+        .collect();
+
+    // sort in decreasing order by value/weight ratio
+    weights.sort_unstable_by(|a, b| b.1.partial_cmp(&a.1).expect("Encountered NaN"));
+    dbg!(&weights);
+
+    // value to compute
+    let mut knapsack_value: f64 = 0.0;
+
+    // iterate through our vector.
+    for w in weights {
+        // w.0 is weight and w.1 value/weight ratio
+        if w.0 < capacity {
+            capacity -= w.0; // our sack is filling
+            knapsack_value += w.0 * w.1;
+            dbg!(&w.0, &knapsack_value);
+        } else {
+            // Multiply with capacity and not w.0
+            dbg!(&w.0, &knapsack_value);
+            knapsack_value += capacity * w.1;
+            break;
+        }
+    }
+
+    knapsack_value
+}
+
+#[cfg(test)]
+mod tests {
+    use super::*;
+
+    #[test]
+    fn test() {
+        let capacity = 50.0;
+        let values = vec![60.0, 100.0, 120.0];
+        let weights = vec![10.0, 20.0, 30.0];
+        assert_eq!(fractional_knapsack(capacity, weights, values), 240.0);
+    }
+
+    #[test]
+    fn test2() {
+        let capacity = 60.0;
+        let values = vec![280.0, 100.0, 120.0, 120.0];
+        let weights = vec![40.0, 10.0, 20.0, 24.0];
+        assert_eq!(fractional_knapsack(capacity, weights, values), 440.0);
+    }
+
+    #[test]
+    fn test3() {
+        let capacity = 50.0;
+        let values = vec![60.0, 100.0, 120.0];
+        let weights = vec![20.0, 50.0, 30.0];
+        assert_eq!(fractional_knapsack(capacity, weights, values), 180.0);
+    }
+
+    #[test]
+    fn test4() {
+        let capacity = 60.0;
+        let values = vec![30.0, 40.0, 45.0, 77.0, 90.0];
+        let weights = vec![5.0, 10.0, 15.0, 22.0, 25.0];
+        assert_eq!(fractional_knapsack(capacity, weights, values), 230.0);
+    }
+
+    #[test]
+    fn test5() {
+        let capacity = 10.0;
+        let values = vec![500.0];
+        let weights = vec![30.0];
+        assert_eq!(
+            format!("{:.2}", fractional_knapsack(capacity, weights, values)),
+            String::from("166.67")
+        );
+    }
+
+    #[test]
+    fn test6() {
+        let capacity = 36.0;
+        let values = vec![25.0, 25.0, 25.0, 6.0, 2.0];
+        let weights = vec![10.0, 10.0, 10.0, 4.0, 2.0];
+        assert_eq!(fractional_knapsack(capacity, weights, values), 83.0);
+    }
+
+    #[test]
+    #[should_panic]
+    fn test_nan() {
+        let capacity = 36.0;
+        // 2nd element is NaN
+        let values = vec![25.0, 0.0 / 0.0, 25.0, 6.0, 2.0];
+        let weights = vec![10.0, 10.0, 10.0, 4.0, 2.0];
+        assert_eq!(fractional_knapsack(capacity, weights, values), 83.0);
+    }
+}
diff --git a/src/dynamic_programming/mod.rs b/src/dynamic_programming/mod.rs
index 34717fca6af..bc88902c705 100644
--- a/src/dynamic_programming/mod.rs
+++ b/src/dynamic_programming/mod.rs
@@ -2,6 +2,7 @@ mod coin_change;
 mod edit_distance;
 mod egg_dropping;
 mod fibonacci;
+mod fractional_knapsack;
 mod is_subsequence;
 mod knapsack;
 mod longest_common_subsequence;
@@ -21,6 +22,7 @@ pub use self::fibonacci::fibonacci;
 pub use self::fibonacci::logarithmic_fibonacci;
 pub use self::fibonacci::memoized_fibonacci;
 pub use self::fibonacci::recursive_fibonacci;
+pub use self::fractional_knapsack::fractional_knapsack;
 pub use self::is_subsequence::is_subsequence;
 pub use self::knapsack::knapsack;
 pub use self::longest_common_subsequence::longest_common_subsequence;