quickk_sort_2.py

from threading import Thread
import threading
import time
import thread

def qsort(arr,low,high):

    if low < high:

        i = left - 1
        pivot = arr[high]

        for j in range(low,high):

            if arr[j] <=pivot:
                i = i+1
                arr[i],arr[j] = arr[j],arr[i]
        arr[i+1],arr[high] = arr[high],arr[i+1]


        print("thread {0} is sorting {1} and pivot is {2}".format(threading.current_thread(), sets[left:right+1], pivot))
        lthread = None
        rthread = None

        print "The array after pivot positioning ", sets
        lthread = Thread(target = lambda: qsort(sets,left,j))
        lthread.start()
        
        rthread = Thread(target=lambda: qsort(sets,i,right))
        rthread.start()

        if lthread is not None: lthread.join()
        if rthread is not None: rthread.join()
        return sets


'''testing below'''
ls = [10,5,1,3,6,4,9,2,8,16,7]
res = qsort(ls, 0, len(ls) - 1)
print(res)