|
|
#1
28-Mar-2006, 01:26
|
|||
|
|||
question on sorting items is not clear...plz help meQ) Design an algorithm for sorting N numbers on an O(log N)- processor
complete binary tree that has O(1) efficiency.(you may assume that each processor can process and store O(N/ log N) items, and you can take advantage of the fact that a single sequential processor can sort M items in O(M log M)steps. you may also allow I/O at each processor of the n/w). This is my question in an interview.I've to tell the answere on friday. I not even understood the question itself. Could any one please explain me what is it means?  |
|||
Recent GIDBlog
Programming ebook direct download available by crystalattice
| Thread Tools | Search this Thread |
| Rate This Thread | |
|
|
Similar Threads
|
||||
| Thread | Thread Starter | Forum | Replies | Last Post |
| About my Sorting with Pointer Notation Program.(Help)! | cougar1112 | C++ Forum | 3 | 16-Nov-2005 07:46 |
| non-member function question | crq | C++ Forum | 1 | 03-Feb-2005 22:59 |
| Simple question on arrays--please help! | brookeville | C++ Forum | 16 | 18-Nov-2004 00:23 |
| Repetition structure problem and question | brookeville | C++ Forum | 17 | 29-Oct-2004 18:48 |
| sorting question | fj8283888 | C Programming Language | 1 | 13-Apr-2004 21:42 |
Network Sites: GIDNetwork · GIDWebHosts · GIDSearch · Learning Journal by J de Silva, The
