Skip to content

Commit

Permalink
Create quicksort.py
Browse files Browse the repository at this point in the history
Signed-off-by: Akash <[email protected]>
  • Loading branch information
Akash1437 committed Oct 17, 2022
1 parent 778e78d commit 61bb047
Showing 1 changed file with 33 additions and 0 deletions.
33 changes: 33 additions & 0 deletions quicksort.py
Original file line number Diff line number Diff line change
@@ -0,0 +1,33 @@
def partition(array,low,high):

pivot= array[high]

i=low-1

for j in range(low,high):
if array[j] <= pivot:

i=i+1
(array[i],array[j]) = (array[high],array[i+1])

return i+1
def quickSort(array,low,high):
if low<high:

pi = partition(array,low,pi-1)

quickSort(array,low,pi - 1)

quickSort(array,pi+1,high)

data=[8,7,2,1,0,9,6]
print("Unsorted Array)
print(data)

size =len(data)

quickSort(data,0,size-1)
print('sorted array is')
print(data)


0 comments on commit 61bb047

Please sign in to comment.