# Python: Sort a given matrix in ascending order according to the sum of its rows using lambda

## Python Lambda: Exercise-30 with Solution

Write a Python program to sort a given matrix in ascending order according to the sum of its rows using lambda.

**Sample Solution**:

**Python Code :**

```
def sort_matrix(M):
result = sorted(M, key=lambda matrix_row: sum(matrix_row))
return result
matrix1 = [[1, 2, 3], [2, 4, 5], [1, 1, 1]]
matrix2 = [[1, 2, 3], [-2, 4, -5], [1, -1, 1]]
print("Original Matrix:")
print(matrix1)
print("\nSort the said matrix in ascending order according to the sum of its rows")
print(sort_matrix(matrix1))
print("\nOriginal Matrix:")
print(matrix2)
print("\nSort the said matrix in ascending order according to the sum of its rows")
print(sort_matrix(matrix2))
```

Sample Output:

Original Matrix: [[1, 2, 3], [2, 4, 5], [1, 1, 1]] Sort the said matrix in ascending order according to the sum of its rows [[1, 1, 1], [1, 2, 3], [2, 4, 5]] Original Matrix: [[1, 2, 3], [-2, 4, -5], [1, -1, 1]] Sort the said matrix in ascending order according to the sum of its rows [[-2, 4, -5], [1, -1, 1], [1, 2, 3]]

## Visualize Python code execution:

The following tool visualize what the computer is doing step-by-step as it executes the said program:

**Python Code Editor:**

**Have another way to solve this solution? Contribute your code (and comments) through Disqus.**

**Previous:** Write a Python program to find the maximum value in a given heterogeneous list using lambda.

**Next:** Write a Python program to extract specified size of strings from a give list of string values using lambda.

**What is the difficulty level of this exercise?**

Test your Python skills with w3resource's quiz

## Python: Tips of the Day

**Python: Cache results with decorators**

There is a great way to cache functions with decorators in Python. Caching will help save time and precious resources when there is an expensive function at hand.

Implementation is easy, just import lru_cache from functools library and decorate your function using @lru_cache.

from functools import lru_cache @lru_cache(maxsize=None) def fibo(a): if a <= 1: return a else: return fibo(a-1) + fibo(a-2) for i in range(20): print(fibo(i), end="|") print("\n\n", fibo.cache_info())

Output:

0|1|1|2|3|5|8|13|21|34|55|89|144|233|377|610|987|1597|2584|4181| CacheInfo(hits=36, misses=20, maxsize=None, currsize=20)

**New Content published on w3resource:**- Scala Programming Exercises, Practice, Solution
- Python Itertools exercises
- Python Numpy exercises
- Python GeoPy Package exercises
- Python Pandas exercises
- Python nltk exercises
- Python BeautifulSoup exercises
- Form Template
- Composer - PHP Package Manager
- PHPUnit - PHP Testing
- Laravel - PHP Framework
- Angular - JavaScript Framework
- React - JavaScript Library
- Vue - JavaScript Framework
- Jest - JavaScript Testing Framework