Assign Cookies - Algorithm

Here is the greedy algorithm:

$1.$ Sort children by greed (ascending)

$2.$ Sort cookies by size (ascending)

$3.$ Use two pointers: one for children, one for cookies

$4.$ For each cookie: if it satisfies the current child, move both pointers; otherwise, move only the cookie pointer

$5.$ Count satisfied children The two-pointer technique works because both arrays are sorted. You never need to go back. Time: $O(n \log n)$. Space: $O(1)$. The two-pointer pattern appears in many greedy algorithms. It works when both arrays are sorted and you process each element exactly once.