For number of transactions to be n
- Creating set for transactions = O(nlogn)
- For getting valid transaction and appending it in block = O(n2)
- Overall time complexity of solution = O(n2)
- Language: C++
- Code file: main.cpp
- Output file: block.txt
- Dataset: mempool.csv
- Transaction Count :5214
- Total Fees in Current Block : 5696031
- Total Weight : 3999936
- Transactions in Final Block : 3174