We read every piece of feedback, and take your input very seriously.
To see all available qualifiers, see our documentation.
There was an error while loading. Please reload this page.
2 parents 42d2138 + e5b0537 commit 9620e59Copy full SHA for 9620e59
Sorting Algorithims/Bubble_sort.py
@@ -1,9 +1,9 @@
1
-def bubble_sort(nums):
2
- for i in range(len(nums)):
3
- for j in range(len(nums)-1):
+def bubble_sort(Lists):
+ for i in range(len(Lists)):
+ for j in range(len(Lists)-1):
4
# We check whether the adjecent number is greater or not
5
- if nums[j]>nums[j+1]:
6
- nums[j], nums[j+1] = nums[j+1], nums[j]
+ if Lists[j]>Lists[j+1]:
+ Lists[j], Lists[j+1] = Lists[j+1], Lists[j]
7
8
#Lets the user enter values of an array and verify by himself/herself
9
array = []
0 commit comments