Summer of BitCoin Name : TRIJAL BHARDWAJ
IMPLEMENTATION & LOGIC : Using Greedy Approach STEPS - 1. Sorted mempool.csv Data in a fee/weight Ratio.(Reference - Fractional KanpSack Probelm LeetCode : https://leetcode.com/problems/maximum-units-on-a-truck/discuss/1206555/java-greedy-fractional-knapsack)
2. If the parent was already present in the block, then the Transaction was included, else, continued maintaining.
NOTE : The transactions MUST appear in order (NO transaction should appear before one of its parents)
3. Time Complexity of this Approach - O(n^2)