Question: 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.
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 efficient and space efficient. (Hint: use the partition idea similar to that of Quicksort)
Step by Step Solution
There are 3 Steps involved in it
Get step-by-step solutions from verified subject matter experts
