-
Notifications
You must be signed in to change notification settings - Fork 0
Expand file tree
/
Copy pathsorting.py
More file actions
54 lines (37 loc) · 1.07 KB
/
sorting.py
File metadata and controls
54 lines (37 loc) · 1.07 KB
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
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
'''Sorting is a common task in Python, and there are multiple ways to perform sorting operations depending on the data structure you're dealing with'''
'''built-in methods to sort lists either in-place or by creating a new sorted list.'''
#using sort()
numbers = [4,2,6,7,3]
numbers.sort()
print(numbers)
print('-'*20)
#descending order
numbers = [4,2,6,7,3,]
numbers.append(9)
print(numbers)
numbers.sort(reverse=True)
print(numbers)
print('-'*20)
'''Using sorted():
This function returns a new sorted list and leaves the original list unchanged.
'''
numbers = [6,7,4,6,9,3,2]
del numbers[3]
sorted_numbers = sorted(numbers)
print(sorted_numbers)
print(numbers)
#how can we reverse this sorted_numbers
sorted_numbers.sort(reverse=True)
print(sorted_numbers)
#fiding the index of element
print('-'*20)
numbers = [6,7,4,6,9,3,2]
print(numbers.index(4))
#count how many values or elements are there
numbers = [6,7,4,6,9,3,2]
print(numbers.count(4))
#joining two lists or extending list
numbers = [6,7,4,6,9,3,2]
name = ['adarsh','mani', 'yoga']
numbers.extend(name)
print(numbers)