Difference between revisions of "TADM2E 4.20"
From Algorithm Wiki
(Created page with "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).") |
|||
| Line 1: | Line 1: | ||
| − | 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). | + | If you partition the array with pivoting 0, all negative values appear before all other positive values. This can be done in linear time, <math>O(n)</math>. |
Latest revision as of 12:46, 23 January 2017
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) $.
