Welcome to collectivesolver - Programming & Software Q&A with code examples. A website with trusted programming answers. All programs are tested and work.

Contact: aviboots(AT)netvision.net.il

Buy a domain name - Register cheap domain names from $0.99 - Namecheap

Scalable Hosting That Grows With You

Secure & Reliable Web Hosting, Free Domain, Free SSL, 1-Click WordPress Install, Expert 24/7 Support

Semrush - keyword research tool

Boost your online presence with premium web hosting and servers

Disclosure: My content contains affiliate links.

39,872 questions

51,796 answers

573 users

How to implement the bubble sort algorithm in Python

1 Answer

0 votes
def swap(arr, i, j):
    temp = arr[i]
    arr[i] = arr[j]
    arr[j] = temp
 
def bubbleSort(arr):
    lenn = len(arr);
    for i in range(lenn - 1):
        for j in range(lenn - 1 - i):
            if arr[j] > arr[j + 1]:
                swap(arr, j, j + 1)

arr = [8, 2, 9, 0, 4, -3, 7, 5]
 
bubbleSort(arr)
 
print(arr)




'''
run:

[-3, 0, 2, 4, 5, 7, 8, 9]

'''

 



answered Jul 5, 2022 by avibootz

Related questions

1 answer 101 views
1 answer 56 views
1 answer 70 views
1 answer 83 views
1 answer 85 views
1 answer 182 views
1 answer 186 views
...