Question: 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
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
Step by Step Solution
3.59 Rating (167 Votes )
There are 3 Steps involved in it
To solve this problem we need to suggest two algorithms that can efficiently find the top log n customers based on their spending Lets go over the two ... View full answer
Get step-by-step solutions from verified subject matter experts
