geeksambhu

def quick_sort(given_list):
    if len(given_list) < 1:
        return given_list
    else:
        pivot_element = given_list[0] #here I am choosing the first element to be a pivot
        left = quick_sort([element for element in given_list[1:] if element < pivot_element]) # moving smaller to left
        right = quick_sort([element for element in given_list[1:] if element > pivot_element]) #moving greater to right
        return left + [pivot_element] + right

geeksambhu

Programming Achievements: How to Level Up as a Developer

This gist is part of a blog post. Check it out at:

http://jasonrudolph.com/blog/2011/08/09/programming-achievements-how-to-level-up-as-a-developer