Which of the following sorting algorithm has the worst time complexity of nlog(n)?
| A. | Heap sort |
| B. | Quick sort |
| C. | Insertio nsort |
| D. | Selection sort |
Answer : A Explanation : |
|
|
Option: A Explanation : Explanation will come here. Explanation will come here. Explanation will come here. Explanation will come here. Explanation will come here. |
