Question

what is wrong with the following code?

Answer 1

\[#
def merge(sequence, left, mid, right):
leftseq = sequence[left:mid]
rightseq = sequence[mid:right]
i = j = k = 0
for k in xrange(len(sequence)):
if leftseq[i] <= rightseq[j]:
sequence[k] = leftseq[i]
i += 1
else:
sequence[k] = rightseq[j]
j += 1
if i == len(leftseq) or j == len(rightseq):
break
while k < len(sequence) and i < len(leftseq):
sequence[k] = leftseq[i]
i += 1
k += 1
while k < len(sequence) and j < len(rightseq):
sequence[k] = rightseq[j]
j += 1
k += 1

def recurse(sequence, left, right):
if len(sequence) > 1:
mid = (left + right) / 2
recurse(sequence, left, mid)
recurse(sequence, mid+1, right)
merge(sequence, left, mid, right)

def merge_sort(sequence):
recurse(sequence, 0, len(sequence))\]

Answer 2

hint: start from below

Answer 3

Which Language is this? Remind me VB but I think it isn't.

Answer 4

Python

Answer 5

Ah.. i don't know it. At school we only study VB. I'll try to look anyway.