What is the time complexity of Kadane’s algorithm?
|Answer» B. o(n)|
|Explanation: the time complexity of kadane’s algorithm is o(n) because there is only one for loop which scans the entire array exactly once.|
Login to Continue
It will take less than 2 minutes