fastest way to sort the entries of a "smooth" 2D array

Posted by Drew Wagner on Stack Overflow See other posts from Stack Overflow or by Drew Wagner
Published on 2010-04-01T00:11:18Z Indexed on 2010/04/01 0:13 UTC
Read the original article Hit count: 542

Filed under:

mergesort

|

timsort

What is the fastest way to sort the values in a smooth 2D array?

The input is a small filtered image:

about 60 by 80 pixels
single channel
single or double precision float
row major storage, sequential in memory
values have mixed sign
piecewise "smooth", with regions on the order of 10 pixels wide

Output is a flat (about 4800 value) array of the sorted values, along with the indices that sort the original array.

Related posts about mergesort

question about mergesort

as seen on Stack Overflow - Search for 'Stack Overflow'
i have write code on mergesort here is code public class mergesort{ public static int a[]; public static void merges(int work[],int low,int high){ if (low==high) return ; else{ int mid=(low+high)/2; merges(work,low,mid); merges(work,mid+1,high); merge(work,low,mid+1,high); } } public… >>> More
Mergesort : Revision

as seen on Stack Overflow - Search for 'Stack Overflow'
Does merge sort work by; taking a list of values splitting it in to two take the first element of each list, the lowest value one goes in to a new list(and i guess removed from the original). comare the next two numbers - do this until one list is empty, then place the rest of the other list at… >>> More
Problem with Mergesort in C++

as seen on Stack Overflow - Search for 'Stack Overflow'
vector<int>& mergesort(vector<int> &a) { if (a.size() == 1) return a; int middle = a.size() / 2; vector<int>::const_iterator first = a.begin(); vector<int>::const_iterator mid = a.begin() + (middle - 1); vector<int>::const_iterator last = a… >>> More
Using Mergesort to calculate number of inversions in C++

as seen on Stack Overflow - Search for 'Stack Overflow'
void MergeSort(int A[], int n, int B[], int C[]) { if(n > 1) { Copy(A,0,floor(n/2),B,0,floor(n/2)); Copy(A,floor(n/2),n-1,C,0,floor(n/2)-1); MergeSort(B,floor(n/2),B,C); MergeSort(C,floor(n/2),B,C); Merge(A,B,0,floor(n/2),C,0,floor(n/2)-1); } }; void Copy(int A[], int startIndexA… >>> More
Merge sort. ArrayIndexOutOfBoundsException [migrated]

as seen on Programmers - Search for 'Programmers'
When I execute the program I am getting an error as stated below the program. Please help me figure out the problem.. import java.util.*; class Mergesort { public static void main(String args[]) { Scanner in= new Scanner(System.in); System.out.println("Enter the number of elements"); … >>> More

Developer IT

fastest way to sort the entries of a "smooth" 2D array - Developer IT

fastest way to sort the entries of a "smooth" 2D array

mergesort

timsort

Related posts about mergesort

question about mergesort

Mergesort : Revision

Problem with Mergesort in C++

Using Mergesort to calculate number of inversions in C++

Merge sort. ArrayIndexOutOfBoundsException [migrated]

Related posts about timsort

fast, clean, C, timsort implementation?

fastest way to sort the entries of a "smooth" 2D array

Categories cloud