added bogosort algorithem

[mendlero]

added bogosort algorithem

[appgurueu]

• The Fisher-Yates shuffle and isSorted should get their own files (and tests); they are much more useful than bogosort. This will trivialize the bogosort.
• Don't use var, use let and const instead.
• The complexity analysis is wrong. The best case complexity is O(n), since a single isSorted check takes O(n). The (expected) average complexity is not "unbounded"; yes, it can in theory fail to find the correct permutation infinitely often, but the probability for that is 0: Each iteration has a probability of 1/n! of succeeding. You obtain an expected O(n!n) time complexity using the geometric distribution since each iteration takes O(n) time.
• You need to add tests. Please try to do this without simply duplicating tests.

[mendlero]

• The Fisher-Yates shuffle and isSorted should get their own files (and tests); they are much more useful than bogosort. This will trivialize the bogosort.
• Don't use var, use let and const instead.
• The complexity analysis is wrong. The best case complexity is O(n), since a single isSorted check takes O(n). The (expected) average complexity is not "unbounded"; yes, it can in theory fail to find the correct permutation infinitely often, but the probability for that is 0: Each iteration has a probability of 1/n! of succeeding. You obtain an expected O(n!n) time complexity using the geometric distribution since each iteration takes O(n) time.
• You need to add tests. Please try to do this without simply duplicating tests.

Thanks for reviewing so quickly, I refactored the code, added tests and change the time complexity in the latest commits.