[理工] [DS] Big-Oh Characterization
Give a big-Oh characterization,In terms of n,of the running time of the
following functions.
int maxSub(int a[],int n)
{
int sum=0;
int i,j,k;
for(i = 0 ; i < n ; i++)
for(j = i ; j < n ; j++)
{ int issum=0;
for(k = i ; k <= j ; k++)
issum += a[k];
}
return sum;
}
請益這題如何成為Big-oh得題目要求呢!?
--
※ 發信站: 批踢踢實業坊(ptt.cc)
◆ From: 114.39.11.105
→
04/03 12:56, , 1F
04/03 12:56, 1F
→
04/03 13:18, , 2F
04/03 13:18, 2F
→
04/03 14:26, , 3F
04/03 14:26, 3F
→
04/03 14:26, , 4F
04/03 14:26, 4F
推
04/03 16:21, , 5F
04/03 16:21, 5F
→
04/04 00:19, , 6F
04/04 00:19, 6F
推
04/05 13:00, , 7F
04/05 13:00, 7F
推
04/05 14:53, , 8F
04/05 14:53, 8F
推
04/05 15:18, , 9F
04/05 15:18, 9F