Tell me more ×
Theoretical Computer Science Stack Exchange is a question and answer site for theoretical computer scientists and researchers in related fields. It's 100% free, no registration required.
up vote -1 down vote favorite

please help me to find any parallel algorithm with any topological architecture to find k-th largest number in array in log(N) which N is the number of element in array

share|improve this question
3  
This is not a research-level question. Please read the FAQ: meta.cstheory.stackexchange.com/questions/225/… – JɛffE Jan 1 '11 at 21:32
This sounds a lot like a HW question. – Mark Reitblatt Jan 1 '11 at 22:00
This site is for research-level questions in theoretical computer science, that are likely to have short well-defined answers. "Research-level" means, roughly, questions that might be discussed between two professors, or between graduate students working on Ph.D.'s, but not usually between a professor and the typical undergraduate student. It does not include questions at the level of difficulty of undergraduate homework. – Kaveh♦ Jan 2 '11 at 4:38
Please also read the site's FAQ and How to ask a good question?. This does not seem to be a research-level question and does not provide any motivation, therefore I am voting to close as off-topic. – Kaveh♦ Jan 2 '11 at 4:45

closed as off topic by Kaveh♦, Tsuyoshi Ito, Suresh Venkat♦ Jan 3 '11 at 0:58

Questions on Theoretical Computer Science Stack Exchange are expected to relate to theoretical computer science within the scope defined in the FAQ. Consider editing the question or leaving comments for improvement if you believe the question can be reworded to fit within the scope. Read more about closed questions here.

1 Answer

up vote 0 down vote

this algorithms is in this book:(Introduction to Parallel Processing: Algorithms and Architectures ; Behrooz Parhami) http://www.amazon.com/Introduction-Parallel-Processing-Algorithms-Architectures/dp/0306459701

share|improve this answer

Not the answer you're looking for? Browse other questions tagged or ask your own question.