[問題] list和array的搜尋速度
如題,請問一下,若我現在有一個class
class a{
int val1;
int val2;
...
}
以這個class來新增物件,然後用list當作容器裝起來
以及array(也就是a container[100])
若現在要在裡面搜尋某個物件時
何者的速度快呢?
這是今天和老闆間的討論....@@
我對這部份沒什麼概念,希望有熟悉的大大給我答案
並請提供一個有利的證據,讓我下次可以拿去跟老闆說.....^^
再麻煩各位囉,謝謝...
--
※ 發信站: 批踢踢實業坊(ptt.cc)
◆ From: 163.18.48.28
→
11/10 11:24, , 1F
11/10 11:24, 1F
→
11/10 11:37, , 2F
11/10 11:37, 2F
→
11/10 11:57, , 3F
11/10 11:57, 3F
推
11/10 12:05, , 4F
11/10 12:05, 4F
→
11/10 12:05, , 5F
11/10 12:05, 5F
→
11/10 12:06, , 6F
11/10 12:06, 6F
→
11/10 12:22, , 7F
11/10 12:22, 7F
→
11/10 12:23, , 8F
11/10 12:23, 8F
→
11/10 12:26, , 9F
11/10 12:26, 9F
推
11/10 12:30, , 10F
11/10 12:30, 10F
→
11/10 12:30, , 11F
11/10 12:30, 11F
→
11/10 12:30, , 12F
11/10 12:30, 12F
→
11/10 13:48, , 13F
11/10 13:48, 13F
→
11/10 13:50, , 14F
11/10 13:50, 14F
推
11/10 14:48, , 15F
11/10 14:48, 15F
→
11/10 14:49, , 16F
11/10 14:49, 16F
→
11/10 14:49, , 17F
11/10 14:49, 17F
→
11/10 14:50, , 18F
11/10 14:50, 18F
→
11/10 15:30, , 19F
11/10 15:30, 19F
→
11/10 15:30, , 20F
11/10 15:30, 20F
推
11/10 16:48, , 21F
11/10 16:48, 21F
→
11/10 20:40, , 22F
11/10 20:40, 22F
推
11/11 00:45, , 23F
11/11 00:45, 23F
→
11/13 19:50, , 24F
11/13 19:50, 24F
→
11/13 19:51, , 25F
11/13 19:51, 25F