fast algorithm to sort very small set
        Posted  
        
            by aaa
        on Stack Overflow
        
        See other posts from Stack Overflow
        
            or by aaa
        
        
        
        Published on 2010-05-01T03:13:58Z
        Indexed on 
            2010/05/01
            3:17 UTC
        
        
        Read the original article
        Hit count: 547
        
hello.
This is the problem I ran into long time ago. I thought I may ask your for your ideas. assume I have very small set of numbers (integers), 4 or 8 elements, that need to be sorted, fast. what would be the best approach/algorithm? my approach was to use the max/min functions only.
At this point it becomes somewhat hardware dependent , so let us assume Intel 64-bit processor with SSE3 .
Thanks
© Stack Overflow or respective owner