Question: Please help with the question below. Thanks. 13. Write an algorithm that sorts a list of n items by dividing it into three subsists of

13. Write an algorithm that sorts a list of n items by dividing it into three subsists of about n/3 items, sorting each subsist recursively and merging the three sorted sub lists. Analyze your algorithm and give the results under order notation
Step by Step Solution
There are 3 Steps involved in it
Get step-by-step solutions from verified subject matter experts
