How does Batcher Merge work at a high level?

Posted by Mike on Stack Overflow See other posts from Stack Overflow or by Mike
Published on 2010-03-01T23:15:21Z Indexed on 2010/03/24 18:53 UTC
Read the original article Hit count: 321

Filed under:

sort

|

parallel

|

batcher-sort

|

algorithm

I'm trying to grasp the concept of a Batcher Sort. However, most resources I've found online focus on proof entirely or on low-level pseudocode. Before I look at proofs, I'd like to understand how Batcher Sort works. Can someone give a high level overview of how Batcher Sort works(particularly the merge) without overly verbose pseudocode(I want to get the idea behind the Batcher Sort, not implement it)? Thanks!

© Stack Overflow or respective owner

Related posts about sort

How is counting sort a stable sort?

as seen on Stack Overflow - Search for 'Stack Overflow'
Suppose my input is (a,b and c to distinguish between equal keys) 1 6a 8 3 6b 0 6c 4 My counting sort will save as (discarding the a,b and c info!!) 0(1) 1(1) 3(1) 4(1) 6(3) 8(1) which will give me the result 0 1 3 4 6 6 6 8 So, how is this stable sort? I am not sure how it is "maintaining… >>> More
Quick Sort Vs Merge Sort

as seen on Stack Overflow - Search for 'Stack Overflow'
Why might quick sort be better than merge sort ? >>> More
Sort list using stl sort function

as seen on Stack Overflow - Search for 'Stack Overflow'
I'm trying to sort a list (part of a class) in descending containg items of a struct but it doesn't compile(error: no match for 'operator-' in '__last - __first'): sort(Result.poly.begin(), Result.poly.end(), SortDescending()); And here's SortDescending: struct SortDescending { bool operator()(const… >>> More
Using selection sort in java to sort floats

as seen on Stack Overflow - Search for 'Stack Overflow'
Hey, I need to sort an array list of class house by a float field in a certain range. This is my code for the selection sort: public ArrayList<House> sortPrice(ArrayList<House> x,float y, float z){ ArrayList<House> xcopy = new ArrayList<House>(); for(int i = 0; i<x… >>> More
org-sort multi: date/time (?d ?t) | priority (?p) | title (?a)

as seen on Super User - Search for 'Super User'
Is anyone aware of an org-sort function / modification that can refile / organize a group of TODO so that it sorts them by three (3) criteria: first sort by due date, second sort by priority, and third sort by by title of the task? EDIT: I believe that org-sort by deadline (?d) has a bug that… >>> More

Related posts about parallel

Going Parallel with the Task Parallel Library and PLINQ

as seen on Internet.com - Search for 'Internet.com'
With more and more computers using a multi-core processor, the free lunch of increased clock speeds and the inherent performance gains are over. Software developers must instead make sure their applications take use of all the cores available in an efficient manner. New features in .NET 4.0 mean that… >>> More
Parallel Desktops: installing Parallel Tools on Ubuntu

as seen on Super User - Search for 'Super User'
hi, I get the following error when I try to install Parallel Tools on my Ubuntu in Parallel Desktop. I follow the istructions, running sh install from terminal: I follow the UI istructions and then the installation stops with this error message: E: Couldn't find package dkms Fri May 7 14:34:20… >>> More
Improving Partitioned Table Join Performance

as seen on SQL Blog - Search for 'SQL Blog'
The query optimizer does not always choose an optimal strategy when joining partitioned tables. This post looks at an example, showing how a manual rewrite of the query can almost double performance, while reducing the memory grant to almost nothing. Test Data The two tables in this example use… >>> More
Async.Parallel or Array.Parallel.Map ?

as seen on Stack Overflow - Search for 'Stack Overflow'
Hello- I'm trying to implement a pattern I read from Don Syme's blog (http://blogs.msdn.com/dsyme/archive/2010/01/09/async-and-parallel-design-patterns-in-f-parallelizing-cpu-and-i-o-computations.aspx) which suggests that there are opportunities for massive performance improvements from leveraging… >>> More
Parallel Debugging

as seen on Daniel Moth - Search for 'Daniel Moth'
Using Visual Studio 2010 parallel debugging is easy. Two new debugging windows provide a total view of the internals of your PPL and TPL applications with hints on where to start investigations. These are not mere extensions to VS, but tightly integrated with the rest of the debugger experience, so… >>> More