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

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
Step by Step Solution
There are 3 Steps involved in it
Get step-by-step solutions from verified subject matter experts
