Yeah, stupid autocorrect. And verifying ain’t the same as doing. I’ll come in, I’ll “sort” your data, and I’ll do it damn fast. You want verification that’s extra!
but how do you know you are done. maybe there are different ideas of what bogo sort is, but as i remember, it is basically a while true (or while false loop) with condition - while list_is_not_sorted { return_a_random_ordering }
Yeah, as it is it only works if the brute force algorithm gets it on the first try.
Not even then. Brute force cracking programs don’t rely on the server to indicate if the attempted password is correct.
Boho sort is O(1) in the best case scenario
i guess you mean bogo sort? just verifying that output is sorted requires O(n). In Quantum bogo sort, you can skip verification.
Yeah, stupid autocorrect. And verifying ain’t the same as doing. I’ll come in, I’ll “sort” your data, and I’ll do it damn fast. You want verification that’s extra!
but how do you know you are done. maybe there are different ideas of what bogo sort is, but as i remember, it is basically a while true (or while false loop) with condition - while list_is_not_sorted { return_a_random_ordering }
Yeah but I said in the best case. In the best case, your randomization is correct so you don’t need to check it
No, it just means you have to type in the correct password twice in a row.