Piye cara milih antarane algoritma sortir?

Question

Accepted Answer

Milih sort temurun saka sawetara property: **time complexity**, **stability**, **in-place memory use**, lan nature saka data. Ora ana sort tunggal sing menang ing kabeh papan.

## Property kunci

- **Stable:** element sing padha tetap ngelmuhi order relatif asli (needed kanggo multi-key sorts).
- **In-place:** nggunakake O(1) utawa O(log n) extra memory.
- **Adaptive:** luwih cepet ing nearly-sorted input.

## Perbandingan

| Algoritma | Avg time | Worst | Stable | In-place |
|-----------|----------|-------|--------|----------|
| Insertion | O(n²) | O(n²) | Ya | Ya |
| Merge | O(n log n) | O(n log n) | Ya | Ora |
| Quick | O(n log n) | O(n²) | Ora | Ya |
| Heap | O(n log n) | O(n log n) | Ora | Ya |

## Panuntun

- **Cilik / nearly sorted** -> insertion sort.
- **Butuh stability utawa guaranteed O(n log n)** -> merge sort.
- **General fast in-memory, average speed penting** -> quicksort (randomized pivot).
- **Guaranteed bound + tight memory** -> heap sort.

```python
# Most languages ship a tuned hybrid; prefer it in production
sorted(data, key=lambda x: x.priority)   # stable Timsort in Python
```

## Pitfalls

Jangan hand-roll sort kejaba ono alasan khusus — library sorts (Timsort, introsort) iku battle-tested hybrids.

## Kenapa iki penting

Matching sort kanggo data lan requirements nglindungi saka wasted time lan subtle bugs (kaya ilang stability).

Pahaman trade-offs nerangke kenapa standard libraries milih hybrids kaya Timsort lan introsort.

Iki comparative judgment — ora memorizing siji algorithm — sing real engineering lan interviews ngapresiasi.

Algoritma	Avg time	Worst	Stable	In-place
Insertion	O(n²)	O(n²)	Ya	Ya
Merge	O(n log n)	O(n log n)	Ya	Ora
Quick	O(n log n)	O(n²)	Ora	Ya
Heap	O(n log n)	O(n log n)	Ora	Ya