Given a list of lists, the task is to sort each sublist in the given list of strings.
Example:
Input:
lst = [['Machine', 'London', 'Canada', 'France'],
['Spain', 'Munich'],
['Australia', 'Mandi']]
Output:
flist = [['Canada', 'France', 'London', 'Machine'],
['Munich', 'Spain'],
['Australia', 'Mandi']]
There are multiple ways to sort each list in alphabetical order.
Method #1 : Using map
Python3
# Python code to sort all sublists # in given list of strings# List initializationInput = [['Machine', 'London', 'Canada', 'France', 'Lanka'], ['Spain', 'Munich'], ['Australia', 'Mandi']]# Using map for sortingOutput = list(map(sorted, Input))# Printing outputprint(Output) |
[[‘Canada’, ‘France’, ‘Lanka’, ‘London’, ‘Machine’], [‘Munich’, ‘Spain’], [‘Australia’, ‘Mandi’]]
Time Complexity: O(n), where n is the number of elements in the list “test_list”.
Auxiliary Space: O(n), where n is the number of elements in the list “test_list”.
Method #2 : Using lambda and sorted
Python3
# Python code to sort all sublists# in given list of strings# List initializationInput = [['Machine', 'London', 'Canada', 'France', 'Lanka'], ['Spain', 'Munich'], ['Australia', 'Mandi']]# using lambda and sortedOutput = [sorted(x, key = lambda x:x[0]) for x in Input]# Printing outputprint(Output) |
[[‘Canada’, ‘France’, ‘London’, ‘Lanka’, ‘Machine’], [‘Munich’, ‘Spain’], [‘Australia’, ‘Mandi’]]
Time Complexity: O(nlogn)
Auxiliary Space: O(1)
Method #3 : Using iteration and sort
Python3
# Python code to sort all sublists# in given list of strings# List initializationInput = [['Machine', 'London', 'Canada', 'France', 'Lanka'], ['Spain', 'Munich'], ['Australia', 'Mandi']]# sorting sublistfor sublist in Input: sublist.sort()# Printing outputprint(Input) |
[[‘Canada’, ‘France’, ‘Lanka’, ‘London’, ‘Machine’], [‘Munich’, ‘Spain’], [‘Australia’, ‘Mandi’]]
Method #4 : Using simple list comprehension
Another approach to sort the sublists in a list of strings is to use the built-in sorted function and a list comprehension. This method involves iterating over each sublist in the list and sorting it using the sorted function, then returning the sorted sublist in a new list using a list comprehension. Here is an example of how this can be done:
Python3
# Initialize the list of listslst = [['Machine', 'London', 'Canada', 'France', 'Lanka'], ['Spain', 'Munich'], ['Australia', 'Mandi']]# Use a list comprehension to sort each sublist in the listsorted_lst = [sorted(sublist) for sublist in lst]# Print the sorted listprint(sorted_lst)#This code is contributed by Edula Vinay Kumar Reddy |
[['Canada', 'France', 'Lanka', 'London', 'Machine'], ['Munich', 'Spain'], ['Australia', 'Mandi']]
The time complexity of this approach is O(nlog(n)), where n is the total number of elements in the list, because the sorted function uses a sorting algorithm with a time complexity of O(nlog(n)). The auxiliary space is O(n) because a new list is created to hold the sorted sublists.
