Update README.md

Author: bhanutejabt

Branch and Bound/0_1 Knapsack/README.md

@@ -1,18 +1,18 @@
 # 0/1 Knapsack Problem (using BRANCH & BOUND)
 
-#Problem:
+## Problem:
 
 1. Given two integer arrays val[0..n-1] and wt[0..n-1] that represent values and weights associated with n items respectively. 
 2. Find out the maximum value subset of val[] such that sum of the weights of this subset is smaller than or equal to Knapsack capacity W. 
 3. We have ‘n’ items with value v1 , v2 . . . vn and weight of the corresponding items is w1 , w2 . . . Wn . Max capacity is W . 
 4. We can either choose or not choose an item. We have x1 , x2 . . . xn. Here xi = { 1 , 0 }. xi = 1 , item chosen xi = 0 , item not chosen.
 
-##Why Branch And Bound?
+## Why Branch And Bound?
 - Greedy approach works only for fractional knapsack problem. 
 - If weights are not integers , dynamic programming will not work.
 - There are 2n possible combinations of item , complexity for brute force goes exponentially.
 
-##Algorithm:
+## Algorithm:
 1. Sort all items in decreasing order of ratio of value per unit weight so that an upper bound can be computed using Greedy Approach.
 2. Initialize maximum profit, maxProfit = 0
 3. Create an empty queue, Q.