but in this approach , How is Push having O(1) complexity ?
On 25 May 2013 17:52, rohit jangid <[email protected]> wrote: > you are doing it correct. > > > On Sat, May 25, 2013 at 5:37 PM, Nishant Pandey < > [email protected]> wrote: > >> I am not getting the y priority Q is getting used for this question, as >> in case of P Queue, things are arranged as per the priority so when we will >> insert the data we can simply increament the priority. >> >> Algo would be like this : >> >> Enque(q, data) { >> push(q, data, increrase the prioroty); >> } >> >> int Deque() { >> return pop(); >> } >> >> here higher priority one shuld be poped first. >> >> PLEASE SUGGEST if any good approach some one is having other than this ? >> >> >> -- >> You received this message because you are subscribed to the Google Groups >> "Algorithm Geeks" group. >> To unsubscribe from this group and stop receiving emails from it, send an >> email to [email protected]. >> >> >> > > > > -- > Rohit Jangid > http://rohitjangid.com > Graduate > Deptt. of Computer Engineering > NSIT, Delhi University, India > > -- > You received this message because you are subscribed to the Google Groups > "Algorithm Geeks" group. > To unsubscribe from this group and stop receiving emails from it, send an > email to [email protected]. > > > -- Regards, Ankur Khurana Software Developer Engineer, Microsoft India Development Center, Hyderabad. -- You received this message because you are subscribed to the Google Groups "Algorithm Geeks" group. To unsubscribe from this group and stop receiving emails from it, send an email to [email protected].
