forked from codehouseindia/Python-Programs
- Notifications
You must be signed in to change notification settings - Fork 0
Expand file tree
/
Copy pathQuickSort.py
More file actions
Latest commit
38 lines (30 loc) · 824 Bytes
/
Copy pathQuickSort.py
File metadata and controls
38 lines (30 loc) · 824 Bytes
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
# quick sorting of list input by user
defquickSort(list4,start,end):
ifstart>=end:
return
pivot=end-1
pivot=changePivot(list4,start,pivot)
quickSort(list4,start,pivot)
quickSort(list4,pivot+1,end)
returnlist4
# function to change the pivot
defchangePivot(list4, start, pivot):
j=start
foriinrange(start,pivot):
iflist4[i]<list4[pivot]:
swap(list4,i,j)
j=j+1
swap(list4,j,pivot)
returnj
# swaping of two elements
defswap(list2,i,j):
temp=list2[i]
list2[i]=list2[j]
list2[j]=temp
# input by user
n=int(input("Enter number of elemenys in list\n"))
list1=[]
foriinrange(n):
elem=int(input())
list1.append(elem)
print("List after quick sorting: ",quickSort(list1,0,len(list1))) # function call