tag:blogger.com,1999:blog-32064785.post2771936710188639223..comments2024-03-28T17:06:30.318+05:30Comments on Freshers Interviews: Interview questions on Sorting - Quick Sortchaitanyahttp://www.blogger.com/profile/05855949584266440305noreply@blogger.comBlogger1125tag:blogger.com,1999:blog-32064785.post-10737967663513570882008-12-04T18:14:00.000+05:302008-12-04T18:14:00.000+05:30Suppose we have an array of N elements containing ...Suppose we have an array of N elements containing three distinctive keys, true, false and maybe. Give an O(N) algorithm to rearrange the list so that all false elements precede maybe elements, which in turn precede true elements. You may only use constant extra space.Anonymousnoreply@blogger.com