Sort algorithm with fewest number of operations

Posted by luvieere on Stack Overflow See other posts from Stack Overflow or by luvieere
Published on 2010-06-11T19:22:37Z Indexed on 2010/06/11 19:33 UTC
Read the original article Hit count: 390

Filed under:
|
|
|
|

What is the sort algorithm with fewest number of operations? I need to implement it in HLSL as part of a pixel shader effect v2.0 for WPF, so it needs to have a really small number of operations, considering Pixel Shader's limitations. I need to sort 9 values, specifically the current pixel and its neighbors.

© Stack Overflow or respective owner

Related posts about wpf

Related posts about algorithm