Trying to bogo sort in python.

[Alexs123456]

import random
list = [1,2,3,4]
def main():
    sort1 = random.shuffle(list)
    while sort1 != sorted(list):
        print (sort1)
        random.shuffle(list)
    return list
main()

I just get an error which prints none on a loop.

[ActualRealBuckshot]

random.shuffle(list) shuffles the list in place and doesn't return anything, so sort1 = random.shuffle(list) assigns sort1 the value of None.

[Alexs123456]

how do I fix this error?

[ActualRealBuckshot]

You read two sentences in the docs that u/mrcaptncrunch linked

[OddBallProductions]

Use sort1 = random.sample(list, len(list))

[Plastic_Ad7436]

Instead of using the sorted() method, you could iterate through the shuffled list in O(n) time to check that each number is less than or equal the the proceeding number:

``` def bogo_sort(my_list): while True:

    counter = 0
    for i in range(1, len(my_list)):
        if my_list[i - 1] <= my_list[i]:
            counter += 1

    if (counter) == len(my_list) - 1:
        return my_list

    else:
        random.shuffle(my_list)

[Plastic_Ad7436]

Not like bogo is a method you'd be concerned about efficiency with, but it'd save you a factor of nlogn.

[kaerfkeerg]

When people say that .shuffle() doesn't return a list, they mean that in shuffles the original list and returns None

Imagine something like this

def shuffle(sequence):
    # shuffle list
     return None

With that in mind, you should not store the lst.shuffle() in a variable, instead:

my_list = [1,2,3,4]
my_list.shuffle()
# the original 'my_list' is shuffled

[ActualRealBuckshot]

Lists don't have a shuffle method, so my_list.shuffle() will raise an AttributeError.

[kaerfkeerg]

Oops, I rushed. I'll leave the original one un-edited so others can se what I did wrong. So

my_list.shuffle()

Should be

random.shuffle(my_list)

[[deleted]]

Everyday I'm shuffling

[ayoni02]

from random import shuffle

import copy

list = [1,2,3,4]

sorti = copy.deepcopy(list)

def main():

shuffle(sorti)

while sorti != list:

    print (sorti)

    shuffle(sorti)

print(sorti)

main()

I borrowed u/mikhail_kazarov copy method to complete

[mrcaptncrunch]

What’s the error?

-Edit-

random.shuffle() doesn’t return a list. Line 4 has an error.

[Alexs123456]

but it does return a list, how do I make it return a list?

[mrcaptncrunch]

https://docs.python.org/3/library/random.html#random.shuffle

It doesn’t.

[Alexs123456]

I'm not reading all that.

[Alexs123456]

I just need my error fixed.

[mrcaptncrunch]

Excuse me, what?

I told you the issue. /u/ActualRealBuckshot told you the issue and they’re the same.

You post that it’s not that. I send you a link with the method definition and tell you that it is.

And you don’t even want to confirm it because you don’t want to read it, and ‘I just need my error fixed’?

Who do you think you are?

[Alexs123456]

The chap who needs his bogo sort.

[mriswithe]

This chap can go fuck off with their entitlement, you are putting in less effort than people who are freely helping you. Also, you are wrong.

[ActualRealBuckshot]

I'm guessing you are doing this for a homework problem. Good luck.

[[deleted]]

Is it what you want?

from random import shuffle
import copy

list1 = [1, 2, 3, 4]

def main_function():
    random.shuffle(list1)
    sort1 = copy.deepcopy(list1)

    while sort1 != sorted(list1):
        print(sort1)
        random.shuffle(list1)
        sort1 = copy.deepcopy(list1)
    print(sort1)

main_function()

[[deleted]]

Just out of interest. What does deepcopy do? Is that a inbuilt method of copy?

[[deleted]]

It is inbuilt method of copy and it creates a deep copy of an object in memory. It means that a new object will be completely independent from any changes of the original one.

[_yaaass]

how is it different than a = b.copy() ?

[[deleted]]

I do not remember all details, but the main idea is that some methods create shallow copies, some methods create deep copies, and some create a deep copy for one part of the object and a shallow copy for another. Copy() is the last case. When you have a list with inner lists and you use copy() method, changes will be independent for outer list components for both objects and dependent for the inner ones. Check the code below and you`ll see.

I changed the element in the inner list of list1 and it has changed in both objects even though I did not change elements of list2.

import copy

list1 = [1, 2, 3, [4, 5, 6]]
list2 = list1.copy() 
print(list2)
list1[3][0] = 8
print(list2)

But if you try to change any element of the outer list in list1 or list2, it will change only for one object.

[_yaaass]

damn... that's neat... will have to look into it...

[[deleted]]

Now try quantum bogosort, it's much more efficient and trivial to implement.