What is the runtime efficiency of using brute force technique for the closest pair problem?
|B.||o(n log n)|
|D.||o(n3 log n)|
|Answer» C. o(n2)|
|Explanation: the efficiency of closest pair algorithm by brute force technique is mathematically found to be o(n2).|
Login to Continue
It will take less than 2 minutes