Skip to content
This repository was archived by the owner on Jan 13, 2022. It is now read-only.
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
19 changes: 19 additions & 0 deletions Python/sort.py
Original file line number Diff line number Diff line change
@@ -0,0 +1,19 @@
def bubbleSort(arr):
n = len(arr)

# Traverse through all array elements
for i in range(n-1):
for j in range(0, n-i-1):

# Traverse the array from 0 to n-i-1 and swap the element if greater than next element
if arr[j] > arr[j + 1] :
arr[j], arr[j + 1] = arr[j + 1], arr[j]

# Driver code to test the algorithm
arr = [31, 74, 15, 6, 30, 13, 98]

bubbleSort(arr)

print ("Sorted array:")
for i in range(len(arr)):
print ("% d" % arr[i])