Apply quicksort to sort the list W, E, L, C, O, M, E

Is quicksort a stable sorting algorithm?

Design an algorithm to rearrange elements of a given array of n real numbers so that all its negative elements precede all its positive elements. Your algorithm should be both time- and space-efficient