Solved

I'm facing a question with comparison networks. Find second and third min.

Posted on 2014-03-23
10
354 Views
Last Modified: 2014-03-24
I'm asked to
a. prove that depth of a comparison network that will find values of seond and third minimum is Omega(lg n).  
b. build such a network.

I need a hand here.

http://en.wikipedia.org/wiki/File:Six-wire-bubble-sorting-network.svg
0
Comment
Question by:aboo_s
  • 6
  • 3
10 Comments
 
LVL 37

Accepted Solution

by:
TommySzalapski earned 300 total points
ID: 39949332
Could you do it for the first minimum?
Do that and then remember that Omega(3 lg n) = Omega(lg n)
0
 
LVL 10

Author Comment

by:aboo_s
ID: 39949460
And why is finding the first minimum is Omega(n) in network depth?
You need only n/2 comparators for that.
0
 
LVL 84

Assisted Solution

by:ozo
ozo earned 200 total points
ID: 39949464
Omega(n) = Omega(n/2) but the depth of a comparison network for the first minimum is Omega(lg n)
0
Live: Real-Time Solutions, Start Here

Receive instant 1:1 support from technology experts, using our real-time conversation and whiteboard interface. Your first 5 minutes are always free.

 
LVL 10

Author Comment

by:aboo_s
ID: 39949613
ozo:
I know that the depth is Omega(lg n), I'm asked to prove that. And build such a network.
0
 
LVL 10

Author Comment

by:aboo_s
ID: 39949616
I have got the answer.
If anybody likes to hear it, I'll be more than happy.
0
 
LVL 84

Expert Comment

by:ozo
ID: 39949626
Can you find an Omega(lg n) depth network for the first minimum?
0
 
LVL 10

Author Comment

by:aboo_s
ID: 39949645
Yes, that's what I have found.  Attached is an example for N=8.
first-min.jpg
0
 
LVL 84

Expert Comment

by:ozo
ID: 39949655
And does TommySzalapski's hint suggest a way to modify that yo find the second and third minimum?
0
 
LVL 10

Author Comment

by:aboo_s
ID: 39949659
No, he only pointed out that if you can do it for the first it's no problem to do the second and third. But that wasn't what I asked. I asked to do it for the minimum in the first place.

Anyway, thank you all for your time, points will be split.
0
 
LVL 10

Author Closing Comment

by:aboo_s
ID: 39949660
Thanks again.
0

Featured Post

Live: Real-Time Solutions, Start Here

Receive instant 1:1 support from technology experts, using our real-time conversation and whiteboard interface. Your first 5 minutes are always free.

Question has a verified solution.

If you are experiencing a similar issue, please ask a related question

Suggested Solutions

Title # Comments Views Activity
How to onstruct a table 4 49
Simple Random Sample 2 59
Percentage 6 57
Best, Average or Worst ? 12 89
A Guide to the PMT, FV, IPMT and PPMT Functions In MS Excel we have the PMT, FV, IPMT and PPMT functions, which do a fantastic job for interest rate calculations.  But what if you don't have Excel ? This article is for programmers looking to re…
How to Win a Jar of Candy Corn: A Scientific Approach! I love mathematics. If you love mathematics also, you may enjoy this tip on how to use math to win your own jar of candy corn and to impress your friends. As I said, I love math, but I gu…
This is a video describing the growing solar energy use in Utah. This is a topic that greatly interests me and so I decided to produce a video about it.
Finds all prime numbers in a range requested and places them in a public primes() array. I've demostrated a template size of 30 (2 * 3 * 5) but larger templates can be built such 210  (2 * 3 * 5 * 7) or 2310  (2 * 3 * 5 * 7 * 11). The larger templa…

776 members asked questions and received personalized solutions in the past 7 days.

Join the community of 500,000 technology professionals and ask your questions.

Join & Ask a Question