Wikipedia:Articles for deletion/In-Place Count Sort


 * The following discussion is an archived debate of the proposed deletion of the article below. Please do not modify it. Subsequent comments should be made on the appropriate discussion page (such as the article's talk page or in a deletion review).  No further edits should be made to this page.

The result was delete--Ymblanter (talk) 07:45, 1 October 2014 (UTC)

In-Place Count Sort

 * – ( View AfD View log  Stats )

Utter bunk; probably a hoax. The "sorting algorithm" presented here is just an obfuscated way of doing

for i from 0 to n: a[i] = i

No wonder there are no references. Q VVERTYVS (hm?) 23:11, 23 September 2014 (UTC)
 * Note: This debate has been included in the list of Computing-related deletion discussions.  Jinkinson   talk to me  23:59, 23 September 2014 (UTC)


 * Delete&mdash;I found one unverifiable cite in google books and no hits in google scholar. Ghits are also sparse.  Not enough WP:RS to establish notability.  Lesser Cartographies (talk) 18:44, 24 September 2014 (UTC)
 * Delete for lack of reliable sources.-- danntm T C 20:35, 24 September 2014 (UTC)
 * Delete. This appears to be intended as an algorithm for in-place permutation, a problem with some history of actual research behind it (see ). But I don't think there's anything worth saving in the current article. —David Eppstein (talk) 01:50, 28 September 2014 (UTC)
 * Delete as hoax. Stuartyeates (talk) 08:05, 29 September 2014 (UTC)
 * Delete I suppose that it could be used as a simple example in In-place algorithm. I don't believe there are any research articles on it because it is of no practical or theoretical value. int i must equal the minimum integer in a sequence and the sequence must contain all of the integers between the minimum and maximum integers in a sequence with no repeats, otherwise the algorithm enters an infinite loop or an array out of bounds. I am One of Many (talk) 05:49, 30 September 2014 (UTC)
 * The above discussion is preserved as an archive of the debate. Please do not modify it. Subsequent comments should be made on the appropriate discussion page (such as the article's talk page or in a deletion review). No further edits should be made to this page.