Sort a nested list in python

Question

I am trying to sort a nested list in Python in O(n log n) time. I am not sure how to go about it, some help would be appreciated. The inner lists are being sorted by its sum.

My list:

[10, 7, [4,5], [1,2]]

My desired output:

[[1,2], 7, [4,5], 10]

ssp4all · Accepted Answer · 2020-07-24 00:28:15Z

2

input_list = [10, 7, [4,5], [1,2]]
input_list.sort(key = lambda x: sum(x) if type(x) == list else x)
[[1, 2], 7, [4, 5], 10]

Time complexity will be m*n*lg(n)

n = length of the input list

m = average length of nested list

answered Jul 24, 2020 at 0:28

ssp4all

3792 silver badges12 bronze badges

Sign up to request clarification or add additional context in comments.

Collectives™ on Stack Overflow

Sort a nested list in python

1 Answer 1

Comments

Your Answer

Hot Network Questions

Collectives™ on Stack Overflow

1 Answer 1

Comments

Your Answer

Sign up or log in

Post as a guest

Related