Spaghetti sort: Difference between revisions

Revision as of 13:13, 7 January 2016

Revision as of 14:41, 30 January 2016

Line 1:

{{multiple issues|

{{confusing|date=July 2013}}

}}

'''Spaghetti sort''' is a [[linear-time]], [[analog computer|analog]] [[algorithm]] for sorting a sequence of items, by [[Alexander Dewdney]] in his column, ''[[Scientific American]]''.<ref>{{Citation

Line 29 ⟶ 27:

| date = July 1, 2006

| page = 96

| isbn = 0-9551170-9-7}}</ref> This algorithm sorts a sequence of items requiring O(''n'') stack space{{cncitation needed|date=April 2015}} in a stable manner. It requires a parallel processor.{{cncitation needed|date=April 2015}}

==Algorithm==