10 examples of 'python sort list of lists by first element' in Python

70
def sorted(lst, cmp=None, key=None, reverse=None):
71
    "sorted(iterable, cmp=None, key=None, reverse=False) --> new sorted list"
72
    sorted_lst = list(lst)
73
    sorted_lst.sort(cmp, key, reverse)
74
    return sorted_lst

22
def Quick_Sort(list):
23
    Quick(list, 0, len(list) - 1)

23
def qsort(lst):
24
    """Return a sorted copy of the input list.
25
26
    Input:
27
28
      lst : a list of elements which can be compared.
29
30
    Examples:
31
32
    >>> qsort([])
33
    []
34
35
    >>> qsort([3,2,5])
36
    [2, 3, 5]
37
    """
38
39
    #@ Hint: remember that all recursive functions need an exit condition
40
    if len(lst) <= 1:  #@
41
        return lst #@
42
43
    #@ Select pivot and apply recursively
44
    pivot, rest   = lst[0],lst[1:] #@
45
    less_than     = [ lt for lt in rest if lt < pivot ] #@
46
    greater_equal = [ ge for ge in rest if ge >= pivot ] #@
47
48
    #@ Upon return, make sure to properly concatenate the output lists
49
    return qsort(less_than) + [pivot] + qsort(greater_equal) #@

5
def qsort(lst):
6
    """ Quick sort: returns a sorted copy of the list.
7
    """
8
    # Implement the quick sort logic here
9
    return lst

909
""" Contains(self: Queue[T], item: T) -> bool """
910
pass

27
def quick_sort(myList, start, end):
28
    if start < end:
29
        # partitioning the list
30
        split = partition(myList, start, end)
31
        # split halves & sort both halves
32
        quick_sort(myList, start, split - 1)
33
        quick_sort(myList, split + 1, end)
34
    return myList

10
def unordered_list_cmp(list1, list2):
11
    # Check lengths first for slight improvement in performance
12
    return len(list1) == len(list2) and sorted(list1) == sorted(list2)

15
def SortTwoLists(primary, secondary):
16
    # sort two lists by order of elements of the primary list
17
    paired_sorted = sorted(zip(primary, secondary), key=lambda x: x[0])
18
    return (map(list, zip(*paired_sorted)))  # two lists

40
def testLtSort(self):
41
    self.run_test(lt_sort, self.source)

23
def shell_sort(unsorted_list, add_list):
24
    '''shell_sort
25
    params：
26
        unsorted_list: 未排序列表
27
        add_list：增量列表
28
    returns:
29
        sorted_list：排序列表
30
    '''
31
    for add in add_list:
32
        unsorted_list = shell_sort_once(unsorted_list, add)
33
        
34
    return unsorted_list