Loro-lorone nyimpen sequences, nanging menthog nyaé opposite cost profiles. Array yaiku contiguous memory kanthi O(1) indexing; linked list yaiku scattered nodes sing disambung karo pointers, kanthi O(1) insert/remove ing pung-pungé nanging ora duwe indexing.
| Operation | Array (dynamic) | Linked list |
|---|
| Access by index | O(1) | O(n) |
| Search | O(n) | O(n) |
| Insert/delete at head | O(n) | O(1) |
| Insert/delete at tail | O(1) amortized | O(1) with tail ptr |
| Insert/delete in middle | O(n) | O(n) find + O(1) splice |
| Memory overhead | low | high (pointer per node) |
| Cache locality | excellent | poor |
Array: [10][20][30][40] <- one contiguous block
Linked list: [10|*]->[20|*]->[30|null] <- scattered nodes
Dadine, arrays menang sabagean gedhe kayakbé cache locality ngalahin prabedaan Big-O kanggo ukuran sing lumrahe.
Nyinaoni loro-lorone nglilani kowe nglosakaké pilihan kanthi tepat ing wawancara tinimbang mungguh kanthi buta — lan nerangake mengapa "O(1) insert" jarang ngalahake array kontiguos.