[理工] DS時間複雜度
小弟不才,想請問一題,及一個觀念
(1)這題是要算tight asymptotic upper bounds for T(n)
T(n)= 4T(n/4) + n/lgn
ANS為O(n*lglgn) (交大97DS)
================================================
(2)第2個我想問一個觀念,有關時間複雜度的.
(a)
T(n)=2T(n/2)+1
T(n)=T(n/2)+T(n/2)+1
這2個時間複雜度是不是 不一樣
(b)
T(n)=2T(n/2)+1
T(n)=2T(n/2)+n
這2個時間複雜度是不是 會一樣
先謝謝各位了
--
※ 發信站: 批踢踢實業坊(ptt.cc)
◆ From: 122.117.87.164
推
02/02 00:38, , 1F
02/02 00:38, 1F
→
02/02 00:42, , 2F
02/02 00:42, 2F
→
02/02 00:43, , 3F
02/02 00:43, 3F
→
02/02 00:45, , 4F
02/02 00:45, 4F
推
02/02 01:10, , 5F
02/02 01:10, 5F
推
02/02 01:10, , 6F
02/02 01:10, 6F
→
02/02 01:11, , 7F
02/02 01:11, 7F
→
02/02 02:04, , 8F
02/02 02:04, 8F
→
02/02 09:56, , 9F
02/02 09:56, 9F
→
02/02 09:57, , 10F
02/02 09:57, 10F
推
02/02 13:00, , 11F
02/02 13:00, 11F
→
02/02 14:11, , 12F
02/02 14:11, 12F
推
02/02 14:40, , 13F
02/02 14:40, 13F
推
02/02 16:50, , 14F
02/02 16:50, 14F
→
02/02 22:05, , 15F
02/02 22:05, 15F
→
02/02 23:52, , 16F
02/02 23:52, 16F
→
09/11 14:50, , 17F
09/11 14:50, 17F