Create merge_sort_fastest.py

[yesIamHasi]

Python implementation of merge sort algorithm.
Takes an average of 0.6 microseconds to sort a list of length 1000 items.
Best Case Scenario : O(n)
Worst Case Scenario : O(n)

[christianbender]

You must indent this line.

[christianbender]

Your function don't work. I tested it:

def merge_sort(LIST):
    start = []
    end = []
    a = LIST[0]
    b = LIST[-1]
    while (LIST.index(a) == LIST.index(b) and len(LIST) <=2):
        a = min(LIST)
        b = max(LIST)
        start.append(a)
        end.append(b)
        LIST.remove(a)
        LIST.remove(b)
    end.reverse()
    return (start + end)

liste = [4,1,99,3,2,2,0,100]
print liste
print merge_sort(liste)

The output is:

[4, 1, 99, 3, 2, 2, 0, 100]
[]

[christianbender]

@yesIamHasi I debuggt your code. The problem is in fact your code don't touch the while loop.

[harshildarji]

@christianbender I have modified the code a little to make it work as (contributor) expected! It is working on my side, but it will be good if you also confirm it!

code:

def merge_sort(LIST):
    start = []
    end = []
    while len(LIST) > 1:
        a = min(LIST)
        b = max(LIST)
        start.append(a)
        end.append(b)
        LIST.remove(a)
        LIST.remove(b)
    if LIST: start.append(LIST[0])
    end.reverse()
    return (start + end)

l = [4,1,99,3,2,2,0,5,6,45,100,34,44,999,998]
print(l)
print(merge_sort(l))

output:

[4, 1, 99, 3, 2, 2, 0, 5, 6, 45, 100, 34, 44, 999, 998]
[0, 1, 2, 2, 3, 4, 5, 6, 34, 44, 45, 99, 100, 998, 999]

I'll (or you can) merge this once you confirm!

[christianbender]

@harshildarji It works for me.