![]() Best Case Complexity - It occurs when there is no sorting required, i.e.The best-case time complexity of merge sort is O(n*logn). Average Case Complexity - It occurs when the array elements are in jumbled order that is not properly ascending and not properly descending.The average case time complexity of merge sort is O(n*logn). Worst Case Complexity - It occurs when the array elements are required to be sorted in reverse order.That means suppose you have to sort the array elements in ascending order, but its elements are in descending order. The worst-case time complexity of merge sort is O(n*logn). ![]()
0 Comments
Leave a Reply. |
AuthorWrite something about yourself. No need to be fancy, just an overview. ArchivesCategories |