$8\mathrm{.}3\mathrm{.}5$: Worst$-$case time complexity $-$ mystery algorithm.

help$\_$outline

The algorithm below makes some changes to an input sequence of numbers.

MysteryAlgorithm

Input: a$1,$a$2,...,$an

$$ n$,$ the length of the sequence.

$$ p$,$ a number.

Output: $??$

i:$=1$

j:$=$n

While $($i