Question: (i) Suppose you have an array of n elements containing only two distinct keys, true and false . Give an O ( n ) algorithm
(i) Suppose you have an array of n elements containing only two distinct keys, true and false . Give an O ( n ) algorithm to rearrange the list so that all false elements precede the true elements. You m ay use only constant extra space.
(ii) Suppose you have an array of n elements containing three distinct keys, true , false , and maybe . Give an O ( n ) algorithm to rearrange the list so that all false elements precede the maybe elements, which in turn precede all true elements. You may use only constant extra space.
Step by Step Solution
There are 3 Steps involved in it
Get step-by-step solutions from verified subject matter experts
