-
Notifications
You must be signed in to change notification settings - Fork 0
/
sort.py
55 lines (48 loc) · 1.42 KB
/
sort.py
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
55
""" REMOVE DUPLICATES FROM LIST AND SORT IN ASCENDING AND
DESCENDING ORDER WITHOUT USING INBUILT FUNCTIONS """
def input_list():
"""
This function takes size of list and input the values
as size is inputed
- returns -> list
"""
size = int(input("Enter size of list : "))
return list(int(input()) for i in range(size))
def get_unique_list(lst):
"""
This function return list of ubique elements
- returns -> list
"""
return list(set(lst))
def sort_list_in_ascending(lst):
"""
This function sort the list in ascending order
- Arguments :
- lst -> list of elements which we want to sort
- returns:
- lst -> sorted list
"""
for i in range(len(lst)):
def swap_element_in_list(j):
if lst[i] < lst[j]:
lst[i],lst[j] = lst[j],lst[i]
x = map(swap_element_in_list,range(len(lst)))
return lst
def sort_list_in_descending(lst):
"""
This function sort the list in descending order
- Arguments :
- lst -> list of elements which we want to sort
- returns:
- lst -> sorted list
"""
return lst[::-1]
def main():
"""
Execution of program starts from here
"""
lst = input_list()
print(sort_list_in_ascending(get_unique_list(lst)))
print(sort_list_in_descending(sort_list_in_ascending(get_unique_list(lst))))
if __name__ == "__main__":
main()