# Python | Sort list of lists by the size of sublists

• Last Updated : 11 May, 2020

Given a list of lists, the task is to sort a list on the basis of size of sublists. Let’s discuss a few methods to do the same.

Method #1: Using sort

 # Python code to demonstrate# sort list of list# on the basis of size of sublist  ini_list = [[1, 2, 3], [1, 2], [1, 2, 3, 4],                [1, 2, 3, 4, 5], [2, 4, 6]]  # printing initial ini_listprint ("initial list", str(ini_list))  # sorting on bais of size of listini_list.sort(key = len)  # printing final resultprint("final list", str(ini_list))
Output:

initial list [[1, 2, 3], [1, 2], [1, 2, 3, 4], [1, 2, 3, 4, 5], [2, 4, 6]]
final list [[1, 2], [1, 2, 3], [2, 4, 6], [1, 2, 3, 4], [1, 2, 3, 4, 5]]

Method #2: Using lambda

 # Python code to demonstrate# sort list of list# on the basis of size of sublist  ini_list = [[1, 2, 3], [1, 2], [1, 2, 3, 4],                [1, 2, 3, 4, 5], [2, 4, 6]]  # printing initial ini_listprint ("initial list", str(ini_list))  # sorting on bais of size of listini_list.sort(key = lambda x:len(x))  # printing final resultprint("final list", str(ini_list))
Output:

initial list [[1, 2, 3], [1, 2], [1, 2, 3, 4], [1, 2, 3, 4, 5], [2, 4, 6]]
final list [[1, 2], [1, 2, 3], [2, 4, 6], [1, 2, 3, 4], [1, 2, 3, 4, 5]]

Method #3: Using sorted

 # Python code to demonstrate# sort list of list# on the basis of size of sublist  ini_list = [[1, 2, 3], [1, 2], [1, 2, 3, 4],                [1, 2, 3, 4, 5], [2, 4, 6]]  # printing initial ini_listprint ("initial list", str(ini_list))  # sorting on bais of size of listresult = sorted(ini_list, key = len)  # printing final resultprint("final list", str(result))
Output:

initial list [[1, 2, 3], [1, 2], [1, 2, 3, 4], [1, 2, 3, 4, 5], [2, 4, 6]]
final list [[1, 2], [1, 2, 3], [2, 4, 6], [1, 2, 3, 4], [1, 2, 3, 4, 5]]

My Personal Notes arrow_drop_up