Created
November 13, 2022 08:40
-
-
Save naemazam/0d8c92ea695769e4bcd9f762a9d63bf7 to your computer and use it in GitHub Desktop.
This file contains bidirectional Unicode text that may be interpreted or compiled differently than what appears below. To review, open the file in an editor that reveals hidden Unicode characters.
Learn more about bidirectional Unicode characters
# Quick sort in Python | |
# function to find the partition position | |
def partition(array, low, high): | |
# choose the rightmost element as pivot | |
pivot = array[high] | |
# pointer for greater element | |
i = low - 1 | |
# traverse through all elements | |
# compare each element with pivot | |
for j in range(low, high): | |
if array[j] <= pivot: | |
# if element smaller than pivot is found | |
# swap it with the greater element pointed by i | |
i = i + 1 | |
# swapping element at i with element at j | |
(array[i], array[j]) = (array[j], array[i]) | |
# swap the pivot element with the greater element specified by i | |
(array[i + 1], array[high]) = (array[high], array[i + 1]) | |
# return the position from where partition is done | |
return i + 1 | |
# function to perform quicksort | |
def quickSort(array, low, high): | |
if low < high: | |
# find pivot element such that | |
# element smaller than pivot are on the left | |
# element greater than pivot are on the right | |
pi = partition(array, low, high) | |
# recursive call on the left of pivot | |
quickSort(array, low, pi - 1) | |
# recursive call on the right of pivot | |
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 in Ascending Order:') | |
print(data) |
Sign up for free
to join this conversation on GitHub.
Already have an account?
Sign in to comment