Sorting: Ep 11 - Bogosort

No description available.

Category:

Education

Tags:

• sort
• sorting
• algo
• algorithm
• bogosort
• bogo
• computer
• computing

[babybenson]

i've finished the whole sorting series even some are not in my studies syllabus. i got to say, u made thing easy, and your voice is so sexy. haha...sincere.

[lcc0612]

@babybenson

lol thank you so much!

[callrakkha]

thanks for the tutorials!

[lcc0612]

@callrakkha

You're welcome! Glad you found them useful =)

[hohoyun]

thanks for your sorting series man, youtube is a great place to learn stuff

[lcc0612]

@hohoyun

Cheers! I'm glad I could be of a help!

[lcc0612]

@ffmaer

Thanks for your comment! I'm glad I was helpful.

[ffmaer]

Thank you for your sorting series...it helps my data structure class~

[lcc0612]

Hmm... Well, I don't claim to be an expert, but...

"If the randomgenerator is perfect! It will then definitly determinate!"

- The question is *when*. We know it'll eventually be correct, but we can't tell when that is. Since the Big O Notation considers the limit of the algorithm, and since there is absolutely no telling when the algorithm may complete, it becomes an O(infinity) algorithm.

[mmuuuuhh]

bogosort does NOT! need infinity... If the randomgenerator is perfect! It will then definitly determinate!

The problem is, that there is no perfect randomgenerator, so it might end in infinity... So the question of the Big O Notation is a question of the right randomgenerator, not of the bogosort...