Zane ka zaɓar tsarin data daidai don matsala?

Question

Accepted Answer

Zaɓi tsarin wanda **ayyukan mafi yawan lokaci suke da mabudi mafi karami" don namon yanayin samun damar. Fara ta hanyar jera ayyukan da za ka aiwatar, tantance yawan lokaci, sannan danganta su ga karfin tsarin.

## Jerin bincike na yanke shawara

```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)
```

## Danganta ayyukan zuwa hadaya

| Bukatu | Tsari mafi kyau | Tsarin aiki kamar yadda | 
|---|---|---|
| Samun damar bazuwar ta ta'a | dynamic array | O(1) |
| Neman ta tasaba | hash map | O(1) avg |
| Aka tsara + neman jeri | balanced BST | O(log n) |
| Kaɗan/isa akai-akai | heap | O(log n) pop |
| FIFO / LIFO | queue / stack | O(1) |
| Neman farfajiya | trie | O(L) |

## Misali na tunani

```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)
```

## Me ya sa yana da mahimmanci

Zaɓar daidai yakan zama bambanci tsakanin bayani na O(n) da O(n²) — mafi babbar damre akan aiki.

Masu ajiyar shawarewa suna bincika wannan tunani: suna so ka gani ka danganta bukatu zuwa kudin aiki, ba tunawa da tsarin ba.

Samun damar bazuwar ta ta'a	dynamic array	O(1)
Neman ta tasaba	hash map	O(1) avg
Aka tsara + neman jeri	balanced BST	O(log n)
Kaɗan/isa akai-akai	heap	O(log n) pop
FIFO / LIFO	queue / stack	O(1)
Neman farfajiya	trie	O(L)