Skip to content
New issue

Have a question about this project? Sign up for a free GitHub account to open an issue and contact its maintainers and the community.

By clicking “Sign up for GitHub”, you agree to our terms of service and privacy statement. We’ll occasionally send you account related emails.

Already on GitHub? Sign in to your account

Created bubble sort #2077

Open
wants to merge 1 commit into
base: master
Choose a base branch
from
Open
Changes from all commits
Commits
File filter

Filter by extension

Filter by extension

Conversations
Failed to load comments.
Loading
Jump to
Jump to file
Failed to load files.
Loading
Diff view
Diff view
20 changes: 20 additions & 0 deletions bubble sort
Original file line number Diff line number Diff line change
@@ -0,0 +1,20 @@
def bubble_sort_swaps(arr, ascending=True):
n = len(arr)
swaps = 0
for i in range(n):
for j in range(0, n-i-1):
if (ascending and arr[j] > arr[j+1]) or (not ascending and arr[j] < arr[j+1]):
arr[j], arr[j+1] = arr[j+1], arr[j] # Swap
swaps += 1
return swaps

# Input reading
N = int(input()) # Number of elements
arr = list(map(int, input().split())) # Array elements

# Count swaps for both ascending and descending order
ascending_swaps = bubble_sort_swaps(arr.copy(), ascending=True)
descending_swaps = bubble_sort_swaps(arr.copy(), ascending=False)

# Output the minimum number of swaps
print(min(ascending_swaps, descending_swaps))