Ni nini abstract data type (ADT) na kwa nini kuitenganisha na utekelezaji wake?

Question

Accepted Answer

**Abstract data type** inabainisha seti ya thamani na **operesheni** zinazoruhusiwa juu yake, zilizoelezwa kwa muhtasari wa **tabia** — si kwa code. Utekelezaji ni muundo wa konkreti (array, linked list, mti) unaofikiri tabia hiyo.

## ADT sawa, utekelezaji tofauti

```text
ADT "Queue":  enqueue, dequeue, peek  (FIFO contract)

Implementation A: array + two indices (ring buffer)
Implementation B: doubly linked list with head/tail pointers
Both honor the SAME contract; cost profiles differ.
```

## Kwa nini kutenganisha

```python
# Callers depend on the CONTRACT, not the internals
class Stack:
    def push(self, x): ...
    def pop(self): ...
    def peek(self): ...
# Swap a list for a linked list internally — callers never change.
```

## ADT za kawaida na utekelezaji wa kawaida

| ADT | Utekelezaji wa kawaida |
|---|---|
| List | dynamic array, linked list |
| Stack | array, linked list |
| Queue | ring buffer, linked list |
| Map | hash table, balanced tree |
| Priority Queue | binary heap |

## Kwa nini ni muhimu

Kuprogramu kwa ADT (interface) inashikilia code kuwa flexible: unaweza kuboresha utekelezaji baadaye bila kuvunja waito.

Inakamatia pia hoja — unabainisha *tabia gani* unahitaji kwanza, kisha kuchagua muundo rahisi zaidi unaopaewa.

ADT	Utekelezaji wa kawaida
List	dynamic array, linked list
Stack	array, linked list
Queue	ring buffer, linked list
Map	hash table, balanced tree
Priority Queue	binary heap