Revision as of 21:54, 28 October 2004 edit Dcoetzee (talk \| contribs) 37,529 edits m →Using data structures to select in sublinear time: -as well ← Previous edit		Revision as of 21:55, 28 October 2004 edit undo Dcoetzee (talk \| contribs) 37,529 edits m →Linear minimum/maximum algorithms: Fix loop index Next edit →
Line 11: minIndex := 1 minValue := a[1] '''for''' i '''from''' 12 '''to''' n '''if''' a[i] < minValue minIndex := i

Selection algorithm: Difference between revisions