Sort list of strings ignoring upper/lower case
Question:
I have a list which contains strings representing animal names. I need to sort the list. If I use sorted(list), it will give the list output with uppercase strings first and then lowercase.
But I need the below output.
Input:
var = ['ant','bat','cat','Bat','Lion','Goat','Cat','Ant']
Output:
['ant', 'Ant', 'bat', 'Bat', 'cat', 'Cat', 'Goat', 'Lion']
Answers:
The sort() method and the sorted() function take a key argument:
var.sort(key=lambda v: v.upper())
The function named in key is called for each value and the return value is used when sorting, without affecting the actual values:
>>> var=['ant','bat','cat','Bat','Lion','Goat','Cat','Ant']
>>> sorted(var, key=lambda v: v.upper())
['ant', 'Ant', 'bat', 'Bat', 'cat', 'Cat', 'Goat', 'Lion']
To sort Ant before ant, you’d have to include a little more info in the key, so that otherwise equal values are sorted in a given order:
>>> sorted(var, key=lambda v: (v.upper(), v[0].islower()))
['Ant', 'ant', 'Bat', 'bat', 'Cat', 'cat', 'Goat', 'Lion']
The more complex key generates ('ANT', False) for Ant, and ('ANT', True) for ant; True is sorted after False and so uppercased words are sorted before their lowercase equivalent.
See the Python sorting HOWTO for more information.
New answer for Python 3, I’d like to add two points:
- Use
str.casefold for case-insensitive comparisons.
- Use the method directly instead of inside of a lambda.
That is:
var = ['ant','bat','cat','Bat','Lion','Goat','Cat','Ant']
var.sort(key=str.casefold)
(which sorts in-place) and now:
>>> var
['ant', 'Ant', 'bat', 'Bat', 'cat', 'Cat', 'Goat', 'Lion']
Or, to return a new list, use sorted
>>> var = ['ant','bat','cat','Bat','Lion','Goat','Cat','Ant']
>>> sorted(var, key=str.casefold)
['ant', 'Ant', 'bat', 'Bat', 'cat', 'Cat', 'Goat', 'Lion']
Why is this different from str.lower or str.upper? According to the documentation:
Casefolding is similar to lowercasing but more aggressive because it is intended to remove all case distinctions in a string. For example, the German lowercase letter 'ß' is equivalent to "ss". Since it is already lowercase, str.lower() would do nothing to 'ß'; casefold() converts it to "ss".
I need to add yet another answer, since both the accepted answer and the newer
versions lack one important thing:
The here proposed case-insensitive sorting is not stable in the ordering of
“equal” keys!
That means: When you have a mixture of mixed case strings that you want to sort,
you get a correctly sorted list, but it is undefined whether “AbC” comes before
“aBc” or after. This may even vary between runs of the same program.
In order to always have the same output with a stable default ordering of strings,
I use the following function:
sorted(var, key=lambda v: (v.casefold(), v))
This way, the original key is always appended as a fallback ordering when the
casefold version does not supply a difference to sort on.
I have a list which contains strings representing animal names. I need to sort the list. If I use sorted(list), it will give the list output with uppercase strings first and then lowercase.
But I need the below output.
Input:
var = ['ant','bat','cat','Bat','Lion','Goat','Cat','Ant']
Output:
['ant', 'Ant', 'bat', 'Bat', 'cat', 'Cat', 'Goat', 'Lion']
The sort() method and the sorted() function take a key argument:
var.sort(key=lambda v: v.upper())
The function named in key is called for each value and the return value is used when sorting, without affecting the actual values:
>>> var=['ant','bat','cat','Bat','Lion','Goat','Cat','Ant']
>>> sorted(var, key=lambda v: v.upper())
['ant', 'Ant', 'bat', 'Bat', 'cat', 'Cat', 'Goat', 'Lion']
To sort Ant before ant, you’d have to include a little more info in the key, so that otherwise equal values are sorted in a given order:
>>> sorted(var, key=lambda v: (v.upper(), v[0].islower()))
['Ant', 'ant', 'Bat', 'bat', 'Cat', 'cat', 'Goat', 'Lion']
The more complex key generates ('ANT', False) for Ant, and ('ANT', True) for ant; True is sorted after False and so uppercased words are sorted before their lowercase equivalent.
See the Python sorting HOWTO for more information.
New answer for Python 3, I’d like to add two points:
- Use
str.casefoldfor case-insensitive comparisons. - Use the method directly instead of inside of a lambda.
That is:
var = ['ant','bat','cat','Bat','Lion','Goat','Cat','Ant']
var.sort(key=str.casefold)
(which sorts in-place) and now:
>>> var
['ant', 'Ant', 'bat', 'Bat', 'cat', 'Cat', 'Goat', 'Lion']
Or, to return a new list, use sorted
>>> var = ['ant','bat','cat','Bat','Lion','Goat','Cat','Ant']
>>> sorted(var, key=str.casefold)
['ant', 'Ant', 'bat', 'Bat', 'cat', 'Cat', 'Goat', 'Lion']
Why is this different from str.lower or str.upper? According to the documentation:
Casefolding is similar to lowercasing but more aggressive because it is intended to remove all case distinctions in a string. For example, the German lowercase letter
'ß'is equivalent to"ss". Since it is already lowercase,str.lower()would do nothing to'ß';casefold()converts it to"ss".
I need to add yet another answer, since both the accepted answer and the newer
versions lack one important thing:
The here proposed case-insensitive sorting is not stable in the ordering of
“equal” keys!
That means: When you have a mixture of mixed case strings that you want to sort,
you get a correctly sorted list, but it is undefined whether “AbC” comes before
“aBc” or after. This may even vary between runs of the same program.
In order to always have the same output with a stable default ordering of strings,
I use the following function:
sorted(var, key=lambda v: (v.casefold(), v))
This way, the original key is always appended as a fallback ordering when the
casefold version does not supply a difference to sort on.