Question: Consider an array containing n real numbers. Design an algorithm that will place all the negative numbers to the left of all the non-negative numbers.
Consider an array containing n real numbers. Design an algorithm that will place all the negative numbers to the left of all the non-negative numbers. Your algorithm should be in place and have a complexity of (n). You should not assume that the array contains a zero. On the other hand, it may contain many zeroes. Hint: think carefully about Hoare's partition works and see if you can modify it for your needs. You may recall that Hoare's partition was the algorithm we learned when studying quicksort
Step by Step Solution
There are 3 Steps involved in it
Get step-by-step solutions from verified subject matter experts
