Search Interview Questions | Click here and help us by providing the answer. Click Correct / Improve and please let us know. |
|
|||
|
| ||||
| Interview Questions and Answers | ||||
| ||||
| Ans. The sorting algorithm is a modified mergesort. This algorithm offers guaranteed n log(n) performance. | ||||
a. Set b. List c. Map d. Any Collection implementation | ||||