Liste de tri Python en inverse
#1 Changes list
list.sort(reverse=True)
#2 Returns sorted list
sorted(list, reverse=True)
MitroGr
#1 Changes list
list.sort(reverse=True)
#2 Returns sorted list
sorted(list, reverse=True)words = ["apple","pear","red"]
numbers = [4,2,7,5]
#Parameters:
#key: changes how it sorts the list, For Example: letters.sort(key=len) Sorts by length
#Reverse: Default: sorts in ascending order, if Reverse is True: sorts descending order
words.sort(key=len)
>["red","pear","apple"]
numbers.sort(reverse=True)
>[7,5,4,2]
#sort: changes the list so it is sorted
#sorted: returns the sorted list>>> student_tuples = [
... ('john', 'A', 15),
... ('jane', 'B', 12),
... ('dave', 'B', 10),
... ]
>>> sorted(student_tuples, key=lambda student: student[2]) # sort by age
[('dave', 'B', 10), ('jane', 'B', 12), ('john', 'A', 15)]
a=[2,2,4,1]
b=a
a.sort()
// a now points to object [1,2,2,4]
c=sorted(b)
//c and b also points to [1,2,2,4]
// sort works on array only but sorted also on strings but return array of char
s="sjndk"
print(sorted(s))
// prints ['d', 'j', 'k', 'n', 's']
// sorted also works on list of strings(sorts alphabetically)a=[1,6,10,2,50,69,3]
print(sorted(a))data_list = [-5, -23, 5, 0, 23, -6, 23, 67]
new_list = []
while data_list:
minimum = data_list[0] # arbitrary number in list
for x in data_list:
if x < minimum:
minimum = x
new_list.append(minimum)
data_list.remove(minimum)
print new_list