Insertion vs Selection
Here is a sort that I put together after some research:

private void sort(PlayingCard[] hand)
{
    int i, j;
    PlayingCard temp;    
    for (i = 1; i &lt; hand.length; i++) {
        temp = hand[i];
        j = i;
        while (j &gt; 0 &amp;&amp; hand[j - 1].getRank().compareTo(temp.getRank()) &gt; 0) {
            hand[j] = hand[j - 1];
            j--;
        }        
        hand[j] = temp;
    }
}