Revision as of 19:19, 4 January 2007 edit Dmh~enwiki (talk \| contribs) 555 edits m Stub. There doesn't seem to be an entry for this. ← Previous edit		Revision as of 19:22, 4 January 2007 edit undo Angus Lepper (talk \| contribs) Rollbackers 4,154 edits m Tidied, also added link to big O notation as not all readers will have come across it. Lowercase N seems to be more standard than uppercase, but perhaps this is stylistic rather than anything. Next edit →
Line 1: In computing, a '''~~One~~one-pass algorithm''' is one which reads its input exactly once, in order, without [[Buffer\|buffering]]. A one-pass algorithm generally requires O(Nn) (see [[Big O Notation\|'big O' notation]]) time and less than O(Nn) storage (typically O(1)), where Nn is the size of the input. {{stub}}

One-pass algorithm: Difference between revisions