SIMPLE AND EASY PYTHON CODE
Here's a concise Python solution that meets the requirements:Explanation:

Generate the Coordinates:A list comprehension creates a list of all cells in the matr
Here's a concise Python solution that meets the requirements:

```python
def allCellsDistOrder(rows: int, cols: int, rCenter: int, cCenter: int):
    # Create a list of all cell coordinates in the matrix
    cells = [[r, c] for r in range(rows) for c in range(cols)]
    
    # Sort the cells by their Manhattan distance from (rCenter, cCenter)
    cells.sort(key=lambda cell: abs(cell[0] - rCenter) + abs(cell[1] - cCenter))
    
    return cells

```

### Explanation:
1. **Generate the Coordinates:**  
   A list comprehension creates a list of all cells in the matrix.

2. **Sort by Manhattan Distance:**  
   The `sort` method uses a lambda function to compute the Manhattan distance for each cell:
   \[
   \text{distance} = |r - rCenter| + |c - cCenter|
   \]
   The cells are sorted in increasing order of this distance.

3. **Return the Result:**  
   Finally, the sorted list is returned.

This approach is straightforward and efficient for the problem constraints.

![b108d001-cf15-4ff7-847d-0497b3becd90.webp](https://assets.leetcode.com/users/images/deb3b8cd-6566-4636-928b-4db26b848da3_1739945217.5361938.webp)

['Python']