TADM2E 4.20

From Algorithm Wiki
Revision as of 12:30, 23 January 2017 by Heesub (Talk | contribs)

(diff) ← Older revision | Latest revision (diff) | Newer revision → (diff)
Jump to: navigation, search

If you partition the array with pivoting 0, all negative values appear before all other positive values. This can be done in linear time, O(n).