Revision as of 17:51, 22 June 2020 edit MrOllie (talk \| contribs) Extended confirmed users, Pending changes reviewers, Rollbackers 255,501 edits →Average Case vs Expected Runtime for Bogosort ← Previous edit		Revision as of 17:51, 22 June 2020 edit undo MrOllie (talk \| contribs) Extended confirmed users, Pending changes reviewers, Rollbackers 255,501 edits →Average Case vs Expected Runtime for Bogosort Next edit →
Line 1,115: Even worse, saying that the worst-case runtime of bogosort is infinite is at best misleading. That is because there is really no concept in which infinite would be a meaningful runtime for bogosort. I would accept using the phrase 'certainly unbounded', meaning assuming that there is no randomess, the runtime is not bounded by any function depening on the input. Even saying that the runtime is unbounded (without using the word certainly) is misleading as the probability for unbounded runtime is 0 and even the expected runtime is at most n x !n. I would therefore ask to redo my change to fit more with the given source (which uses the same semantics) and with the current research. --[[User:PhoenixIra\|PhoenixIra]] ([[User talk:PhoenixIra\|talk]]) 17:25, 22 June 2020 (UTC) :Worst case is commonly meant to be the ~~worse~~worst possible case, which is unbounded for bogosort. At any rate, we follow the sources, and your addition (and the matching addition at [[Bogosort]] was unsourced. Cite a reputable source and interprets the worst case behavior as you are and perhaps we can use it. - [[User:MrOllie\|MrOllie]] ([[User talk:MrOllie\|talk]]) 17:51, 22 June 2020 (UTC)

Talk:Sorting algorithm: Difference between revisions