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.
According to me:
A == O(nlogn)
B == O(nlogn)
So both have same speed or how we will distinguish between the two?