"quantum bogosort" meaning in English

{
  "head_templates": [
    {
      "args": {
        "1": "-"
      },
      "expansion": "quantum bogosort (uncountable)",
      "name": "en-noun"
    }
  ],
  "lang": "English",
  "lang_code": "en",
  "pos": "noun",
  "senses": [
    {
      "categories": [
        {
          "kind": "other",
          "name": "English entries with incorrect language header",
          "parents": [
            "Entries with incorrect language header",
            "Entry maintenance"
          ],
          "source": "w"
        },
        {
          "kind": "topical",
          "langcode": "en",
          "name": "Computing",
          "orig": "en:Computing",
          "parents": [
            "Technology",
            "All topics",
            "Fundamental"
          ],
          "source": "w"
        },
        {
          "kind": "topical",
          "langcode": "en",
          "name": "Sorting algorithms",
          "orig": "en:Sorting algorithms",
          "parents": [
            "Theory of computing",
            "Computer science",
            "Computing",
            "Sciences",
            "Technology",
            "All topics",
            "Fundamental"
          ],
          "source": "w"
        }
      ],
      "examples": [
        {
          "text": "Implementing quantum bogosort increased my script's performance by 50%, but I still feel a little bit guilty about my computer killing quadrillions of sentient beings a second.",
          "type": "example"
        },
        {
          "ref": "2007 January 22, Logan Kearsley, “How the mind plays tricks.”, in rec.arts.sf.composition (Usenet)",
          "text": "And from that we can conclude that in some parallel worlds, a machine to implement the Quantum Bogosort (theoretically the fastest possible sorting algorithm) has been invented.",
          "type": "quotation"
        },
        {
          "ref": "2009 October 2, Tim Rentsch, “Selection-Sort in C”, in comp.lang.c (Usenet)",
          "text": "Even quantum-bogosort can't keep up with Intelligent Design Sort. ¶ (IDS makes no changes to its input, on the theory that \"they are already sorted according to a higher purpose.\")",
          "type": "quotation"
        },
        {
          "ref": "2011 November 4, Dr J R Stockton, “sorting columns”, in comp.lang.javascript (Usenet)",
          "text": "ECMA 5 lacks support for the speedy Quantum Bogosort.",
          "type": "quotation"
        }
      ],
      "glosses": [
        "A hypothetical sorting algorithm which generates a random permutation of its input (like in bogosort) using a quantum source of entropy, checks if the list is sorted, and, if it is not, destroys the universe. Assuming that the many-worlds interpretation of quantum mechanics is true, this algorithm will result in at least one surviving universe where the input was successfully sorted in O(n) time (thus making it faster than quicksort)."
      ],
      "id": "en-quantum_bogosort-en-noun-KqW61~8Y",
      "links": [
        [
          "computing",
          "computing#Noun"
        ],
        [
          "humorous",
          "humorous"
        ],
        [
          "sorting",
          "sorting#Noun"
        ],
        [
          "algorithm",
          "algorithm#Noun"
        ],
        [
          "bogosort",
          "bogosort#Noun"
        ],
        [
          "quantum",
          "quantum#Noun"
        ],
        [
          "entropy",
          "entropy#Noun"
        ],
        [
          "universe",
          "universe#Noun"
        ],
        [
          "many-worlds interpretation",
          "many-worlds interpretation#Noun"
        ],
        [
          "quantum mechanics",
          "quantum mechanics#Noun"
        ],
        [
          "quicksort",
          "quicksort#Noun"
        ]
      ],
      "raw_glosses": [
        "(computing, humorous) A hypothetical sorting algorithm which generates a random permutation of its input (like in bogosort) using a quantum source of entropy, checks if the list is sorted, and, if it is not, destroys the universe. Assuming that the many-worlds interpretation of quantum mechanics is true, this algorithm will result in at least one surviving universe where the input was successfully sorted in O(n) time (thus making it faster than quicksort)."
      ],
      "tags": [
        "humorous",
        "uncountable"
      ],
      "topics": [
        "computing",
        "engineering",
        "mathematics",
        "natural-sciences",
        "physical-sciences",
        "sciences"
      ]
    }
  ],
  "word": "quantum bogosort"
}

