What Is The Worst Case Time Complexity Of Merge Sort? * Code Example


Example: time complexity of merge sort

O(n*Log n):  The time complexity of MergeSort is O(n*Log n) in all the 3 cases  (worst, average and best). As the mergesort always divides the array into two halves  and takes linear time to merge two halves.

Comments

Post a Comment

Popular posts from this blog

Chrome Ipad Extensions Code Example

Example: chrome extension on ipad No, Chrome extensions do not work on iPad or iPhone. There is no web browser for the iPad that allows a desktop-level extension. It is not Apple’s policy to allow developers to include downloadable module engines in their apps, for multiple reasons which also include Apple’s security restrictions.
Read more

AngularJS $on Event Handler Trigger Order

Answer : Very good question. Event handlers are executed in order of initialization. I haven't really thought about this before, because my handlers never needed to know which one run first, but by the look of you fiddle I can see that the handlers are called in the same order in which they are initialized. In you fiddle you have a controller controllerA which depends on two services, ServiceA and ServiceB : myModule .controller('ControllerA', [ '$scope', '$rootScope', 'ServiceA', 'ServiceB', function($scope, $rootScope, ServiceA, ServiceB) {...} ] ); Both services and the controller define an event listener. Now, all dependencies need to be resolved before being injected, which means that both services will be initialized before being injected into the controller. Thus, handlers defined in the services will be called first, because service factories are initialized before contro...
Read more