Hobo Sort

In computer science, Hobo Sort is a search algorithm (much like Bubble Sort, Merge Sort or Quick Sort) that applies a random and blind search of any arbitrarily sized dataset. Much like a drunken hobo rummaging through a dumpster, search is extremely inefficient, there is no set methodology in search, previously search items may end up being searched again, and search results are not always guaranteed. Additionally, the search algorithm may also fail due to drunkenness, drugs, or other impairment-inducing events.

You're algorithm is less efficient than Hobo Sort! Stupid 1st year!

5👍 1👎