Learn: Divide and conquer
The pattern: split the problem into smaller parts of the same kind, solve each part (usually with recursion), then combine the answers.
Examples: merge sort (split, sort halves, merge), quick sort, binary search (keep only one half).
Why it helps: splitting in half again and again gives about log n levels, which is where the "log n" in O(n log n) comes from.
Read more: https://www.geeksforgeeks.org/dsa/divide-and-conquer/
#tip · TIP-036
codementor
npub1u6…v0yg2
2026-10-25 13:37:50 UTC
Author Public Key
npub1u69qs4hfpkve0v0hy85s2fycjeqjm4ts8xdfs7ew3l270l87yfuspv0yg2Seen on
wss://relay.primal.netPublished at
2026-10-25 13:37:50 UTCEvent JSON
{
"id": "ed952fa7d63355e437bf6cf26aab2312e8634bea9d0c3318f3bc90c766834925",
"pubkey": "e68a0856e90d9997b1f721e905249896412dd570399a987b2e8fd5e7fcfe2279",
"created_at": 1792935470,
"kind": 1,
"tags": [
[
"t",
"tip"
]
],
"content": "Learn: Divide and conquer\n\nThe pattern: split the problem into smaller parts of the same kind, solve each part (usually with recursion), then combine the answers.\n\nExamples: merge sort (split, sort halves, merge), quick sort, binary search (keep only one half).\n\nWhy it helps: splitting in half again and again gives about log n levels, which is where the \"log n\" in O(n log n) comes from.\n\nRead more: https://www.geeksforgeeks.org/dsa/divide-and-conquer/\n\n#tip · TIP-036",
"sig": "984b9f76af580535c34f5a5686038217fd5b00b16d83a8a49d0ff9e64e40bc3f74a96cb90da29e673bd670841dca8ca530a5a0979d1dbf78f58464664b3dca5d"
}