[数据结构][Sort]nsert Sort

public class Solution
{
    public void insertSort(int[] data)
    {
        for(int i = 1; i < data.length; i ++)
        {
            int key = data[i];
            
            int pointer = i - 1;
            
            while((pointer >= 0) && (data[pointer] > key))
            {
                data[pointer + 1] = data[pointer];
                
                pointer --;
            }
            
            data[pointer + 1] = key;
        }
    }
    
}