Question: (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

 (i) Suppose you have an array of n elements containing only

(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 may use only constant extra space. (ii) Suppose you have an array of n elements containing three distinct keys, true, false, and 4. 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

1 Expert Approved Answer
Step: 1 Unlock blur-text-image
Question Has Been Solved by an Expert!

Get step-by-step solutions from verified subject matter experts

Step: 2 Unlock
Step: 3 Unlock

Students Have Also Explored These Related Databases Questions!