C Code:
{
\begin{verbatim}
   1: void Insertionsort( double A[], int n ) {
   2:     // sort A[0],A[1],...,A[n-1] into ascending order
   3:     int i,m; double t;
   4:     if( n<=1 ) return; // A is already sorted
   5:     Insertionsort(A,n-1);
   6:     t = A[n-1];
   7:     for( i=n-2; i>=0 && A[i]>t; i-- )
   8:         A[i+1] = A[i];
   9:     A[i+1] = t;
  10: }
\end{verbatim}

Python Code:
{
   1: def Insertionsort(A,n):
   2:     # sort A[0], A[1], ..., A[n-1] into ascending order
   3:     if n<=1: return # A is already sorted
   4:     Insertionsort(A,n-1)
   5:     t = A[n-1];
   6:     i = n-2
   7:     while i>=0 and A[i]>t:
   8:            A[i+1] = A[i]
   9:            i -= 1
  10:     A[i+1] = t
}