{
  "head_templates": [
    {
      "args": {
        "1": "-"
      },
      "expansion": "quantum bogosort (uncountable)",
      "name": "en-noun"
    }
  ],
  "lang": "English",
  "lang_code": "en",
  "pos": "noun",
  "senses": [
    {
      "categories": [
        "English entries with incorrect language header",
        "English humorous terms",
        "English lemmas",
        "English multiword terms",
        "English nouns",
        "English terms with quotations",
        "English terms with usage examples",
        "English uncountable nouns",
        "en:Computing",
        "en:Sorting algorithms"
      ],
      "examples": [
        {
          "text": "Implementing quantum bogosort increased my script's performance by 50%, but I still feel a little bit guilty about my computer killing quadrillions of sentient beings a second.",
          "type": "example"
        },
        {
          "ref": "2007 January 22, Logan Kearsley, “How the mind plays tricks.”, in rec.arts.sf.composition (Usenet)",
          "text": "And from that we can conclude that in some parallel worlds, a machine to implement the Quantum Bogosort (theoretically the fastest possible sorting algorithm) has been invented.",
          "type": "quotation"
        },
        {
          "ref": "2009 October 2, Tim Rentsch, “Selection-Sort in C”, in comp.lang.c (Usenet)",
          "text": "Even quantum-bogosort can't keep up with Intelligent Design Sort. ¶ (IDS makes no changes to its input, on the theory that \"they are already sorted according to a higher purpose.\")",
          "type": "quotation"
        },
        {
          "ref": "2011 November 4, Dr J R Stockton, “sorting columns”, in comp.lang.javascript (Usenet)",
          "text": "ECMA 5 lacks support for the speedy Quantum Bogosort.",
          "type": "quotation"
        }
      ],
      "glosses": [
        "A hypothetical sorting algorithm which generates a random permutation of its input (like in bogosort) using a quantum source of entropy, checks if the list is sorted, and, if it is not, destroys the universe. Assuming that the many-worlds interpretation of quantum mechanics is true, this algorithm will result in at least one surviving universe where the input was successfully sorted in O(n) time (thus making it faster than quicksort)."
      ],
      "links": [
        [
          "computing",
          "computing#Noun"
        ],
        [
          "humorous",
          "humorous"
        ],
        [
          "sorting",
          "sorting#Noun"
        ],
        [
          "algorithm",
          "algorithm#Noun"
        ],
        [
          "bogosort",
          "bogosort#Noun"
        ],
        [
          "quantum",
          "quantum#Noun"
        ],
        [
          "entropy",
          "entropy#Noun"
        ],
        [
          "universe",
          "universe#Noun"
        ],
        [
          "many-worlds interpretation",
          "many-worlds interpretation#Noun"
        ],
        [
          "quantum mechanics",
          "quantum mechanics#Noun"
        ],
        [
          "quicksort",
          "quicksort#Noun"
        ]
      ],
      "raw_glosses": [
        "(computing, humorous) A hypothetical sorting algorithm which generates a random permutation of its input (like in bogosort) using a quantum source of entropy, checks if the list is sorted, and, if it is not, destroys the universe. Assuming that the many-worlds interpretation of quantum mechanics is true, this algorithm will result in at least one surviving universe where the input was successfully sorted in O(n) time (thus making it faster than quicksort)."
      ],
      "tags": [
        "humorous",
        "uncountable"
      ],
      "topics": [
        "computing",
        "engineering",
        "mathematics",
        "natural-sciences",
        "physical-sciences",
        "sciences"
      ]
    }
  ],
  "word": "quantum bogosort"
}