?Algorithm complexity. Is average case of O((n-1)/4) more or less efficient then an average case of O(n/2)? Explain why or what not.

What is the following algorithms order or growth?

Algorithm NegBeforePos(A[0.n - 1]) //Puts negative elements before positive (and zeros, if any) in an array //Input: Array A[0..n - 1] of real numbers //Output: Array A[0.n -1] in which all its negative elements precede nonnegative while i s j do i