My task is to obtain O(m+k) complexity. With min heap i will obtain O(m logn). So not to good. Thanks dave, for your answer.. I'll try :) !
- [algogeeks] Re: [ counting sort ideea ] ed.thyme
My task is to obtain O(m+k) complexity. With min heap i will obtain O(m logn). So not to good. Thanks dave, for your answer.. I'll try :) !