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

Every line of 'python sort list of lists by first element' code snippets is scanned for vulnerabilities by our powerful machine learning engine that combs millions of open source libraries, ensuring your Python code is secure.

## All examples are scanned by Snyk Code

By copying the Snyk Code Snippets you agree to
``70def sorted(lst, cmp=None, key=None, reverse=None):71    "sorted(iterable, cmp=None, key=None, reverse=False) --&gt; new sorted list"72    sorted_lst = list(lst)73    sorted_lst.sort(cmp, key, reverse)74    return sorted_lst``
``22def Quick_Sort(list):23    Quick(list, 0, len(list) - 1)``
``23def qsort(lst):24    """Return a sorted copy of the input list.2526    Input:2728      lst : a list of elements which can be compared.2930    Examples:3132    &gt;&gt;&gt; qsort([])33    []3435    &gt;&gt;&gt; qsort([3,2,5])36    [2, 3, 5]37    """3839    #@ Hint: remember that all recursive functions need an exit condition40    if len(lst) &lt;= 1:  #@41        return lst #@4243    #@ Select pivot and apply recursively44    pivot, rest   = lst[0],lst[1:] #@45    less_than     = [ lt for lt in rest if lt &lt; pivot ] #@46    greater_equal = [ ge for ge in rest if ge &gt;= pivot ] #@4748    #@ Upon return, make sure to properly concatenate the output lists49    return qsort(less_than) + [pivot] + qsort(greater_equal) #@``
``5def qsort(lst):6    """ Quick sort: returns a sorted copy of the list.7    """8    # Implement the quick sort logic here9    return lst``
``909""" Contains(self: Queue[T], item: T) -&gt; bool """910pass``
``27def quick_sort(myList, start, end):28    if start &lt; end:29        # partitioning the list30        split = partition(myList, start, end)31        # split halves &amp; sort both halves32        quick_sort(myList, start, split - 1)33        quick_sort(myList, split + 1, end)34    return myList``
``10def unordered_list_cmp(list1, list2):11    # Check lengths first for slight improvement in performance12    return len(list1) == len(list2) and sorted(list1) == sorted(list2)``
``15def SortTwoLists(primary, secondary):16    # sort two lists by order of elements of the primary list17    paired_sorted = sorted(zip(primary, secondary), key=lambda x: x[0])18    return (map(list, zip(*paired_sorted)))  # two lists``
``40def testLtSort(self):41    self.run_test(lt_sort, self.source)``
``23def shell_sort(unsorted_list, add_list):24    '''shell_sort25    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``