What does the below algorithm do?

def is(A):
n = A.length
for j in xrange(2, n+1):
key = A[j]
i = j - 1
while i 0 and A[i] key:
A[i+1] = A[i]
i -= 1
A[i + 1] = key

Question

What does the below algorithm do?

def is(A):
  n = A.length
  for j in xrange(2, n+1):
    key = A[j]
    i = j - 1
    while i > 0 and A[i] > key:
      A[i+1] = A[i]
      i -= 1
    A[i + 1] = key

anonymous · Answer

Insertion sort ?

anonymous · Answer

I thought it was selection sort

anonymous · Answer

$$\forall x\ \text{mathematician}(x) \implies \text{knowspython}(x)$$
i think it's false

anonymous · Answer

how come? every math guy I meet knows either Python, Mathematica, or MATLAB

anonymous · Answer

or all 3 :-D

anonymous · Answer

either $\neq$ and

anonymous · Answer

where did you get that algorithm?

anonymous · Answer

topcoder.com

anonymous · Answer

Learning from TC tutorials ?

anonymous · Answer

yes

anonymous · Answer

Good luck!:) and I think this is insertion sort check out the algorithm in here: http://en.wikipedia.org/wiki/Insertion_sort

anonymous · Answer

I'll have lots to learn... I'm still a loser who thinks linked lists and arrays are the same thing.

anonymous · Answer

and who compiles from the IDE... and who doesn't know how to use gcc make

anonymous · Answer

lol, I too compile through the IDE and I know  many topcoders and top coders who do the same.