A1: Q4: n log k?
Author Message
g2chenri Offline
Student


Reputation: 0
Post: #1
A1: Q4: n log k?
So I talked with the TA and we discussed how there was an adequate solution using a min/max heap in n log n time, but not for n log k...so how does one reduce it to n log k?
2013-01-28 21:22
Find all posts by this user Quote this message in a reply
g2sashi Offline
Wao~


Reputation: 0
Post: #2
RE: A1: Q4: n log k?
Most I can say without giving it away is "Think small". What would it take for that log n to be log k?
2013-01-30 18:43
Find all posts by this user Quote this message in a reply
Post Reply 
 
Thread Rating:
  • 0 Votes - 0 Average
  • 1
  • 2
  • 3
  • 4
  • 5


Forum Jump:


User(s) browsing this thread: 1 Guest(s)