what is the basic operation of the following algorithm?. also what is the mathematical aggregate function? for the aggregate function i mean if it's for loop we will compute it mathematically using the summation. what about this case? please show the aggregate function step by step

Algorithm(A[0n-1]):

i ? 0

j ? n - 1

while i ? j:

if A[i] < 0:

i ? i + 1

else:

swap(A[i], A[j])

j ? j - 1