Question: a. Given an array of n integers each is either -1, 0 or 1. How to sort them in O(n) time in the worst case.
a. Given an array of n integers each is either -1, 0 or 1. How to sort them in O(n) time in the worst case.
b. Write an algorithm to sort 5 elements with 7 comparisons.
Step by Step Solution
There are 3 Steps involved in it
Get step-by-step solutions from verified subject matter experts
