Fastest Algorithm

Revision en1, by gXa, 2016-01-23 00:30:52

Order in terms of speed? Algorithm A requires solving 3 problems of size n/3, and takes 4n computation steps to divide and combine. Algorithm B requires solving 2 problems of size n/2 and takes n log log n computation steps to divide and combine.

A == O(nlogn) B == O(nlogn)

So both have same speed or how we will distinguish between the two?

Tags algorithm complexity

History

 
 
 
 
Revisions
 
 
  Rev. Lang. By When Δ Comment
en3 English gXa 2016-01-23 00:32:28 30 Tiny change: 'ogn)**\n****\n**B == O(nlogn)**\n****\nSo bot' -
en2 English gXa 2016-01-23 00:31:16 4
en1 English gXa 2016-01-23 00:30:52 374 Initial revision (published)