Re: Merging of priority queue

Tech-Archive recommends: Repair Windows Errors & Optimize Windows Performance



I am missing something. Why not just copy the arrays to a new array or
queue?

--
William Stacey [C# MVP]

<vidishasharma@xxxxxxxxx> wrote in message
news:1169710094.672008.190210@xxxxxxxxxxxxxxxxxxxxxxxxxxxxxx
|
|
| Will conquer step from the merge sort algorithm be good enough for
| merging of priority queues.
|
| can you suggest some good URL
|
| On Jan 24, 6:32 pm, Stefan Hoffmann <stefan.hoffm...@xxxxxxxxxx>
| wrote:
| > hi,
| >
| > vidishasha...@xxxxxxxxx wrote:
| > > Can somebody suggest good URL which contains code for merging of 2 or
| > > more priority queues in c#.Use the conquer step from the merge sort
algorithm.
| >
| > mfG
| > --> stefan <--
|


.



Relevant Pages

  • Re: Merging of priority queue
    ... William Stacey [C# MVP] ... Why not just copy the arrays to a new array or ... | Then the queue itself has to sort it, ...
    (microsoft.public.dotnet.languages.csharp)
  • Re: searching for the largest array
    ... > which you can do in constant time, ... > Your main data structures are a set of maximal ... > ARRAYS and QUEUE. ... QUEUE will actually hold records ...
    (comp.lang.lisp)
  • Re: searching for the largest array
    ... which you can do in constant time, ... Your main data structures are a set of maximal ... ARRAYS and QUEUE. ...
    (comp.lang.lisp)
  • Re: Dequeue element overhead
    ... I also see no reason for a Queue to require a contiguous memory space to ... If it really is similar to arrays, then the act of adding to the ... surprisingly efficient and fast passing data via Queues is.  ...
    (comp.lang.labview)
  • Re: using realloc for a dynamically growing array
    ... doing so frees both arrays. ... I do need seperate arrays and yes they can be seperately freed. ... array of pointers and instead sort (based on what they point to ... ofcourse) that using the quick sort algorithm. ...
    (comp.lang.c)