FilesExpand file tree

 Write-for-current-Python

/

natural_sort.py

Copy path

Blame

More file actions

Blame

More file actions

Latest commit

 

History

History

History

36 lines (25 loc) · 1.18 KB

 Write-for-current-Python

/

natural_sort.py

Copy path

Top

File metadata and controls

• Code
• Blame

36 lines (25 loc) · 1.18 KB

Raw

Copy raw file

Download raw file

Open symbols panel

Edit and raw actions

1

2

3

4

5

6

7

8

9

10

11

12

13

14

15

16

17

18

19

20

21

22

23

24

25

26

27

28

29

30

31

32

33

34

35

36

from __future__ import annotations

import re

def natural_sort(input_list: list[str]) -> list[str]:

"""

Sort the given list of strings in the way that humans expect.

The normal Python sort algorithm sorts lexicographically,

so you might not get the results that you expect...

>>> example1 = ['2 ft 7 in', '1 ft 5 in', '10 ft 2 in', '2 ft 11 in', '7 ft 6 in']

>>> sorted(example1)

['1 ft 5 in', '10 ft 2 in', '2 ft 11 in', '2 ft 7 in', '7 ft 6 in']

>>> # The natural sort algorithm sort based on meaning and not computer code point.

>>> natural_sort(example1)

['1 ft 5 in', '2 ft 7 in', '2 ft 11 in', '7 ft 6 in', '10 ft 2 in']

>>> example2 = ['Elm11', 'Elm12', 'Elm2', 'elm0', 'elm1', 'elm10', 'elm13', 'elm9']

>>> sorted(example2)

['Elm11', 'Elm12', 'Elm2', 'elm0', 'elm1', 'elm10', 'elm13', 'elm9']

>>> natural_sort(example2)

['elm0', 'elm1', 'Elm2', 'elm9', 'elm10', 'Elm11', 'Elm12', 'elm13']

"""

def alphanum_key(key):

return [int(s) if s.isdigit() else s.lower() for s in re.split("([0-9]+)", key)]

return sorted(input_list, key=alphanum_key)

if __name__ == "__main__":

import doctest

doctest.testmod()