[理工] [algo]-觀念問題
一、If we have proved that the lower bound of an NP-complete problem is
polynomial, then we have proved that NP = P.
二、The worst case time complexity of finding the second minimum key in an
n-key heap is?
三、Radix sort can only be performed on sequential list, not on link list.
四、Searching for a key in a heap takes worst case time O(n).
其中第一、三、四是(True/False),第二為時間複雜度,
麻煩解答了,感謝。
--
※ 發信站: 批踢踢實業坊(ptt.cc)
◆ From: 61.57.79.11
推
03/04 14:19, , 1F
03/04 14:19, 1F
推
03/04 14:27, , 2F
03/04 14:27, 2F
推
03/04 14:35, , 3F
03/04 14:35, 3F
推
03/04 16:05, , 4F
03/04 16:05, 4F
→
03/04 16:12, , 5F
03/04 16:12, 5F
→
03/04 16:13, , 6F
03/04 16:13, 6F
→
03/04 16:15, , 7F
03/04 16:15, 7F
※ 編輯: assassin88 來自: 61.57.79.11 (03/04 16:17)
推
03/04 16:18, , 8F
03/04 16:18, 8F
推
03/04 17:01, , 9F
03/04 17:01, 9F
推
03/04 17:28, , 10F
03/04 17:28, 10F
→
03/04 17:28, , 11F
03/04 17:28, 11F
→
03/04 17:28, , 12F
03/04 17:28, 12F
→
03/04 17:29, , 13F
03/04 17:29, 13F
推
03/04 17:46, , 14F
03/04 17:46, 14F
→
03/04 17:46, , 15F
03/04 17:46, 15F
→
03/04 17:46, , 16F
03/04 17:46, 16F
推
03/04 18:00, , 17F
03/04 18:00, 17F
推
03/04 18:12, , 18F
03/04 18:12, 18F
→
03/04 18:12, , 19F
03/04 18:12, 19F
→
03/04 18:13, , 20F
03/04 18:13, 20F
→
03/04 18:14, , 21F
03/04 18:14, 21F
→
03/04 18:31, , 22F
03/04 18:31, 22F
推
03/04 18:38, , 23F
03/04 18:38, 23F
→
03/04 18:39, , 24F
03/04 18:39, 24F