[理工] [資結]-複雜度
有底下三個小問題想問各位大大,希望大家可以幫幫忙解答^^
Q1:radix sort可以用sequential list或是linked list來執行嗎?
Q2:"searching for a key in a heap takes worst-case time O(n)"
這句敘述對嗎?? why??
Q3:"The time complexity of binary search is the same as searching with
binary search tree"這句敘述對嗎?? why??
麻煩大家了!!
--
※ 發信站: 批踢踢實業坊(ptt.cc)
◆ From: 140.134.213.201
→
11/18 04:09, , 1F
11/18 04:09, 1F
推
11/18 10:47, , 2F
11/18 10:47, 2F
→
11/18 10:48, , 3F
11/18 10:48, 3F
推
11/18 11:21, , 4F
11/18 11:21, 4F
→
11/18 18:53, , 5F
11/18 18:53, 5F
→
11/18 20:44, , 6F
11/18 20:44, 6F
→
11/19 11:00, , 7F
11/19 11:00, 7F
討論串 (同標題文章)