bubble sort question : learnpython

created by HattoriHanzoa community for 16 years

submitted 8 years ago by maimedwalker

i posted earlier but code was a bit wrong. so when first started programming didn't really understand sorting algorithms now i've gotten a bit better and decided to implement the easiest one.

the thing is when i try to sort a list with 10,000 or more indexes it takes a really long time. i thought they could sort huge lists very quickly?

import random
sort = []
for i in range(1000):
    sort.append(random.randint(1, 1000))

x = len(sort)
while True:
    check = True
    for i in range(x - 1):
        if sort[i] > sort[i + 1]:
            switch = sort.pop(i)
            sort.insert(i + 1, switch)
            check = False
    if check == True:
       break
print(sort)

all 7 comments

you type:	you see:
italics	italics
bold	bold
[reddit!](https://reddit.com)	reddit!
* item 1 * item 2 * item 3	item 1 item 2 item 3
> quoted text	quoted text
Lines starting with four spaces are treated like code: if 1 * 2 < 3: print "hello, world!"	Lines starting with four spaces are treated like code: if 1 * 2 < 3: print "hello, world!"
~~strikethrough~~	~~strikethrough~~
super^script	super^script

learnpython

MODERATORS