public void insertionSort()
    {
    	System.out.println("Insertionsort");
    	for(int i = 1; i < MAX; ++i)
    	{
    		System.out.print(i + "." + "  ");
    		anzeigen(3);
    		int key = i;
    		for(int j = (i-1); j>=0 ; --j)
    		{
    			if(kopIns[j] > kopIns[key])
    			{
    				tausche(key,j,3);
    				key = j;
    			}
    		}
    	}
    	System.out.print(MAX + "." + " ");
    	anzeigen(3);
    }v