Unawezaje kuchagua muundo sahihi wa data kwa tatizo?

Question

Accepted Answer

Chagua muundo ambao **operesheni za mara kwa mara zaidi ni ndogo** kwa mfumo wa kufikia kwako. Anzisha kwa kuorodha operesheni utakayofanya, kadiria mzunguko wake, kisha masuishe na nguvu za muundo.

## Orodha ya kuangalia maamuzi

```text
1. How do you access data?  by index -> array
                            by key   -> hash map
                            by order -> tree / heap
2. Need ordering?           sorted   -> balanced BST / sorted array
                            FIFO     -> queue
                            LIFO     -> stack
3. Frequent middle inserts? -> linked list
4. Need fast "seen it?"     -> set / hash map
5. Need "best/min/max next" -> heap (priority queue)
```

## Masuishe operesheni na ugumu

| Haja | Muundo bora | Wastani wa operesheni muhimu |
|---|---|---|
| Ufikiaji wa nasibu kwa index | dynamic array | O(1) |
| Kutafuta kwa ufunguo | hash map | O(1) wastani |
| Iliyopangwa + hoja za eneo | balanced BST | O(log n) |
| Min/max mara kwa mara | heap | O(log n) pop |
| FIFO / LIFO | queue / stack | O(1) |
| Kutafuta kiambishi | trie | O(L) |

## Mfano wa hoja

```text
"Find the 10 most frequent words in a huge file."
 - count frequencies  -> hash map (O(1) updates)
 - keep top 10        -> min-heap of size 10 (O(log 10) per word)
```

## Kwa nini ni muhimu

Kuchagua vizuri ni mara nyingi tofauti kati ya suluhisho la O(n) na O(n²) — zana muhimu zaidi ya utendaji.

Wahojiwa hujaribu hoja hii kwa mahesabu: wanataka kuona kwamba unaunganisha operesheni na gharama, sio kumbuka muundo.

Haja	Muundo bora	Wastani wa operesheni muhimu
Ufikiaji wa nasibu kwa index	dynamic array	O(1)
Kutafuta kwa ufunguo	hash map	O(1) wastani
Iliyopangwa + hoja za eneo	balanced BST	O(log n)
Min/max mara kwa mara	heap	O(log n) pop
FIFO / LIFO	queue / stack	O(1)
Kutafuta kiambishi	trie	O(L)