Suppose BigPay eWallet is running a program to reward its customers for using the apps. The top log n customers, based on the amount of money spent for each month, where n is the total number of customers for the month will be rewarded $99 cashback. Suggest TWO (2) algorithms that can retrieve the top log n customers in:

(a) O(n log n) time

(b) O(n) time

Answer rating: 100% (QA)

A Since we have to find customers based on the amount spent for each ... View the full answer