Wikipedia:Articles for deletion/Twin sort algorithm

Twin sort algorithm

[Hide this box] New to Articles for deletion (AfD)? Read these primers!

(Find sources: Google (books · news · scholar · free images · WP refs) · FENS · JSTOR · TWL)

I'm not at all clear why this is notable It seems to be intended only to promote the recent research of Devireddy, with no indication why anyone else should care Jimfbleak - talk to me? 05:34, 4 June 2019 (UTC)[reply]

Note: This discussion has been included in the list of Computing-related deletion discussions. 94rain ^Talk 05:36, 4 June 2019 (UTC)[reply]

Delete. When the only source that's not just standard references for background material is a journal on Beall's list, you know it's worse than merely non-notable research. —David Eppstein (talk) 05:48, 4 June 2019 (UTC)[reply]
Delete. I'm willing to reconsider if anyone can show that this work receives attention by professionals in the field, however as a programmer I am pretty sure that is not going to happen. If I understood the paper correctly, this algorithm is already known as Odd–even sort. I also believe there is a severe error in the paper. An algorithm with (n-1)*(n/2) performance is not O(NlogN), it is O(N^2). Our article on Big O notation explains that. For large list sizes any O(N^2) algorithm will have catastrophically slow runtime on any standard computer. On massively parallel hardware it can have a runtime of N, but this is already standard knowledge in the field of parallel-sorting algorithms. Alsee (talk) 15:23, 4 June 2019 (UTC)[reply]