Menene tsarin bayani kuma menene ciki tsarin bayanai (ADT)?

Question

Accepted Answer

**Tsarin bayani** shine hanyar tsara da ajiye bayani a alaƙa don samun daidai sauri. **Ciki tsarin bayanai (ADT)** shine *samfurin hali** — ayyukan da halayensu — wanda ba hannu ya shafi yadda aka aiwatar da shi.

## ADT vs implementation

ADT yana bayyana *wadanne* ayyuka ke akwai; tsarin bayani yana yanke hukunci *ta yaya* ana ajiyar su da saurin farcewa.

```text
ADT: Stack            →  push, pop, peek (LIFO behavior)
Implementations:      →  array-backed   OR   linked-list-backed

ADT: List             →  get(i), insert, remove
Implementations:      →  dynamic array  OR   linked list
```

## Why the distinction matters in code

```python
# Both satisfy the "Stack" ADT, but have different cost profiles
stack = []          # list-backed stack
stack.append(10)    # push  -> amortized O(1)
top = stack[-1]     # peek  -> O(1)
stack.pop()         # pop   -> O(1)
```

## Choosing a structure

| Concern | Question to ask |
|---|---|
| Access pattern | Random access or sequential? |
| Mutations | Frequent insert/delete in the middle? |
| Ordering | Sorted, FIFO, LIFO, or none? |
| Lookups | By index or by key? |

Zaɓin daidai shine wanda **ayyukan gida su kasansu arha** ga aikinka.

## Menene ya sa haka ya kasance mahimmanci

Zaɓin tsarin da ba daidai ba yana juya ayyukan O(1) zuwa O(n), wanda zai iya sa lambar yaduwa ta kusan jiya-jiya a girma.

Yin tunani dangane da ADTs yana ba ka damar tunanin *halaye** da farko, sannan saita aiwatarwa daban daban gida gida ba tare da sake rubutu masu kira ba.

Concern	Question to ask
Access pattern	Random access or sequential?
Mutations	Frequent insert/delete in the middle?
Ordering	Sorted, FIFO, LIFO, or none?
Lookups	By index or by key?