arpitsg / Summer_Of_Bitcoin

Method(Greedy Algorithm):

• We have to select the transactions with highest value of fee or weight.
• Then we will have to check if the current transaction is valid.
• If current transaction is valid include that transaction and erase it from transSet.
• If current transaction is not valid move to next.

Time Complexity: O(N^2), N = Total number of transactions.